(subject to change; revised 25-Nov-2014)
| Week # | Monday | Wednesday | Friday |
|---|---|---|---|
| 1 | September 22: no class yet | September 24: Introduction [reading, pptx, pdf] | September 26: A Little Python [reading, pptx, pdf] |
| 2 | September 29: Proof by Induction [reading, pptx, pdf , pptx, pdf] Powers of Ten (a thought-provoking movie by Charles and Ray Eames) | October 1: Math Review: Algorithm Analysis [reading, pptx, pdf] | October 3: Asymptotic Analysis [reading, pptx, pdf] |
| 3 | October 6: Asymptotic Analysis (cont); Dictionaries and Binary Trees [reading, pptx, pdf] | October 8: Binary Search Trees [reading, pptx, pdf] {A1 due} | October 10: AVL Trees [reading, pptx, pdf] |
| 4 | October 13: Hashing [reading, pptx, pdf] | October 15: Hashing II [reading, pptx, pdf] | October 17: Disjoint Sets and UNION-FIND [reading, pptx, pdf] {A2 due} |
| 5 | October 20: Implementing UNION-FIND [reading, pptx, pdf] | October 22: Priority Queues [reading, pptx, pdf] {A3 Part I due} | October 24: Binary Heaps [reading, pptx, pdf] |
| 6 | October 27: Applying Hashing and UNION-FIND | October 29: Graphs [reading, pptx, pdf] {A3 Part II due} | October 31: Minimum Spanning Trees with Kruskal's Algorithm [reading, pptx, pdf] |
| 7 | November 3: Review {A4 Part I due} | November 5: Midterm exam | November 7: Topological Sorting; Graph Traversal [reading, pptx, pdf] |
| 8 | November 10: Shortest Paths: Dijkstra's Algorithm [reading, pptx, pdf] {A4 Part II due} | November 12: Implicit Graphs: Generating Vertices & Edges [reading, pptx, pdf] Review | November 14: Comparison Sorting [reading, pptx, pdf] |
| 9 | November 17: More Sorting [reading, pptx, pdf] {A4 Part III due} | November 19: Beyond Comparison Sorting [reading, pptx, pdf] | November 21: Sorting wrap-up |
| 10 | November 24: Algorithm Design Paradigms [reading, pptx, pdf] | November 26: Divide-and-Conquer and the FFT [reading, pptx, pdf]{A5 due} | November 28: Thanksgiving break (no class) |
| 11 | December 1: P vs NP and NP-Completeness [reading, pptx, pdf] | December 3: Algorithms and Problem Solving [reading] {A6 due} | December 5: Review |
| December 9: (Tuesday) FINAL EXAMINATION 2:30 PM - 4:20 | |||