Week Topics Reading Assignments Recitation Topics Notable Events Check back here weekly as we go along, ... Last updated on January 31, 2007 1. Jan 16, 18 Administrative aspects Asymtopic Notations and Analysis, Solving Recurrences, Master Theorem Chapters 1, 2, 3, Section 5.2 Thursday, Jan 18. - Homework 1 out 2. Jan 23, 25 Solving Recurrences, Master Theorem 3. Jan 30, Feb 01 Greedy Algorithms Featuring: Scheduling Problems, Shortest Paths, MST, ... Chapter 4, skip 4.7, 4.8, 4.9 Binary Heap, Priority Queue Thursday, Feb 01 - Homework 1 due - Homework 2 out 4. Feb 06, 08 Discuss solution to HW1, Q&A on HW2 5. Feb 13, 15 Divide and Conquer Featuring Merge Sort, Counting Inversions, FFT, ... Chapter 5 Discuss one more example of a greedy algorithm and its proof of correctness Thursday, Feb 15 - Homework 2 due - Homework 3 out: 6. Feb 20, 22 Discuss solution to HW2, Q&A on HW3 7. Feb 27, Mar 01 Dynamic Programming Featuring Scheduling, Segmented Least Squares, Subset Sums and Knapsacks, Sequence Alignment, Shortest Paths Chapter 6, skip 6.5, 6.10 Discuss one more example of divide and conquer Thursday, Mar 01 - Homework 3 due 8. Mar 06, 08 Discuss solution to HW3, Q&A before midterm exam. Thursday Mar 08 - Midterm exam 9. Mar 13, 15 Spring break! 10. Mar 20, 22 Network Flow Chapter 7, skip 7.4, 7.13 Discuss one more example of dynamic programming Tuesday Mar 20 - Homework 4 out 11. Mar 27, 29 Q&A on HW4 12. Apr 03, 05 NP-Completeness Chapter 8 Discuss one more example of network flows Thursday Apr 05 - Homework 4 due - Homework 5 out 13. Apr 10, 12 Discuss solution to HW4, Q&A on HW5 14. Apr 17, 19 Approximation Algorithms and Randomized Algorithms 11.1 to 11.4, and 11.8 12.1 to 12.3 13.1 to 13.5 Discuss one (or two) more example of NP-Completeness reductions 15. Apr 24, 26 Discuss one (or two) more examples of approximation algorithms Thursday Apr 26 - Homework 5 due 16. May 03-10 Final Exam: 7pm-10pm. Tuesday May 08. Knox 109 Home | Announcements | Assignments | Syllabus | Lecture Notes | Helpful Links