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