| Week of | Material Covered | Remarks |
| September 1 | Introduction and Preliminaries Chapter 1 - |
|
| September 8 | Mathematical tools for Algorithm Analysis Chapter 3 Appendix A |
|
| September 15 | Design and Analysis Fundamentals Chapter 2 |
|
| September 22 | Graphs, trees and other Data Structures Chapter 4 Appendix B |
|
| September 29 | Sorting Chapter 5 |
|
| October 6 | Divide and Conquer Chapter 8 |
|
| October 13 | The Greedy method Chapter 7 |
|
| October 20 | Midterm |
|
| October 27 | Dynamic Programming Chapter 9 |
|
| November 3 | Backtracking and Branch and Bound Chapter 10 |
|
| November 10 | 11 Tuesday Remembrance Day. No classes Applications of Major Design Strategies |
|
| November 17 | String Matching and Document Processing Chapter 20 |
|
| November 24 | NP-Complete Problems Chapter 26 |