CS 3000: Algorithms & Data

Syllabus | Schedule

Course Schedule

Date Topic Homework Assigned Homework Due Reading Assigned Slides Before Slides After
5/4/2020 Welcome and Introduction Erickson Introduction - 1.1; CLR 1-2 pdf pdf
5/5/2020 Divide And Conquer HW1 (tex, pdf) Erickson Finish Chapter 1; CLR 1—2 pdf pdf
5/6/2020 Asymptotic Analysis Erickson Finish Chapter 1; CLR 1-2 pdf pdf
5/7/2020 Recurrence Relations pdf pdf
5/11 More Recursion HW1 (midnight) Erickson Chapter 2 pdf pdf
5/12 Backtracking HW2 (tex (updated 5/15), pdf (updated 5/15)) Erickson Chapter 3 pdf pdf
5/13 Dynamic Programming pdf pdf
5/14 More dynamic programming pdf pdf
5/18 Even More dynamic programming pdf pdf
5/19 Finishing Dynamic Programming; Intro to Graph Algorithms HW2 (midnight) pdf pdf
5/20 Midterm 1 Q&A Midterm 1 (8PM) pdf pdf
5/21 No Class – Take Home Midterm 1
5/22 Midterm 1 due 8PM Boston Time
5/25 No Class – Memorial Day
5/26 Graph algorithms HW3 (tex, pdf) Erickson through Chapter 8.5 pdf pdf
5/27 Graph algorithms Erickson through Chapter 8.5 pdf pdf
5/28 Graph algorithms (sub)HW4 (tex, pdf) Erickson Chapter 7 and Chapter 10 through 10.3 pdf pdf
6/1 No Class
6/2 Finish graph algorithms, start network flow 3 and 4 Erickson finish Chapter 10 pptx
6/3 Network flow HW5 (tex, pdf) Reduction pdf pdf
6/4 Network flow Erickson Chapter 4 through 4.4 pdf pdf
6/8 No Class EC1 (tex, pdf) Erickson Chapter 4 through 4.4
6/9 Greedy Algorithms and Midterm 2 Review HW5 (midnight) pdf pdf
6/10 No Class
6/15 Greedy Algorithms EC2 (tex, pdf) Tardos and Kleinberg Chapter 4.7 (pg 158); Greedy Proofs Handout pdf pdf
6/16 Clustering Erickson Chapter 12 (as much as desired) pdf pdf
6/17 Communities, Complexity, and Course Wrap pdf pdf
6/18 Final Exam Review pdf pdf