Schedule

Week Day Topics Reading Recordings
1 1 No Class - Martin Luther King, Jr. Day  
2 Introduction and OO Review 1.1-1.7 Slides Taylor 1 Jones 1
3 OO Review Skim Appendix A1-A8, A10-A12, and B1 Slides Taylor 2 Taylor 3 (file I/O) Taylor 4 (lab 1) Jones 2
2 1 Introduction and JavaFX Basics JavaFX Overview Jones 3 Taylor A
2 JavaFX and Event Handling Jones 4 Taylor B
3 Event Handling and Inner Classes Slides Taylor 5 (lab 2) Jones 5 Taylor C
3 1 FXML - FX Markup Language FXML Details Slides Taylor 6
2 Catch-up Taylor D Jones 7
3 Functional Programming Taylor 7 Jones 8
4 1 Functional Programming continued Slides Taylor 8 Jones 9
2 Algorithm Efficiency and Big-O 2.1 Taylor E Jones 10
3 ArrayLists 2.2-2.4 Slides Taylor 9 Jones 11
5 1 ArrayLists cont... 2.2-2.4 Taylor 10 Jones 12
2 Review FX practice Functional practice Taylor E Jones 13
3 Exam I    
6 1 Testing 2.5-2.6 Slides Taylor 11 Taylor 12 Jones 14
2 Linked Lists 2.5-2.6 Slides Taylor F Taylor G Jones 15
3 Linked Lists cont... 2.7-2.10 Taylor 13 Jones 16 Jones 17
7 1 Iterators 3 Taylor 14 Jones 18
2 Stacks and Queues 4.1-4.4 practice Taylor 15 Jones 19
3 CircularQueues 4.5-4.7 Taylor 16 Jones 20
8 1 Binary Search   Taylor 17 Jones 21
2 Recursion 5.1-5.2 Taylor 18 Jones 22
3 Recursion continued 5.3-5.5 Jones 23
Spring Break
9 1 Binary Trees and Binary Search Trees 6.3-6.5 Taylor 19 Jones 24
2 Binary Search Trees 6.1-6.2 Taylor 20 Taylor 21 Jones 25
3 Trees and Tree Traversals Taylor 22 Jones 26
10 1 Catch-up   Taylor 23 Jones 27
2 Review   Jones 28 Jones 29
3 Exam II    
11 1 Sets and Maps 7.1-7.2 Taylor 24 Jones 30
2 Hash Tables 7.3-7.4 Jones 31
3 Hashing and Collision Handling 7.5-7.6 Taylor 25 Jones 32
12 1 Selection and Insertion Sort 8.1-8.3 Slides Taylor 26 Taylor 27 Jones 33
2 Heaps and Heap Sort 6.6, 8.8 Visualization Jones 34
3 Shell and Merge Sort 8.4-8.6 Slides Taylor 28 Jones 35
13 1 Asymptotic Time Complexity Revisited Jones 36
2 Asymptotic Space Complexity Taylor 29
3 Shallow/Deep copies and Cloning Jones 37
14 1 Tree Rotations 9.1 Taylor 30 Taylor 31 Jones 38
2 AVL Trees 9.2 Visualization Jones 39
3 Red-Black Trees 9.3 Taylor 32 Jones 40
15 1 How to Pick a Data Structure   Jones 41
2 Review   Jones 42
3 Review   Jones 43
16 Common Final Exam, (tentative) 11am-1pm, Wednesday, May 13, 2026