| 9/23 | L1 Why are you here |
| 9/25 | L2 Asymptotics, Worst-Case Analysis, and MergeSort |
| 9/30 | HW0 Due (graded for completion) |
| 9/30 | L3 Solving Recurrences and the Master Theorem |
| 10/2 | L4 Median and Selection |
| 10/3 | HW1 Due (L1,L2) |
| 10/7 | L5 Randomized Algorithms and QuickSort |
| 10/9 | L6 BucketSort and Lower Bounds for Sorting |
| 10/10 | HW2 Due (L3,L4) |
| 10/14 | L7 Binary Search Trees and Red-Black Trees |
| 10/16 | EXAM 1 (L1-L4, with light coverage of L5, L6) |
| 10/21 | L8 Hashing |
| 10/23 | L9 Graphs and BFS and DFS |
| 10/24 | HW3 Due (L5, L6, L7) |
| 10/28 | L10 Strongly Connected Components |
| 10/30 | L11 Dijkstra and Bellman-Ford |
| 10/31 | HW4 Due (L8, L9) |
| 11/4 | Democracy Day |
| 11/6 | EXAM 2 (L5-L9, with light coverage of L10, L11) |
| 11/11 | L12 Dynamic Programming: Bellman-Ford (again) and Floyd-Warshall |
| 11/13 | L13 More dynamic programming: LCS, Knapsack, Independent Set |
| 11/14 | HW5 Due (L10, L11) |
| 11/18 | L14 Greedy Algorithms |
| 11/20 | L15 Minimum Spanning Trees |
| 11/21 | HW6 Due (L12, L13) |
| 11/25 | Fall break! |
| 11/27 | Fall break! |
| 12/2 | L16 Max-Flow and the Ford-Fulkerson Algorithm |
| 12/4 | L17 What’s Next? |
| 12/5 | HW7 Due (L14, L15, L16) |
| 12/10 | Final Exam (Cumulative, with emphasis on L10-L16) |