Design & Analysis of Algorithms for Spring 2011
Lecture 
Date 
Topics 
Overheads 
Handouts 

01 
Jan 11 
Ch. 1: Textbook syntax and Motivation (Fibonacci) 


02 
Jan 13 
Bigoh definition and usage 


03 
Jan 18 
Practice on worst, best, and averagecase complexity 


04 
Jan 20 
Ch 2: DivideandConquer 


05 
Jan 25 
Quick Sort 


06 
Jan 27 
Ch 3: Intro. To Dynamic Programming: coinchange problem 


07 
Feb 01 
Dynamic Programming: binomial coefficient example; Memoization 


08 
Feb 03 
Dynamic Programming: Floyd's Algorithm (Allpairs Shortest Path) and Optimal BST algorithm 


09 
Feb 08 
Dynamic Programming: Optimal BST algorithm and Traveling Salesperson Algorithm 


10 
Feb 10 
Dynamic Programming: TSP algorithm 


11 
Feb 15 
Continue TSP example 


12 
Feb 17 
Review for Test 1 


13 
Feb 22 
Test 1: 


14 
Feb 24 
Ch 4: Return Test and Greedy Algorithms: Prim's algorithm 


15 
Mar 01 
Greedy Algorithms: Prim's algorithm and Dijkstra's algorithm 


16 
Mar 03 
Greedy Algorithms: 01 Knapsack Problem 


17 
Mar 08 
Ch 5: Backtracking with Coinchange Problem 


18 
Mar 10 
Backtracking with sumofsubsets Problem 

Spring Break 

19 
Mar 22 
Backtracking 01 Knapsack Problem 

20 
Mar 24 
Backtracking 01 Knapsack Problem 


21 
Mar 29 
Ch 6: Bestfirst search with BranachandBound on the 01 Knapsack Problem 


22 
Mar 31 
Bestfirst search with BranachandBound on TSP 


23 
Apr 05 
Review for Test 2 


24 
Apr 07 
Test 2: 


25 
Apr 12 
Ch 7: Computational complexity of sorting using comparisons; Radix sort 


26 
Apr 14 
Ch 8: Computational complexity of searching using comparisons 


27 
Apr 19 
Ch 9: Intro. To the theory of P and NP 


28 
Apr 21 
Ch 9: NPcomplete, NPhard, Approximation algorithms 


29 
Apr 26 
Ch 9: Approximation algorithms 


30 
Apr 28 
Review for Final Exam 


Final Exam, Thursday (May 5) 34:50 PM in ITT 322 