These are all tentative. We will try to cover as many topics as possible, and to follow this schedule as close as possible, but there is always a chance for some delays and changes.
| Class #, Date | Topic | Reading | Homework | |
| 1: 30 Jan 2008 | Introduction; 91.404 review | Review 91.404 reading | HW #1 (91.404 review) (due: 6 Feb 2008; submission code: 503_hw1) | |
| 2: 6 Feb 2008 | Dynamic Programming | Ch 15 | HW #2 (Dynamic Programming) (due: 13 Feb 2008; submission code: 503_hw2) | |
| 3: 13 Feb 2008 | Greedy algorithms | Ch 16 | ||
| 4: 20 Feb 2008 | Amortized Analysis | Ch 17 | HW #3 (Ch 16 -- Greedy Algorithms) (due: 27 Feb submission code: 503_hw3) | |
| 5: 27 Feb 2008 | Graph algorithms: Elementary graph algorithms, Minimum Spanning Trees, Shortest Paths, Flow Networks |
Ch 22-26 | HW #4 (Ch 17 -- Amortized Analysis) (due: 5 Mar 2008; submission code: 503_hw4) |
|
| 6: 5 Mar 2008 | Exam 1 (Hour +); | (covers everything so far plus 404 fundamentals) | ||
| 7: 12 Mar 2008 | Graph Algorithms (cont.) | |||
| 15-22 Mar 2008 | Spring Break. | |||
| 8: 26 Mar 2008 | Graph Algorithms (cont.) | HW #5 (Graph Algorithms) (due: 9 Apr 2008; submission code: 503_hw5) |
||
| 9: 2 Apr 2008 | Graph Algorithms (cont.) | |||
| 10: 9 Apr 2008 | NP-Completeness
|
Ch 34 | HW #6 (due: 16 Apr 2008; submission code: 503_hw6) | |
| 11: 16 Apr 2008 | Approximation algorithms | Ch 35 | HW #7 (due: 30 Apr 2008; submission code: 503_hw7) | |
| 23 Apr 2008 | Friday Schedule, no class. | |||
| 12: 30 Apr 2008 | Exam 2 (Hour +); | (covers everything since Exam 1) |
HW #8 (due: 8 May 2008; submission code: 503_hw8) | |
| 13: 7 May 2008 | "Special topics" (subset of linear programming, computational geometry, string matching, number-theoretic algorithms) | Ch 29, 31, 32, 33 | ||
| 14: 14 May 2008 (last) | "Special topics" (subset of linear programming, computational geometry, string matching, number-theoretic algorithms); Final Review |
|||
| Wednesday, 21 May 2008 (tentative), 6:00-9:00 p.m. | Final Exam | (covers everything) |