| WEEK | DATE | TOPIC | READING |
| 1 | 01/20 | Introduction | DPV: Chapter 0 |
| 01/22 | Introduction | DPV: Chapter 0 | |
| 2 | 01/27 | Algorithms with numbers | DPV: Chapter 1 |
| 01/29 | Algorithms with numbers | DPV: Chapter 1 | |
| 3 | 02/03 | Divide-and-conquer algorithms | DPV: Chapter 2 |
| 02/05 | Divide-and-conquer algorithms | DPV: Chapter 2 | |
| 4 | 02/10 | Divide-and-conquer algorithms | DPV: Chapter 2 |
| 02/12 | Self-balancing search trees (1) | KW: Chapter 11 | |
| 5 | 02/17 | Self-balancing search trees (2) | KW: Chapter 11 |
| 02/19 | Self-balancing search trees (3) | KW: Chapter 11 | |
| 6 | 02/24 | Graphs (1) | KW: Chapter 12 |
| 02/26 | Graphs (2) | KW: Chapter 12 | |
| 7 | 03/03 | Graphs (3) | KW: Chapter 12 |
| 03/05 | Graphs (4) | KW: Chapter 12 | |
| - | 03/09-13 | Spring Break | |
| 8 | 03/17 | Mid-term Exam | |
| 03/19 | Decompositions of graphs | DPV: Chapter 3 | |
| 9 | 03/24 | Decompositions of graphs | DPV: Chapter 3 |
| 03/26 | Paths in graphs | DPV: Chapter 4 | |
| 10 | 03/31 | Paths in graphs | DPV: Chapter 4 |
| 04/02 | Greedy algorithms | DPV: Chapter 5 | |
| 11 | 04/07 | no class (invited talk) | |
| 04/09 | Greedy algorithms | DPV: Chapter 5 | |
| 12 | 04/14 | Dynamic programming | DPV: Chapter 6 |
| 04/16 | Dynamic programming | DPV: Chapter 6 | |
| 13 | 04/21 | Linear programming and reductions | DPV: Chapter 7 |
| 04/23 | Linear programming and reductions | DPV: Chapter 7 | |
| 14 | 04/28 | NP-complete problems | DPV: Chapter 8-9 |
| 04/30 | NP-complete problems | DPV: Chapter 8-9 | |
| - | 05/12 | Final Examination (2:00 - 4:00 PM) |