Week |
Day |
Topics |
Reading |
Recordings |
1 |
1 |
No Class - Martin Luther King, Jr. Day |
|
|
2 |
Introduction and OO Review |
1.1-1.7 Slides |
Jones |
3 |
OO Review |
Skim Appendix A1-A8, A10-A12, and B1 Slides |
Jones |
2 |
1 |
Introduction and JavaFX Basics |
JavaFX Overview |
Jones |
2 |
JavaFX and Event Handling |
|
Jones |
3 |
Event Handling and Inner Classes |
Slides |
Jones |
3 |
1 |
FXML - FX Markup Language |
FXML Details Slides |
|
2 |
Catch-up |
|
Jones |
3 |
Functional Programming |
|
Jones |
4 |
1 |
Functional Programming continued |
Slides |
Jones |
2 |
Algorithm Efficiency and Big-O |
2.1 |
Jones |
3 |
ArrayLists |
2.2-2.4 Slides |
Jones |
5 |
1 |
ArrayLists cont... |
2.2-2.4 |
Jones Part I, Jones Part II |
2 |
Review |
FX practice Functional practice |
Static Review |
3 |
Exam I |
|
|
6 |
1 |
Testing |
2.5-2.6 Slides |
Taylor |
2 |
Linked Lists |
2.5-2.6 Slides |
Taylor |
3 |
Linked Lists cont... |
2.7-2.10 |
Jones |
7 |
1 |
Iterators |
3 |
Jones |
2 |
Stacks and Queues |
4.1-4.4 practice |
Jones |
3 |
CircularQueues |
4.5-4.7 |
|
8 |
1 |
Binary Search |
|
Taylor |
2 |
Recursion |
5.1-5.2 |
Taylor |
3 |
Recursion continued |
5.3-5.5 |
Jones |
Spring Break |
9 |
1 |
Binary Trees and Binary Search Trees |
6.3-6.5 |
Jones |
2 |
Binary Search Trees |
6.1-6.2 |
Jones |
3 |
Trees and Tree Traversals |
|
Jones |
10 |
1 |
Catch-up |
|
Jones |
2 |
Review |
|
Jones |
3 |
Exam II |
|
|
11 |
1 |
Sets and Maps |
7.1-7.2 |
Jones |
2 |
Hash Tables |
7.3-7.4 |
Jones |
3 |
Hashing and Collision Handling |
7.5-7.6 |
Jones |
12 |
1 |
Selection and Insertion Sort |
8.1-8.3 Slides |
Jones |
2 |
Shell and Merge Sort |
8.4-8.6 Slides |
Jones |
3 |
Heaps and Heap Sort |
6.6, 8.8 |
Jones |
13 |
1 |
Asymptotic Time Complexity Revisited |
|
Jones |
2 |
Asymptotic Space Complexity |
|
Jones |
3 |
Shallow/Deep copies and Cloning |
|
Jones |
14 |
1 |
Tree Rotations, AVL Trees
|
9.1-9.2 |
|
2 |
Red-Black Trees |
9.3 |
|
3 |
More Trees |
|
|
15 |
1 |
How to Pick a Data Structure |
|
|
2 |
Review |
|
|
3 |
Review |
|
|
16 |
Common Final Exam, (tentative) 11am-1pm, Thursday, May 15, 2025 |