M | Tuesday | W | Thursday | F |
---|---|---|---|---|
8
|
9
|
10
|
Module 0: Orientation & Review
11
Before Class:
![]() ![]() ![]() ![]() Arrays of basic types (1 of the following): Arrays of Objects (up to Section 12.6) ArrayLists of Objects Enumeration Type Class: Introductions Review Game:
Enumeration Types Due: Self-review array problems: CodingBat: Array 1 and CodingBat: Array 2 |
12
|
15
|
Deadline for full refund; Module 1: Generic Type and Comparator Class
16
Before Class:
Generic Type Generics (The Java Tutorials) Comparable and Comparator ![]() Class: Enumeration Types Generic Types (exercises) Comparable versus Comparator (exercises) |
17
|
Module 2: Search Algorithms & Computational Complexity
18
Due:
Before Class: ![]() Linear and Binary Search (optional) Comparing Searching Algorithms Animations (optional) ![]() Class: Comparable versus Comparator (exercises)
Class Notes Linear and Binary Search Algorithm Analysis (exercises) Computational Complexity of Search Algorithms (exercises) |
19
|
22
|
23
Before Class:
![]() ![]() ![]() ![]() Class: Algorithm Analysis (exercises) |
24
|
25
Before Class:
![]() ![]() Class: CodeWorkout Registration Algorithm Analysis (exercises, table of values) Class Notes |
26
|
29
|
Module 3: Linked Lists, Stacks & Queues
30
Due:
![]() Before Class: ![]() Class: Linked Lists (exercises) Due: ![]() |
31
|
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
1
|
2
|
|||
5
|
6
Before Class:
![]() Class: Stacks (exercises) Class Notes Due: ![]() |
7
|
8
Class:
Stacks (exercises) Queues (exercises) Class Notes Due: ![]() Due: ![]() |
9
|
12
|
13
|
14
|
15
|
16
|
19
|
Module 4: Recursion
20
College Career Fair (SCCT Lobby 10 AM - 2 PM)
Before Class: ![]() Recursion Class: Recursion (exercises) |
21
|
22
Before Class:
![]() Class: Project 3 - Recursive Maze Solver Demo Recursion (exercises) Making Change Due: Self-review recursion problems: https://codingbat.com/java/Recursion-1 ![]() |
23
|
26
|
Module 5: Trees
27
Before Class:
![]() ![]() ![]() Tree Traversal Methods (optional) ![]() Class: Binary Trees Intro Game Binary Tree Traversals (exercises) |
28
|
29
Before Class:
![]() ![]() Class: Binary Tree Traversals (exercises) Binary Search Trees (exercises) Due: |
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
1
|
2
Before Class:
![]() ![]() ![]() ![]() ![]() Class: Sorting Algorithms (exercises) |
3
|
4
Before Class:
![]() Comparing Sorting Algorithms Animations Comparing Sorting Animations ![]() ![]() Class: Sorting Algorithms (exercises) |
5
|
8
|
Module 8: Hashing
9
Before Class:
![]() ![]() ![]() Class: Hash Table Basics (exercises)
Resolving Collisions (exercises)
Due: ![]() |
10
|
11
Before Class:
![]() ![]() ![]() Class: Resolving Collisions (exercises)
Rehashing (exercises) Efficiency of Hashing (exercises) |
12
|
15
|
Module 9: Graphs
16
Before Class:
![]() ![]() Graphs and traversal methods (optional) Class: Graphs Intro (exercises) (terminology) Graph Traversals (exercises) Due: |
17
|
18
Before Class:
![]() ![]() ![]() ![]() Class: Graph Traversals (exercises) Topological Sorting (exercises) Shortest Path (exercises) |
19
|
22
|
23
Before Class:
![]() ![]() ![]() ![]() Class: Topological Sorting (exercises) Shortest Path (exercises) Circuits (exercises) Class Notes Due: Due: |
24
|
Last Day of Class
25
Class:
Final Exam Preparation Game (topics) |
26
|
29
|
Course Evaluation Surveys close; Study Day
30
|
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
1
|
2
|
Final Exam
3
|