Week 
Dates 
Topic 
Slides 
Notes 
HW 
01 
Aug. 19 
Introduction and administrivia 



Aug. 21 
Basics of Algorithm Analysis 



02 
Aug. 26 
Invariants, Correctness Proofs 



Aug. 28 
Asymptotic Notation 



03 
Sep. 02 
Greedy Strategy 



Sep. 04 
Activity Scheduling Problem 



04 
Sep. 09 
MST, Prim's and Kruskal's Algorithms 


05 
Sep. 16 
SingleSource Shortest Paths Problem 


UnionFind Refresher 



Sep. 18 
Dijkstra's Algorithm, Huffman Codes 



06 
Sep. 23 
Divide and Conquer: Introduction 


Sep. 25 
Recurrences, Merge Sort Analysis 


07 
Sep. 30 
Master's Theorem, Strassen's Algorithm 


Oct. 02 
Dynamic Programming: Coinrow, changemaking, coincollection 



08 
Oct. 07 
Matrixchain Multiplication 


Oct. 09 
Knapsack Problem 


09 
Oct. 14 
Graphs: DFS, BFS Properties and Structure 



Oct. 16 
mid term exam 
10 
Oct. 21 
Mid Term Review 
Oct. 23 
DAG, Topological Sorting 



11 
Oct. 28 
Strongly Connected Components, AllPairs Shortest Path Problem 



Oct. 30 



12 
Nov. 04 
Network Flow: MaxFlow MinCut Problem 



Nov. 06 


13 
Nov. 11 
Computational Complexity and Intractability 



Nov. 13 
Halting Problem, Hamiltonian Circuit, Class P 


14 
Nov. 18 
Backtracking: nqueen, TSP, subsetsum 


Nov. 20 
BranchandBound: Assignment, Knapsack, TSP 


15 
Nov. 25 
Thanksgiving Break 
Nov. 27 
16 
Dec. 02 
Branch and Bound (ctd..) 



Dec. 05 


17 
Dec. 10 
Finals Exam @12.00 pm  01.40 pm in EB 0140 