| Class Time | TTh 4:30-5:50 | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Room | BSB 335 | ||||||||
| Course Info | Course Information | ||||||||
| Texts | Algorithm Design by Kleinberg and Tardos, Addison Wesley Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, McGraw Hill Algorithms by Dasgupta, Papadimitriou, Vazirani, McGraw Hill |
||||||||
| Instructor |
|
| Lec | Date | Topics | Reading | Homework | |
|---|---|---|---|---|---|
| 1. | Tue, Sep 01 | Stable Matching | K(1.1) | ||
| 2. | Thu, Sep 03 | Stable Matching, BFS, Testing Bipartiteness | K(1.1, 3.1-3.4) | ||
| 3. | Tue, Sep 08 | No class (Monday schedule) | |||
| 4. | Thu, Sep 10 | DFS, Topological Sort, Strongly Connected Components | CLRS(22.3-22.5) | Hw 1 | |
| 5. | Tue, Sep 15 | Strongly Connected Components | CLRS(22.3-22.5) | ||
| 6. | Thu, Sep 17 | Greedy Algorithms | K(4.1, 4.2) | ||
| 7. | Tue, Sep 22 | No class due to sickness | |||
| 8. | Thu, Sep 24 | Greedy Algorithms | K(4.3) | ||
| 9. | Tue, Sep 29 | Shortest paths, MST | K(4.4, 4.5) | ||
| 10. | Thu, Oct 01 | Divide and Conquer | K(Chp. 5) | Hw 2 | |
| 11. | Tue, Oct 06 | Dynamic Programming | K(6.1, 6.2) | ||
| 12. | Thu, Oct 08 | Dynamic Programming | K(6.4), CLRS(15.2) | ||
| 13. | Tue, Oct 13 | Dynamic Programming | CLRS (15.2, 15.4) | ||
| 14. | Thu, Oct 15 | Dynamic Programming | DPV (6.3) | ||
| 15. | Tue, Oct 20 | Bellman-Ford algorithm | KT (6.8) | Hw 3 | |
| 16. | Thu, Oct 22 | Floyd-Warshall algorithm, Network Flows | CLRS (25.2), KT (7.1) | ||
| 17. | Tue, Oct 27 | Network Flows | KT (7.2) | ||
| 18. | Thu, Oct 29 | Network Flows | KT (7.3) | ||
| 19. | Tue, Nov 03 | Network Flows -- Applications | KT (7.5) | ||
| 20. | Thu, Nov 05 | No class due to sickness | |||
| 21. | Tue, Nov 10 | Network Flows -- Applications | KT (7.6) | ||
| 22. | Thu, Nov 12 | Network Flows -- Applications | KT (7.10) | Hw 4 | |
| 23. | Tue, Nov 17 | NP-Completeness | K(Chp 8), CLRS(Chp 34) | ||
| 24. | Thu, Nov 19 | NP-Completeness | K(Chp 8), CLRS(Chp 34) |