Tentative Schedule
Week | Day | Topics | Reading | Recordings |
---|---|---|---|---|
1 | 1 | Introduction and OO Review | 1.1-1.7 | Lecture 1 |
2 | OO Review | Skim Appendix A1-A8, A10-A12, and B1 | Lecture 2 | |
3 | File IO | Review | Lecture 3 | |
2 | 1 | No Class - Labor Day | ||
2 | Introduction and JavaFX Basics | JavaFX Overview | Lecture 4 | |
3 | Lab 2 and Exceptions Intro | Lecture 5 | ||
3 | 1 | Exceptions How to see my lab feedback | Review | Lecture 6 |
2 | JavaFX and Event Handling | Lecture 7 | ||
3 | Event Handling and Inner Classes | Review | Lecture 8 | |
4 | 1 | FXML - FX Markup Language | FXML Details Review | Lecture 9 |
2 | Functional Programming | Lecture 10 | ||
3 | Functional Programming continued | Review | Lecture 11 | |
5 | 1 | Algorithm Efficiency and Big-O | 2.1 | Lecture 12 |
2 | ArrayLists | 2.2-2.4 | Lecture 13 | |
3 | More Big-O Generics in Java | Lecture 14 | ||
6 | 1 | Linked Lists | 2.5-2.6 | Lecture 15 |
2 | Linked Lists cont... | 2.5-2.6 | Lecture 16 | |
3 | Iterators | 2.7-2.10 | Lecture 17 | |
7 | 1 | Review | Practice Exam | |
2 | Exam I | |||
3 | Iterators again | 3 | Lecture 18 | |
8 | 1 | Testing | 3 Review | Lecture 19 |
2 | Stacks and Queues | 4.1-4.4 | Lecture 20 | |
3 | CircularQueues | 4.5-4.7 | Lecture 21 | |
9 | 1 | Binary Search | Lecture 22 | |
2 | Recursion | 5.1-5.2 | Lecture 23 | |
3 | Recursion continued | 5.3-5.5 | Lecture 24 | |
10 | 1 | Binary Trees and Binary Search Trees | 6.3-6.5 | Lecture 25 |
2 | Binary Search Trees | 6.1-6.2 | Lecture 26 | |
3 | Trees and Tree Traversals | Lecture 27 | ||
11 | 1 | Sets and Maps | 7.1-7.2 | Lecture 28 |
2 | Hash Tables | 7.3-7.4 | Lecture 29 | |
3 | Hashing and Collision Handling | 7.5-7.6 | Lecture 30 | |
12 | 1 | Review | ||
2 | Exam II | |||
3 | Algorithm Analysis Revisited | Lecture 31 | ||
13 | 1 | Selection and Insertion Sort | 8.1-8.3 | Lecture 31 |
2 | Shell and Merge Sort | 8.4-8.6 | Lecture 32 | |
3 | No class (Happy Thanksgiving) | |||
14 | 1 | Tree Rotations, AVL Trees | 9.1-9.2 | Lecture 33 |
2 | Red-Black Trees | 9.3 | Lecture 34 | |
3 | Shallow/Deep copies and Cloning | Lecture 35 | ||
15 | 1 | Work on Lab | ||
2 | Space Complexity | Lecture 36 | ||
3 | How to Pick a Data Structure | |||
16 | Common Final Exam, 11am-1pm, Tuesday, Dec. 12 |