Week of  Material Covered  Remarks 
September 8  Introduction and Preliminaries Chapter 1  

September 15  Mathematical tools for Algorithm Analysis Chapter 3 Appendix A 
Assignment 1 Given 
September 22  Design and Analysis Fundamentals Chapter 2 

September 29  Graphs, trees and other Data Structures Chapter 4 Appendix B 
Assignment 1 due Assignment 2 given 
October 6  Sorting Chapter 5 

October 13  Divide and Conquer Chapter 8 
Assignment 2 due Assignment 3 given 
October 20  The Greedy method Chapter 7 

October 27  The Greedy method 
Assignment 3 due 
November 3  Midterm Dynamic Programming Chapter 9 
Assignment 4 given 
November 10  Backtracking and Branch and Bound Chapter 10 

November 17  12 Thursday Remembrance Day. No classes Applications of Major Design Strategies 

November 24  String Matching and Document Processing Chapter 20 
Assignment 4 due 
NPComplete Problems Chapter 26 