Schedule
Lecture slides will be posted after class.
Most (non-exam) dates are tentative. The schedule will be updated as the semester progresses.
| WEEK | DAY | Lectures & Examples | Topic & Reading | Assignments |
| 1 | Jan 11 | Slides | Introduction to Algorithms, Proofs, Algorithm Analysis Problem: Stable Matching Kleinberg & Tardos: Preface, Chapters 1--2 Why Do We Do Proofs? - Check out the annotated slides. You can listen to the lecture as well. Shapley wins Nobel prize in Economics | Read, summarize on Wiki first two pages of Preface, Chapter 1.1, Chapter 2.1, 2.2 - Due Monday, January 18 at midnight Problem Set 1 - Due Friday, Jan 22 before 5 p.m. |
Jan 13 | Slides | |||
Jan 15 | Drop/Add ends Slides | |||
| 2 | Jan 18 | MLK Day - classes suspended Slides | Asymptotic Order of Growth Implementing Gale-Shapley Algorithm Survey of Common Running Times Kleinberg & Tardos: Chapter 2 | Wiki due Monday Problem Set 2 handed out |
Jan 20 | Slides | |||
Jan 22 | ||||
| 3 | Jan 25 | Slides | Priority queues and Heaps Graphs | Wiki due Monday at midnight Problem Set 2 due Friday Finish reading Chapter 2 Problem Set 3 handed out |
Jan 27 | Slides | |||
Jan 29 | Slides | |||
| 4 | Feb 01 | Slides | Graphs: Breadth-First Search, Depth-First Search, Bipartiteness, Directed Graphs | Wiki due Monday Problem Set 3 due Wednesday Midterm - handed out Wednesday |
Feb 03 | Slides | |||
Feb 05 | Slides | |||
| 5 | Feb 08 | Exam | ||
Feb 10 | Slides | Topological Ordering Greedy Algorithms: Intro | Wiki for two weeks due _next_ Monday (finishing Chapter 3 -- 3.3-3.6) Exam due Wednesday Exam 1 FAQ Problem Set 4 given out | |
Feb 12 | Mock Convention | |||
| 6 | Feb 15 | Class canceled | Greedy Algorithms: Interval scheduling, Minimizing max lateness, Shortest paths | Wiki for Chap 3.3-3.6 due Monday Problem Set 4 (FAQ) due Friday Problem Set 5 handed out |
Feb 17 | Slides | |||
Feb 19 | Slides | |||
Feb 22 | Washington Break | |||
Feb 24 | ||||
Feb 26 | ||||
| 7 | Feb 29 | Slides | Greedy Algorithms: | Wiki for Chapter 4 (specifically front matter, 4.1, 4.2, 4.4) due Monday Problem Set 5 due Friday Problem Set 6 handed out |
Mar 02 | Slides | |||
Mar 04 | Slides | |||
| 8 | Mar 07 | Slides | Greedy Algorithms: Huffman Codes Divide and Conquer Algorithms: Recurrence relations, Counting inversions K&T 5.1, 5.2, 5.3 | Wiki due Monday (Week 6 topics) Problem Set 6 due Friday Problem Set 7 handed out |
Mar 09 | Slides | |||
Mar 11 | Slides | |||
| 9 | Mar 14 | Slides | Divide and Conquer Algorithms: Counting Inversions, Closest pair of points, Integer multiplication, matrix multiplication Dynamic Programming: Memoization, Weighted Interval Scheduling | Wiki due Monday (4.8, 5.1, 5.2, 5.3) Problem Set 7 due, FAQ Exam 2 handed out |
Mar 16 | Slides | |||
Mar 18 | Slides | |||
| 10 | Mar 21 | Exam | ||
Mar 23 | Slides | Dynamic Programming: Weighted Interval Scheduling, Segmented Least Squares | Exam 2 FAQ No wiki Problem Set 8 handed out | |
Mar 25 | Slides | |||
| 11 | Mar 28 | Slides | Dynamic Programming: Knapsack, Sequence Alignment: Reducing Space, Shortest Path, Chapter 6 Network Flow: Maximum Flow, Minimum Cuts Ford-Fulkerson Algorithm Capacity Scaling K&T: Chapter 7 | Wiki Due Monday (6-6.3) Problem Set 8 due Problem Set 9 Handed out |
Mar 30 | Slides | |||
Apr 01 | Slides | |||
| 12 | Apr 04 | Slides | Network Flow Applications NP and Computational Intractability K & T: Chapter 7, 8 | Wiki Due Monday (7.1-7.2, 7.5, 7.7) Problem Set 9 due Python template file, Python3 template file, Java template file Data file and Expected Output files To extract the data/output files in a Linux terminal: tar xfz neruda.tgzFill out course evaluation form Final Exam handed out Read: Click-bait P vs NP news and The status of the P versus NP problem |
Apr 06 | Slides | |||
Apr 08 | Slides | |||
Apr 11 | Final Exam | |||
Apr 13 | ||||
Apr 15 | ||||