| Date |
Topic |
Reading |
Due |
| Th 1/30 | Intro. & Order of Growth | 1.1 - 2.2 |
|
| Tu 2/4 | Analyzing Loop Algorithms | 3.1 - 3.2 |
|
| Th 2/6 | Analyzing Recursive Algorithms | 4.1 - 4.2 |
HW 1 due |
| Tu 2/11 | The Master Theorem | 4.3 - 4.4 |
|
| Th 2/13 | Heapsort | 7.1 - 7.5 |
HW 2 due |
| Tu 2/18 | Quicksort | 8.1 - 8.4 |
|
| Th 2/20 | Lower Bounds & Linear-Time Sorts | 9.1 - 9.4 |
HW 3 due |
| Tu 2/25 | Linear-Time Selection | 10.1 - 10.3 |
|
| Th 2/27 | Exam 1 | |
|
| Tu 3/4 | Exam 1 Discussion | |
|
| Th 3/6 | Hashing | 12.1 - 12.2 |
HW 4 due |
| Tu 3/11 | Hashing | 12.3 - 12.4 |
|
| Th 3/13 | Red-Black Trees | 14.1 - 14.4 |
HW 5 due |
| Tu 3/18 | Dynamic Programming | 16.1 - 16.2 |
|
| Th 3/20 | Dynamic Programming | 16.3 - 16.4 |
HW 6 due |
| Tu 3/25 | Spring Break | |
|
| Th 3/27 | Spring Break | |
|
| Tu 4/1 | Dynamic Programming | |
|
| Th 4/3 | Disjoint-Set Union | 22.1 - 22.3 |
HW 7 due |
| Tu 4/8 | Review | |
|
| Th 4/10 | Exam 2 | |
|
| Tu 4/15 | Exam 2 Discussion | |
|
| Th 4/17 | Breadth & Depth First Search | 23.1 - 23.3 |
HW 8 due |
| Tu 4/22 | Topological Sort | 23.4 - 23.5 |
|
| & Connected Components | |
|
| Th 4/25 | Minimum Spanning Tree | 24.1 - 24.2 |
HW 9 due |
| Tu 4/29 | Single-Source Shortest Paths | 25.1 - 25.4 |
|
| Th 5/1 | All-Pairs Shortest Paths | 26.1 - 26.2 |
HW 10 due |
| Tu 5/6 | Advanced Topic TBA | |
|
| Th 5/8 | Advanced Topic TBA | |
PROJECT due |
| TBA | Final Exam | | |