Schedule
Lecture slides will be posted after class.
Most dates are tentative. The schedule will be updated as the semester progresses...
| WEEK | DAY | Lectures & Examples | Topic & Reading | Assignments |
| 1 | Jan 11 | Our first class | Stable Matching, Proof By Contradiction, Efficiency Introduction to Algorithms, Basics of Algorithm Analysis Kleinberg & Tardos: Chapter 1--2 |
Read first two pages of Preface Problem Set 1 |
| Jan 13 | ||||
| Jan 15 | Drop/Add ends | |||
| 2 | Jan 18 | Asymptotic bounds on running time, Priority queues, Graphs Kleinberg & Tardos: Chapter 2--3 |
Problem Set 2 | |
| Jan 20 | ||||
| Jan 22 | ||||
| 3 | Jan 25 | Graphs Kleinberg & Tardos: Chapter 3 |
Problem Set 3 | |
| Jan 27 | ||||
| Jan 29 | ||||
| 4 | Feb 01 | Graphs Greedy Algorithms - interval scheduling, interval partitioning K & T: Chapter 3--4 |
Midterm | |
| Feb 03 | ||||
| Feb 05 | ||||
| 5 | Feb 08 | Greedy Algorithms, con'd: minimizing lateness Shortest path: Dijkstra's Algorithm K & T: Chapter 4 |
Problem Set 4 | |
| Feb 10 | ||||
| Feb 12 | ||||
| 6 | Feb 15 | Greedy Algorithms: Dijkstra's Algorithm, Minimum Spanning Tree, Union-Find Data Structure K & T: Chapter 4 |
Problem Set 5 | |
| Feb 17 | ||||
| Feb 19 | ||||
Feb 22 |
Washington Break |
|||
Feb 24 |
||||
Feb 26 |
||||
| 7 | Mar 01 | Clustering, Data Compression - Huffman Codes K & T: Chapter 4 |
Problem Set 6 | |
| Mar 03 | ||||
| Mar 05 | ||||
| 8 | Mar 08 | Divide and Conquer Algorithms: Counting inversions, Closest pair of points Recurrence relations K&T: Chapter 5.1-5.4 |
||
| Mar 10 | ||||
Mar 12 |
Midterm |
|||
| 9 | Mar 15 | Divide and Conquer Algorithms: Reasoning about recurrence relations Integer multiplication, Matrix Multiplication K & T: Chapter 5.5 Dynamic Programming: Memoization, Weighted Interval Scheduling, Segmented Least Squares K & T: Chapter 6 |
Problem Set 7 | |
| Mar 17 | ||||
| Mar 19 | ||||
| 10 | Mar 22 | Dynamic Programming: Segmented Least Squares, Knapsack, RNA Secondary Structure, Sequence Alignment K & T: Chapter 6 |
Problem Set 8 | |
| Mar 24 | ||||
| Mar 26 | ||||
| 11 | Mar 29 | Dynamic Programming: Shortest Paths K & T: Chapter 6 Network Flows: Maximum Flow, Minimum Cuts K & T: Chapter 7 |
Problem Set 9 | |
| Mar 31 | ||||
| Apr 02 | ||||
| 12 | Apr 05 | Network Flow, NP and Computational Intractability K & T: Chapter 7, 8 |
The status of the P versus NP problem | |
| Apr 07 | ||||
| Apr 09 | Last day of classes | |||
Apr 12 |
Final Exam |
|||
Apr 14 |
||||
Apr 16 |
||||