Required Textbook: Jon Kleinberg and Eva Tardos: Algorithm Design
1st edition Table of Contents page 1 page 2 page 3 page 4 page 5

Schedule

Date	Topic, Handouts	Assignments/Due dates
week 1	Introduction and course logistics, Stable Matching, (intro.pdf), (stable_matching.pdf)	Chapt 1, Read sample problems, practice problems (1,2,4)
week 2	Analysis Tools (analysis.pdf) (extra slides)	Chapt 2, hw1 out (due 09/08), quiz1 (on 09/03)
week 3	Heaps (.pdf), Graphs (.pdf), BFS-DFS examples (.pdf)	Read Chapt 3, Practice problems 2,4,7,12
week 4	Greedy Alg (.pdf), Dijkstra's example	Read Chapt 4, (except 4.3, 4.7, 4.9)
week 5	Minimum Weight Spanning Tree (.pdf), Prim's, Kruskal's examples	Chapt 4 practice problems 3,4,13,14
week 6	Divide-Conquer, Merge-Sort, Counting Inversions (.pdf)	Read Chap 5
week 7	Dynamic Programming (start), Weighted Scheduling (.pdf)	Chap 6
week 8	Dynamic Programming, Knapsack, Shortest Path (.pdf) , LCS Example	Chap 6 read solved exercises & problems 1,2,3,4,6
week 9	Midterm Exam review midterm practice
week 10	Dynamic Programming Cont, RNA secondary structure, Sequence Alignment
week 11	Bellman Ford Cont, Max Flow (.pdf) , max flow demo   Bellman-Ford demo (.pdf)	Chap 7
week 12	Max Flow Applications (.pdf) Intro to Intractability (.pdf)	Chapter 7
week 13	Intractability, (.pdf) , NP complete problems (.pdf) ,	Chap 8
week 14	Poly-reductions (.pdf) Local Search, Approx. Alg. (.pdf) , Load balancing example (.pdf)	Chapter 8, 10; Chap 8
week 15	Local Search, Approx. Alg. cont, practice final (.pdf)
	Exam in class according to GMU schedule. Final review (.pdf)