| Date | Lecture Topic | Reading | Homework Due | Assigned |
|---|---|---|---|---|
| Thur, Aug 29 | Introduction via a scheduling problem | Homework 0 | ||
| Tue, Sept 3 | Greedy Algorithms | 16.1-16.2 | ||
| Thur, Sept 5 | Greedy Algorithms (cont) | 16.3 | Homework 1 | |
| Tue, Sept 10 | Greedy Algorithms (cont) | 16.5 | ||
| Thur, Sept 12 | Dynamic Programming | 15.1-15.2 | ||
| Tue, Sept 17 | Dynamic Programming (cont) | 15.3 | ||
| Thur, Sept 19 | Dynamic Programming (cont) | 15.4-15.5 | Homework 1 | Homework 2 | Tue, Sept 24 | More Dynamic Programming Examples | Thur, Sept 26 | Linear Programming | 29.1-29.2 |
| Tue, Oct 1 | NP-completeness | 34.1-34.3 | ||
| Thur, Oct 3 | NP-completeness | 34.4 | Homework 2 | |
| Tue, Oct 8 | NP-completeness reductions | 34.5 | ||
| Thur, Oct 10 | EXAM 1 | Homework 3 | ||
| Tue, Oct 15 | More NP-completeness reductions | |||
| Thur, Oct 17 | Approximation Algorithms | 35.1-35.2 | ||
| Tue, Oct 22 | Approximation Algorithms (cont) | 35.3 | ||
| Thur, Oct 24 | Approximation Algorithms (cont) | 35.4 | Homework 3 | Homework 4 |
| Tue, Oct 29 | Approximation Algorithms (cont) | 35.5 | ||
| Thur, Oct 31 | Finding exact complexity of a problem | 9.1 | ||
| Tue, Nov 5 | Lower Bound Techniques | Handout | ||
| Thur, Nov 7 | Lower Bound Techniques (cont) | Homework 4 | ||
| Tue, Nov 12 | Lower Bound Techniques (cont) | |||
| Thur, Nov 14 | EXAM 2 | Homework 5 | ||
| Tue, Nov 19 | On-line Algorithms and Competitive Analysis | Handout | ||
| Thur, Nov 21 | On-line Algorithms and Competitive Analysis (cont) | |||
| Tue, Nov 26 | On-line Algorithms and Competitive Analysis (cont) | |||
| Thur, Nov 28 | No Class -- Thanksgiving Break | |||
| Tue, Dec 3 | Student Selected Topic | |||
| Thur, Dec 5 | Student Selected Topic | Homework 5 | ||
| Tue, Dec 10 | Review | |||
| Wed, Dec 18 | Final Exam 3:30pm-5:30pm in Lopata 101 |
Readings are from Cormen, Leiserson, Rivest and Stein (2nd Edition).