| Class | Topic | Homework | Exam |
|---|---|---|---|
| 1: Tue Aug 23 |
Introduction | ||
| 2: Thu Aug 25 |
Asymptotic Notation | ||
| 3: Tue Aug 30 |
Analyzing Iterative Algorithms | ||
| 4: Thu Sep 1 |
Graphs | HW #1 due over weekend | |
| 5: Tue Sep 6 |
Analyzing Recursive Algorithms (I) | ||
| 6: Thu Sep 8 |
Analyzing Recursive Algorithms (II) | HW #2 due over weekend | |
| 7: Tue Sep 13 |
The Correctness of Algorithms (I) | ||
| 8: Thu Sep 15 |
The Correctness of Algorithms (II) | HW #3 due over weekend | |
| 9: Tue Sep 20 |
Divide & Conquer Algorithms (I) | ||
| 10: Thu Sep 22 |
Divide & Conquer Algorithms (II) | HW #4 due over weekend | |
| 11: Tue Sep 27 |
Review and Catch Up | ||
| 12: Thu Sep 29 |
Exam #1 | ||
| 13: Tue Oct 4 |
Dynamic Programming (I) | ||
| 14: Thu Oct 6 |
Dynamic Programming (II) | HW #5 due over weekend | |
| 15: Tue Oct 11 |
Greedy Algorithms (I) | ||
| 16: Thu Oct 13 |
Greedy Algorithms (II) | HW #6 due over weekend | |
| 17: Tue Oct 18 |
Randomized Algorithms (I) | ||
| 18: Thu Oct 20 |
Randomized Algorithms (II) | HW #7 due over weekend | |
| 19: Tue Oct 25 |
Heaps | ||
| 20: Thu Oct 27 |
Depth-First Search | HW #8 due over weekend | |
| 21: Tue Nov 1 |
Review and Catch Up | ||
| 22: Thu Nov 3 |
Exam #2 | ||
| 23: Tue Nov 8 |
Hard Problems (I) | ||
| 24: Thu Nov 10 |
Hard Problems (II) | HW #9 due over weekend | |
| 25: Tue Nov 15 |
Approximation Algorithms | ||
| 26: Thu Nov 17 |
Perspectives on Sorting | HW #10 due over weekend | |
| 27: Tue Nov 29 |
Lower Bounds | ||
| 28: Thu Dec 1 |
Union-Find Structures | HW #11 due over weekend | |
| 29: Tue Dec 6 |
No class | ||
| 30: Thu Dec 8 |
Review and Catch Up | ||
| Thu Dec 15 |
Final Exam 2:00--3:50pm |