| Week | Material Covered | Corresponding Reading | Homework Assigned |
| Week 1: Jan 24 | Stable Matching, Review | Ch.1; also Ch.2, 3, and Discrete Math Handout for the Quiz | None: study for Quiz |
| Week 2: Jan 28 and Jan 31 | Quiz on Jan 28 Greedy Algorithms: Exchange Argument |
Sec 4.2 | Problem Set 1: Due Thursday, Feb 7 |
| Week 3: Feb 4 and 7 | Greedy Algorithms:Shortest Path, MST and Clustering |
Sec 4.4-4.5, 4.7 | Problem Set 2: Due Thursday, Feb 14 |
| Week 4: Feb 11 and 14 | Dynamic Programming:Weighted Interval Scheduling, Segmented Least Squares | Sec 6.1-6.3 | Problem Set 3: Due Thursday, Feb 21 |
| Week 5: Feb 19 and 21 | Dynamic Programming:Knapsack, Sequence Alignment, Longest Increasing Subsequence. | Sec 6.4, 6.6-6.7 | Problem Set 4: Due Thursday, Feb 28 |
| Week 6: Feb 25 and Feb 28 | Dynamic Programming: Shortest Path Divide and Conquer: Closest Pair |
Sec 6.8, 5.1-5.4 | Problem Set 5: Due Thursday, Mar 21 |
| Week 7: Mar 4 and 7 | Divide and Conquer: Multiplication and FFT Midterm Exam on Mar 7 |
Sec 5.5-5.6 | Study for Midterm Exam |
| Week 8: Spring Break | |||
| Week 9: Mar 18 and 21 | Network Flow:Max-Flow Min-Cut, Bipartite Matching, Disjoint Paths (drop deadline is Friday) |
Sec 7.1-7.2, 7.5-7.6 | |
| Week 10: Mar 25 and 28 | Network Flow: Circulations, Survey Design, Airline Scheduling |
Sec 7.7-7.9 | |
| Week 11: Apr 1 and 4 | Network Flow: Image Segmentation, Project Selection. | Sec 7.10-7.11 | |
| Week 12: Apr 8 and 11 | NP and Computational Intractability | Sec 8.1-8.4 | |
| Week 13: Apr 15 and 18 | NP and Computational Intractability, Dealing with Intractability | Sec 8.5-8.8, 10.2 | |
| Week 14: Apr 22 and 25 | Approximation Algorithms | Sec 10.1, 11.1-11.2 | |
| Week 15: Apr 29 and May 2 | Approximation Algorithms, Linear Programming | Sec 11.4-11.6, 11.8 | |
| Week 16: May 6 | Local Search | Sec 12.1-12.4 | |
| Week 17 | Final Exam date TBD |