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