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