| WEEK | DATE | TOPIC | READING, REMARKS |
|---|---|---|---|
| 1 | Sep 12 | Introduction: Representative problems | Chap. 1 |
| 2 | Sep 19 | Algorithmic Analysis | Chap. 2 |
| 3 | Sep 26 | Graphs | Chap. 3 |
| 4 | Oct 3; Quiz 1 (Oct 3) | Graphs (contd) | Chap. 3 |
| 5 | Oct 10 | Greedy Algorithms | Chap. 4; Oct 10 (Columbus day); Midterm (Oct 12) |
| 6 | Oct 17 | Greedy Algorithms (contd) | Chap. 4 |
| 7 | Oct 24 | Divide and Conquer | Chap 5 |
| 8 | Oct 31 | Divide and Conquer(contd) | Chap 5 |
| 9 | Nov 7 | Dynamic Programming | Chap. 6 |
| 10 | Nov 14 | Dynamic Programming (contd) | Chap. 6 |
| 11 | Nov 21 | NP Completeness | Chap. 8; Thanksgiving (Nov 24) |
| 12 | Nov 28 | NP Completeness (contd) | Chap. 8; Quiz 2 (Nov 28) |
| 13 | Dec 5 | Randomized Algorithms | Chap. 13 |
| 14 | Dec 12 | Randomized Algorithms (contd) | Chap. 13; Last class (Dec 14) |
| 15 | Dec 19 | Final Exam |