# 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 |
Slides |
Topic & Reading |
Assignments |

## Week 1 | Jan 07 | Slides | Introduction to Algorithms, Proofs, Algorithm Analysis Guides to Proofs, including by induction Problem: Stable Matching Kleinberg & Tardos: Preface, Chapters 1--2 | Read, summarize on Wiki first two pages of Preface, Chapter 1.1, Chapter 2.1, 2.2 - Due Monday, January 14 at 11:59 p.m. Problem Set 1 - Due Friday, Jan 18 |

Jan 09 | Slides | |||

Jan 11 | Drop/Add ends Slides | |||

## Week 2 | Jan 14 | Slides | Asymptotic Order of Growth Implementing Gale-Shapley Algorithm Survey of Common Running Times Kleinberg & Tardos: Chapter 2 | Wiki due Monday Problem Set 1 due Friday before class Problem Set 2 handed out |

Jan 16 | Slides | |||

Jan 18 | Slides | |||

## Week 3 | Jan 21 | Martin Luther King Jr. Day | ||

Jan 23 | Slides | Priority queues and Heaps Graphs | Wiki due Monday at 11:59 p.m. (2.3, 2.4) Problem Set 2 due Friday Problem Set 3 handed out | |

Jan 25 | Slides | |||

## Week 4 | Jan 28 | Slides | Graphs: Breadth-First Search, Depth-First Search, Bipartiteness | Wiki due Monday (2.5, 3.1) Problem Set 3 due Friday Problem Set 4 handed out |

Jan 30 | Slides | |||

Feb 01 | Slides | |||

## Week 5 | Feb 04 | Slides | Directed Graphs Greedy Algorithms: Intro | Wiki due Tuesday (finishing Chapter 3 -- 3.2-3.6) Problem Set 4 due Friday Exam 1 handed out. |

Feb 06 | Slides | |||

Feb 08 | Slides | |||

## Week 6 | Feb 11 | Slides | Greedy Algorithms: Interval scheduling, Minimizing max lateness, Shortest paths How to write Greedy Stays Ahead Proofs and Greedy Exchange Proofs | Exam due Friday No Wiki Problem Set 5 given out |

Feb 13 | Exam 1 - Work period, due Friday at 5 p.m. | |||

Feb 15 | Slides | Greedy Algorithms: Interval scheduling, Minimizing max lateness, Shortest paths How to write Greedy Stays Ahead Proofs and Greedy Exchange Proofs (continued) | ||

## Week | Feb 18 | Washington Break | ||

Feb 20 | ||||

Feb 22 | ||||

## Week 7 | Feb 25 | Slides | Greedy Algorithms: | Wiki for Chapter 4 (specifically front matter, 4.1, 4.2, 4.4) due Monday Problem Set 5 (FAQ) due Friday Problem Set 6 handed out |

Feb 27 | Slides | |||

Mar 01 | Slides | |||

## Week 8 | Mar 04 | Slides | Greedy Algorithms: Data Compression - Huffman Codes Divide and Conquer Algorithms: Recurrence relations, Counting inversions K&T 5.1, 5.2, 5.3 | Wiki due Monday (4.5-4.7) |

Mar 06 | Slides | |||

Mar 08 | Slides | |||

## Week 9 | Mar 11 | 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 13 | Slides | |||

Mar 15 | Slides | |||

## Week 10 | Mar 18 | Exam 2 - Work period, due Friday at 5 p.m. | ||

Mar 20 | Slides | Dynamic Programming: Weighted Interval Scheduling, Segmented Least Squares | Exam 2 FAQ No wiki Problem Set 8 handed out | |

Mar 22 | Slides | |||

## Week 11 | Mar 25 | Slides | Dynamic Programming: Knapsack, Shortest Path, Chapter 6 Network Flow: Maximum Flow, Minimum Cuts Ford-Fulkerson Algorithm Capacity Scaling K&T: Chapter 7 | Wiki Due Monday (6-6.4) Problem Set 9 Handed out |

Mar 27 | Slides | |||

Mar 29 | Slides | |||

## Week 12 | Apr 01 | 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 Fill out course evaluation Final Exam handed out Read The status of the P versus NP problem. For a gentler intro to The math problem that could change the world: Does P = NP? |

Apr 03 | Slides | |||

Apr 05 | Slides | |||

## Week | Apr 08 | Final Exam | ||

Apr 10 | ||||

Apr 12 |