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

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

September 27  Graphs, trees and other Data Structures Chapter 4 Appendix B 

October 4  Sorting Chapter 5 
Assignment 1 due Assignment 2 given 
October 11  Divide and Conquer Chapter 8 

October 18  The Greedy method Chapter 7 
Assignment 2 due 
October 25  The Greedy method 

November 1  Midterm Dynamic Programming Chapter 9 
Assignment 3 given 
November 8  Backtracking and Branch and Bound Chapter 10 10 Thursday Remembrance Day. No classes 

November 15  Applications of Major Design Strategies 
Assignment 3 due 
November 22  String Matching and Document Processing Chapter 20 

November 29  NPComplete Problems Chapter 26 