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: Sep. 11, 2007 | Introduction; 91.404 review | Review 91.404 reading | HW #1 (91.404 review) (due: Sep. 18, 2007; submission code: 503_hw1) |
| 2: Sep. 18, 2007 | Dynamic Programming | Ch 15 | HW #2 (Dynamic Programming) (due: Sunday, Sep. 30, 2007; submission code: 503_hw2) |
| 3: Sep. 25, 2007 | Dynamic Programming Greedy algorithms |
Ch 15-16 | HW #3 (Ch 16) (due: Oct. 9, 2007; submission code: 503_hw3) |
| 4: Oct. 2, 2007 | Greedy algorithms | Ch 16 | |
| 5: Oct. 9, 2007 | Amortized Analysis | Ch 17 | HW #4 (Ch 17) (due: Oct. 21, 2007; submission code: 503_hw4) |
| 6: Oct. 16, 2007 | Exam 1 (Hour +); | 91.404 reading; Ch 15-17; Ch 24-26 |
|
| 7: Oct. 23, 2007 | Amortized Analysis | Ch 17 | HW #5 (Ch 34) (due: Nov. 6, 2007; submission code: 503_hw5) |
| 8: Oct. 30, 2007 | Graph Algorithms: Shortest Paths, Flow Networks | Ch 22-26 | |
| 9: Nov. 6, 2007 | Graph Algorithms: Shortest Paths, Flow Networks | Ch 22-26 | HW #6 (Ch 35, 33) (due: Nov. 27, 2007; submission code: 503_hw6) |
| 10: Nov. 13, 2007 | Graph Algorithms: Shortest Paths, Flow Networks | Ch 22-26 | |
| 11: Nov. 20, 2007 | Linear Programming | Ch 29 | HW #7 (Ch 29, 31) (due: Dec. 4, 2007; submission code: 503_hw7) |
| 12: Nov. 27, 2007 | Exam 2 (Hour +); NP-Completeness |
91.404 reading;
Ch 15-17, 24-26, 29, 33-35; Ch 31 |
HW #8 (Ch 32) (due: Dec. 11, 2007; submission code: 503_hw8) |
| 13: Dec. 4, 2007 | NP-Completeness Number-Theoretic Algorithms: Cryptography |
Ch 34, 31 |
|
| 14: Dec. 11, 2007 (last) | String Matching, Final Review | Ch 32 | |
| Tuesday, December 18, 2007, 6:00-9:00 p.m. | Final Exam | 91.404 reading;
Ch 15-17, 24-26, 29, 31-35 |