Homework | |||||
---|---|---|---|---|---|
Date | Topic | Quizzes | Reading | Assign | Due |
Tu 02/01 | Introduction | 1.1-1.2 | HW1 | ||
Th 02/03 | Basics of Algorithm Analysis | 2.1-2.5 | |||
Tu 02/08 | Basic Graph Algorithms I | 3.1-3.4 | HW2 | HW1 | |
Th 02/10 | Basic Graph Algorithms II | 3.5-3.6 | |||
Tu 02/15 | Greedy Algorithms I | 4.1-4.2 | HW3 | HW2 | |
Th 02/17 | Greedy Algorithms II | 4.3 | |||
Tu 02/22 | Greedy Algorithms III | HW4 | HW3 | ||
Th 02/24 | Snow Day | ||||
Tu 03/01 | Shortest Paths | Quiz 1 | 4.4 | ||
Th 03/03 | Minimum Spanning Trees | 4.5-4.6 | HW5 | HW4 | |
Tu 03/08 | Divide & Conquer I | 5.1-5.3 | |||
Th 03/10 | Divide & Conquer II | 5.4 | HW6 | HW5 | |
Tu 03/15 | Dynamic Programming I | Quiz 2 | 6.1-6.2 | ||
Th 03/17 | Dynamic Programming II | 6.3-6.4 | HW6 | ||
Tu 03/22 | Spring Break | ||||
Th 03/24 | Spring Break | ||||
Tu 03/29 | Dynamic Programming III | 6.6-6.7 | HW7 | ||
Th 03/31 | Shortest Paths, again | Quiz 3 | 6.8-6.9 | ||
Tu 04/05 | Network Flow I | 7.1-7.3 | HW8 | HW7 | |
Th 04/07 | Network Flow II | 7.5 | |||
Tu 04/12 | Network Flow Applications I | 7.7-7.9 | HW9 | HW8 | |
Th 04/14 | Network Flow Applications II | Quiz 4 | 7.10, 7.12 | ||
Tu 04/19 | NP-Completeness I | 8.1-8.3 | HW10 | HW9 | |
Th 04/21 | NP-Completeness II | 8.4-8.6 | |||
Tu 04/26 | NP-Completeness III | 8.7-8.9 | HW11 | HW10 | |
Th 04/28 | Approximation Algorithms I | Quiz 5 | 11.1-11.2 | ||
Tu 05/03 | Approximation Algorithms II | 11.3 | HW12 | HW11 | |
Th 05/05 | Approximation Algorithms III | 11.8 | |||
Tu 05/10 | Randomized Algorithms I | 13.1-13.2 | HW13 | HW12 | |
Th 05/12 | Randomized Algorithms II | Quiz 6 | 13.3-13.4 | ||
Tu 05/17 | Randomized Algorithms III | 13.5 | HW13 | ||
Tu 05/24 | Final Exam 1:00pm - 3:00pm |