Schedule

Date	Topic, Handouts	Assignments/Due dates
week 1	Introduction and course logistics   Stable Matching, (intro.pdf), (stable_matching.pdf)	Chapt 1, Homework 1 (due Jan 27), Solution
week 2	Analysis Tools (analysis.pdf)	Chapt 2
week 3	Heaps (.pdf), Graphs (.pdf)	Chapt 2,3 Homework 2 (due Feb 10), Solution
week 4	Greedy Alg (.pdf)	Chapt 4 Homework 3 (due Feb 24)
week 5	Minimum Weight Spanning Tree (.pdf) (.pdf) Prim's, Kruskal's examples	Chapt 4 Homework 4 (due March 2)
week 6,	Divide-Conquer, Merge-Sort, Counting Inversions (.pdf)	Chap 5
week 7,	Dynamic Programming (start) (.pdf)	Chap 6,
week 8,	March 21st Midterm review	practice midterm
week 9	Dynamic Prog., Weighted Intervals, Segmental LS (.pdf)	Chap 6, Problem Set 4
week 10	Knapsack, Sequence Alignment	Chap 6 Problem Set 5
week 11	Bellman Ford shortest path (.pdf)	Chap 6, Chap 7
week 12	Bellman Ford Cont, Max Flow (.pdf)	Chap 7
week 13	Max Flow Applications (.pdf) Intro to Intractability (.pdf)	Chap 8
week 14	Intractability, NP complete problems (.pdf) , poly-reductions (.pdf)	Chap 8
week 15	Local Search, Approx. Alg. (.pdf)
week
week	Local Search, Approx. Alg. (.pdf)
week 17	Final exam review (.pdf)