Weekly Homework Assignments | 35% |
Midterm and Final Examinations | 60% |
Class Participation | 5% |
Week of | Chptr. | Description | Comments |
Jan. 5 | 1-3 | Introduction: algorithms and data structures, complexity analysis, loop invariants. | |
Jan. 12 | X | Amortized complexity, Disjoint sets: union/find, applications. | |
Jan. 19 | 4-6 | Algorithm design strategies | class on Jan. 23 |
Jan. 26 | 3 | Elementary graph algorithms: traversals | |
Feb. 2 | 4 | Greedy algorithms | |
Feb. 9 | 5 | Divide-and-Conquer Dynamic Programming | |
Feb. 16 | 6 | Take home Midterm exam due Feb. 22 | |
Feb. 23 | 8 | P vs. NP | |
Mar. 1 | 8 | NP-completeness proofs | |
Mar. 9 | 11 | Approximation algorithms | |
Mar. 18 | all the above | Take home Final Exam due at 10:15 |