Tentative Schedule
Week | Day | Topics | Reading | Lab |
---|---|---|---|---|
1 03/09-03/13 |
1 | Introduction Java Collections Framework and Lists video1 video2 |
1, skim 2.1-2.2 | Lab 1: Autocomplete |
2 | ArrayLists | 2.2-2.4, A.8, skim A, B, C | ||
3 | Generics in Java | |||
2 03/16-03/20 |
1 | ArrayLists | 2.2-2.4, A.8, skim A, B, C | Lab 2: Dot to Dot Generator |
2 | Linked Lists | 2.5-2.6 | ||
3 | Algorithm Efficiency and Big-O | 2.1 | ||
3 03/23-03/27 |
1 | Iterators | 2.7-2.10 | Lab 3: Dot to Dot Generator Revisited |
2 | Testing | 3 | ||
3 | Stacks and Queues | 4.1-4.4 | ||
4 03/30-04/03 |
1 | Review | Lab 4: Dot to Dot Generator Benchmarking | |
2 | Exam I | |||
3 | CircularQueues | 4.5-4.7 | ||
5 04/06-04/10 |
1 | Recursion | 5.1-5.2 | Lab 5: Buffered IO |
2 | Work on Lab 5 | |||
3 | Recursion continued | 5.3-5.5 | ||
6 04/13-04/17 |
1 | Binary Search | Lab 6: Recursion | |
2 | Binary Trees and Binary Search Trees | 6.3-6.5 | ||
3 | Binary Search Trees | 6.1-6.2 | ||
7 04/20-04/24 |
1 | Trees and Tree Traversals | Lab 7: Morse Decoder | |
2 | Review | |||
3 | Exam II | |||
8 04/27-05/01 |
1 | Sets and Maps | 7.1-7.2 | Lab 8: Morse Encoder |
2 | Hash Tables | 7.3-7.4 | ||
3 | Hashing and Collision Handling | 7.5-7.6 | ||
9 05/04-05/08 |
1 | Tree Rotations and AVL trees | 9.1-9.2 | Lab 9: Autocomplete Revisited |
2 | Red-Black Trees | 9.3 | ||
3 | Shallow/Deep copies and Cloning | |||
10 05/11-05/15 |
1 | Algorithm Analysis revisited | Lab 10: HashTables | |
2 | How to Pick a Data Structure | |||
3 | Review for Final | |||
11 05/18-5/22 |
Common Final Exam, 11am-1pm, TBD |