| Week of | Material Covered | Remarks |
| September 4 | Introduction and Preliminaries Chapter 1 - |
|
| September 9 | Mathematical tools for Algorithm Analysis Chapter 3 Appendix A |
|
| September 13 | Design and Analysis Fundamentals Chapter 2 |
|
| September 23 | Graphs, trees and other Data Structures Chapter 4 Appendix B |
|
| September 30 | Sorting Chapter 5 |
|
| October 7 | Divide and Conquer Chapter 8 |
|
| October 14 | 14 Monday Thanksgiving Day. No classes | |
| October 21 | The Greedy method Chapter 7 |
|
| October 28 | Dynamic Programming Chapter 9 |
|
| November 4 | Backtracking and Branch and Bound Chapter 10 |
|
| November 11 | 11 Monday Remembrance Day. No classes Applications of Major Design Strategies |
|
| November 18 | String Matching and Document Processing Chapter 20 |
|
| November 25 | NP-Complete Problems Chapter 26 |