Homework assignments are to be submitted via Moodle before class on the day on which they are listed. Projects are due by 11 PM via Moodle on the day on which they are listed. Note that all page numbers and problems listed are specific to the hardcopy version of the book with the ISBN number as listed in the syllabus.
Date | Class Period & Lecture Topic | Reading | Assignment |
---|---|---|---|
Jan 14 | 1. Syllabus, policies, business, goals, intro | ||
Jan 16 | 2. Big-O and basic arithmetic | pp. 1-15 | Install Python and PyQt5 and start playing around |
Jan 21 | 3. Modular arithmetic and Primality | pp. 16-30 | HW1 |
Jan 23 | 4. Cryptography and Euclid | pp. 30-38 Cracking RSA (optional) |
HW2 P1 Design Experience |
Jan 28 | 5. Multiplication, Recurrence Relations, Merge Sort | pp. 45-50 | HW3 P1: Primality Tester |
Jan 30 | 6. Medians, Matrix Multiplication, Convex Hull | pp. 50-57 | HW4 Service Learning Proposal |
Feb 4 | 7. Depth-first Search | pp. 80-87 | HW5 P2 Design Experience |
Feb 6 | 8. Directed Graphs and Strong Connectedness | pp. 87-95 | HW6 |
Feb 11 | 9. Shortest Paths | pp. 104-113 | HW7 |
Feb 13 | 10. Priority Queues and Variations on Shortest Path | pp. 113-120 | HW8 P2: Convex Hull |
Feb 18 | 11. Minimum Spanning Trees | pp. 127-138 | HW9 |
Feb 20 | 12. Huffman Encoding | pp. 138-143 | HW10 P3 Design Experience |
Feb 25 | 13. Horn Formulas and Set Cover | pp. 144-147 | HW11 |
Feb 27 | Midterm | Study Guide | |
Mar 3 | 14. Longest Increasing Subsequence and Edit Distance | pp. 156-164 | HW12 |
Mar 5 | 15. Knapsack and Chain Matrix Multiplication | pp. 164-171 | HW13 P3: Network Routing (due Mar 6) |
Mar 10 | 16. Shortest Paths and Independent Sets | pp. 171-177 | HW14 P4 Design Experience |
Mar 12 | Midterm Review and Catchup-Day | HW15 | |
Mar 17 | Spring Break | ||
Mar 19 | Spring Break | ||
Mar 24 | Spring Break | ||
Mar 26 | Spring Break | ||
Mar 31 | 17. Introduction to Linear Programming | pp. 188-198 | P4: Gene Sequencing |
Apr 2 | 18. Duality and Zero-sum Games | pp. 206-213 | HW16 |
Apr 7 | 19. Backtracking and Branch & Bound | pp. 271-276 + extra B&B TSP material |
HW17 |
Apr 9 | 20. More Branch & Bound | pp. 271-276 + extra B&B TSP material |
P5 Design Experience (due Apr 10) |
Apr 14 | 21. NP-completeness | pp. 232-247 + "Unsolvable Problems" (p. 263) |
HW19 |
Apr 16 | 22. Approximation and Local Search | pp. 276-293 | P5: TSP with Branch and Bound (due Apr 17) |
Apr 21 | 23. Randomized Algorithms & Grad School | Section 2.4; Boxes on pp. 29, 56, 140 |
HW21 |
Apr 23 | 24. Quantum Computation | pp. 297-302 | |
Apr 28 | 25. Final Exam Review | Study Guide | |
Apr 30 | 26. Group Project Presentations | P6: Group TSP Service Learning Report |
|
May 7 | Final (Thurs, May 7, 7:30-9:30 AM) | Study Guide |
The schedule is subject to change. The final is Thursday, May 7, 7:30-9:30 AM in our normal classroom.