| 1 | Mo 1 Feb | C++ Review | HEI 3,4 PSW 7,8,10,12 |
Assign Proj 1 |
| 2 | We 3 Feb | OOP Fundamentals | HEI 4 PSW 7,8,10,12 |
|
| 3 | Mo 8 Feb | Asymptotic Analysis Review | HEI 1,2 | |
| 4 | We 10 Feb | List ADT and Implementations | HEI 5 | |
| 5 | Mo 15 Feb | List Implementations | HEI 5 | Proj 1 Due Assign Proj 2 |
| 6 | We 17 Feb | Stacks, Queues, and Applications | HEI 6 | |
| 7 | Mo 22 Feb | Binary Search Trees | HEI 7 | |
| 8 | We 24 Feb | Binary Search Trees | HEI 7 | |
| 9 | Mo 1 Mar | Exam 1 | ||
| 10 | We 3 Mar | Skip Lists | HEI 5 | |
| 11 | Mo 8 Mar | Hashing | HEI 8 | |
| Mo 8 Mar | Proj 2 Due Assign Proj 3 |
|||
| 12 | We 10 Mar | Hashing | HEI 8 | |
| 13 | Mo 15 Mar | Priority Queues | HEI 9 | |
| 14 | We 17 Mar | Priority Queues | HEI 9 | |
| 22-26 Mar | Spring Break | |||
| 15 | Mo 29 Mar | Balanced Search Trees | HEI 11 | Assign Proj 4 |
| 16 | We 31 Mar | Balanced Search Trees | HEI 11 | |
| Fr 2 Apr | Proj 3 Due | |||
| 17 | Mo 5 Apr | Balanced Search Trees | HEI 11 | |
| 18 | We 7 Apr | Balanced Search Trees | HEI 11 | |
| 19 | Mo 12 Apr | Exam 2 | ||
| 20 | We 14 Apr | B-Trees | Notes | |
| 21 | Mo 19 Apr | Graphs | HEI 14 | Proj 4 Due Assign Proj 5 |
| 22 | We 21 Apr | Graphs | HEI 14 | |
| 23 | Mo 26 Apr | Graphs | HEI 14 | |
| 24 | We 28 Apr | Disjoint Set | HEI 13 | |
| 25 | Mo 3 May | Disjoint Set | HEI 13 | |
| 26 | We 5 May | Advanced Topics | HEI 13 | |
| 27 | Mo 10 May | Advanced Topics | HEI 13 | Proj 5 Due |
| 28 | We 12 May | Review | ||
| Mo 17 May | Final Exam, 6:00-8:00pm | |||
| Th 4 Feb | Project 1 |
| Th 18 Feb | Project 2 |
| Th 25 Feb | Exam 1 Review |
| Th 11 Mar | Project 3 |
| Th 1 Apr | Project 4 |
| Th 8 Apr | Exam 2 Review |
| Th 22 Apr | Project 5 |
| Th 13 May | Final Exam Review |