Week |
Day |
Topics |
Reading |
Lab |
1 |
1 |
Introduction and OO Review |
1.1-1.4, A.5, skim A.1-4 and A.5-7 |
Lab 1 |
2 |
OO Review |
1.5-1.8, A.8, skim A.9-12, and B |
3 |
Introduction and JavaFX Basics |
17.1-17.5 |
2 |
1 |
JavaFX Basics cont... |
17.1-17.5 |
Lab 2 |
2 |
JavaFX and Event Handling with method references |
17.6-17.8 |
3 |
Event Handling and Inner Classes Review |
17.13-17.14, 17.17 |
3 |
1 |
FXML - FX Markup Language video |
18.1-18.4 |
Lab 3 |
2 |
Functional Programming |
|
3 |
Functional Programming |
|
4 |
1 |
Algorithm Efficiency and Big-O |
2.1 |
Lab 4 |
2 |
ArrayLists |
2.2-2.4 |
3 |
Generics in Java |
|
5 |
1 |
Linked Lists |
2.5-2.6 |
Lab 5 |
2 |
Linked Lists cont... |
2.5-2.6 |
3 |
Class Activity |
|
6 |
1 |
Iterators |
2.7-2.10 |
Lab 6 |
2 |
Review |
|
3 |
Exam I |
|
7 |
1 |
Testing |
3 |
Lab 7 |
2 |
Testing continued |
|
3 |
Stacks and Queues |
4.1-4.4 |
8 |
1 |
CircularQueues |
4.5-4.7 |
Lab 8 |
2 |
Recursion |
5.1-5.2 |
3 |
Recursion continued |
5.3-5.5 |
9 |
1 |
Binary Search |
|
Lab 9 |
2 |
Binary Trees and Binary Search Trees |
6.3-6.5 |
3 |
Binary Search Trees |
6.1-6.2 |
10 |
1 |
Class Activity |
|
Lab 10 |
2 |
Trees and Tree Traversals |
|
3 |
Sets and Maps |
7.1-7.2 |
11 |
1 |
Hash Tables |
7.3-7.4 |
Lab 11 |
2 |
Hashing and Collision Handling |
7.5-7.6 |
3 |
Class Activity |
|
12 |
1 |
Selection and Insertion Sort |
8.1-8.3 |
Lab 12 |
2 |
Shell and Merge Sort |
8.4-8.6 |
3 |
Class Activity |
|
13 |
1 |
Review |
|
Lab 13 |
2 |
Exam II |
|
3 |
Algorithm Analysis Revisited |
|
14 |
1 |
Space Complexity |
|
Lab 14 |
2 |
Class Activity |
|
3 |
Shallow/Deep copies and Cloning |
|
15 |
1 |
Class Activity |
|
Lab 15 |
2 |
How to Pick a Data Structure |
|
3 |
Review for Final |
|
16 |
Common Final Exam, 11am-1pm, TBD |