| Week | Date | Assignments | Handouts / Notes | Content | Readings |
| #1 | Jan 7 | Syllabus, 01-intro( pre, post ) |
Administrivia; Examples & Complexity | Chapters 1 & 2 | |
| Jan 9 |
02-StableMatch(
pre,
post
), 03-analysis( pre, post ) |
||||
| Jan 11 | 04-graphs, BFS( pre, post ) | ||||
| #2 | Jan 14 | Graph Algorithms | Ch. 3 | ||
| Jan 16 | 05-bipartite,DAG,DFS post | ||||
| Jan 18 | HW 1 due | ||||
| #3 | Jan 21 | Holiday (Martin Luther King Jr. Day) | |||
| Jan 23 | 06-greed | Greedy Algorithms | Ch 4 (omit 4.7, 4.9) | ||
| Jan 25 | |||||
| #4 | Jan 28 | HW 2 due | |||
| Jan 30 | 07-huffman( pre, post ) | ||||
| Feb 1 | |||||
| #5 | Feb 4 | HW 3 due | Divide & Conquer | Ch 5 (omit 5.6) | |
| Feb 6 | |||||
| Feb 8 | Midterm | ||||
| #6 | Feb 11 | 08-DivideConquer( pre, post ) | |||
| Feb 13 | |||||
| Feb 15 | |||||
| #7 | Feb 18 | Holiday (Presidents Day) | Dynamic Programming | Ch. 6 (Omit 6.7 - 6.10) | |
| Feb 20 | 09-DynamicProgramming( pre, post ) | ||||
| Feb 22 | HW 4 due | ||||
| #8 | Feb 25 | 10-RNA | |||
| Feb 27 | |||||
| Feb 29 | 11-DynProgExamples( pre, post ) | ||||
| #9 | Mar 3 | NP-Completeness & Intractability | Ch. 8 (omit 8.9,8.10) | ||
| Mar 5 | |||||
| Mar 7 | HW 5 due | ||||
| #10 | Mar 10 | 12-NP | |||
| Mar 12 | |||||
| Mar 14 | HW 6 due | final topic list, sample problems (NOT a sample final), final reference sheet (will be given with final exam) |
Final Review | ||
| Final | Tuesday March 18, 2:30-4:20 | Final | |||