| Week 1 | ||
| 9/3 | Course Introduction | Syllabus out; HW1 Out |
Week 2 | ||
| 9/8 | Analysis Tools | Read: Chapters 1-3 |
| 9/10 | Recurrence Relations | Read: 4.1, 4.2 |
Week 3 | ||
| 9/15 | Elementary Data Structures | Read: 10-12 |
| 9/17 | Applications of Sorting | HW1 due; HW2 out; Read: 7 |
Week 4 | ||
| 9/22 | Quicksort | Read: 6,8 |
| 9/24 | Data Structures Workshop | |
Week 5 | ||
| 9/29 | Intro to Optimization Problems | Read: 16 |
| 10/1 | Using Dynamic Programming | Read: 15 ; HW2 due; HW3 out |
Week 6 | ||
| 10/6 | Knapsack Problems | |
| 10/8 | Optimization with Evolutionary Algorithms | |
Week 7 | ||
| 10/13 | Optimization Problems Workshop | Sample Exam I out |
| 10/15 | Review | HW3 due |
Week 8 | ||
| 10/20 | Exam I | |
| 10/22 | CANCELED! | |
Week 9 | ||
| 10/27 | Intro to Graph Algorithms | Read: 22 ; HW4 out ; Project out |
| 10/29 | Topology and Connectivity | |
Week 10 | ||
| 11/3 | Spanning Trees and Shortest Paths | Read: 23,24 |
| 11/5 | Graph Algorithm Workshop | |
Week 11 | ||
| 11/10 | Design Techniques | HW4 due ; Read: 17 |
| 11/12 | Inductive Thinking | Sample Exam II out |
Week 12 | ||
| 11/17 | Catch up/Review | |
| 11/19 | Exam II | |
Week 13 | ||
| 11/24 | P, NP, and NP-completeness | Project due ; HW 5 out; Read: 34 |
| 11/26 | No Class | Thanksgiving |
Week 14 | ||
| 12/1 | NP-completeness proofs | |
| 12/3 | Example Reductions | |
Week 15 | ||
| 12/8 | Intractability Workshop | |
| 12/10 | Review / Special Topics | HW 5 due; Sample Final out |
Week 16 | ||
| 12/17 | Final Exam (10am-noon) |