Weekly Homework Assignments | 35% |
Take home Midterm and Final Examinations | 60% |
Class Participation | 5% |
Week of | Text chptr. | Description |
Sept. 29 | CLR1, RET1 | Introduction: abstract data types, complexity analysis, loop invariants. |
Oct. 6 | CLR18, RET2 | Amortized complexity, Disjoint sets: union/find, applications. |
Oct. 13 | CLR 20,21, RET 3 | Priority queues. |
Oct. 20 | CLR 14, RET 4 | Search trees: self-adjusting BST . |
Oct. 27 | RET 5 | Linking and cutting trees. |
Nov. 3 | RET 1-4 | Take home Midterm exam due |
Nov. 10 | RET 8 | Network flows. |
Nov. 17 | Layers of ADT implementations. | |
Nov. 24 | CLR VI, RET 6,7 | Minimum spanning trees. |
Dec. 1 | Optimal BST | |
Dec. 8 | comprehensive | Take home Final Exam due |