Harry Hochheiser:
Home
| Week | Topic | Reading | Homework | |
|---|---|---|---|---|
| 1 | August 29 | Fundamentals and Background. Lec. 1, Lec. 2, | Chaps. 1-3, Apps. A | |
| 2 | Sep 5 | Recurrences, sorting. Lec. 3, Lec. 4 | Chaps. 4, 6-7 | Homework 1, Due Sep. 14 |
| 3 | Sep 12 | More Sorting: HeapSort,Quicksort | Chap. 6-8 | |
| 4 | Sep 19 | Greedy Algorithms, Dynamic Programming | Chap.16,15 | Homework 2, Due Sep. 28 |
| 5 | Sep 26 | Dynamic Programming, Still more Dynamic Programming" | Chap. 15 | |
| 6 | Oct.3 | Amortized Analysis, Binomial Heaps | Chaps. 17,19 | Homework 3, Due Oct. 12 |
| 7 | Oct.10 | Disjoint Sets and Graphs, More Graphs | Chap. 21,22,Appendix B.4 | |
| 8 | Oct.17 | Review Midterm: Oct.19 | ||
| 9 | Oct.24 | Graphs: Minimum Spanning Trees, Shortest Paths | Chaps. 23-25 | Homework 4, Due Oct. 31 |
| 10 | Oct.31 | Network Flow,Computational Geometry | Chap. 26 | Homework 5, Due Nov. 9 |
| 11 | Nov. 7 | Computational Geometry, Linear Programming | Chap. 33,29 | |
| 12 | Nov. 14 | NP-Completeness, More NP-Completeness | Chap. 34 | Homework 6, Due Nov. 28, Extra credit challenge |
| 13 | Nov. 21 | NP-Completeness, | Chap. 34 | |
| 14 | Nov. 27 | More NP-Completeness, Approximation Algorithms | Chap. 35 | Homework 7, Due Dec. 4 |
| 15 | Dec. 4 | More Approximation Algorithms,approximation wrap up | Chap. 32 |
The final exam will be held during regular class hours, on Tuesday December 12.
This schedule is approximate and subject to change.