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