| Week of | Material Covered | Remarks |
| September 8 | Introduction and Preliminaries Chapter 1 - |
|
| September 13 | Mathematical tools for Algorithm Analysis Chapter 3 Appendix A |
|
| September 20 | Design and Analysis Fundamentals Chapter 2 |
|
| September 27 | Graphs, trees and other Data Structures Chapter 4 Appendix B |
|
| October 4 | Sorting Chapter 5 Divide and Conquer Chapter 8 |
|
| October 11 | Monday Thanksgiving day, no classes Mid semester break, no classes |
|
| October 18 | The Greedy method Chapter 7 |
|
| October 25 | The Greedy method |
|
| November 1 | Midterm Dynamic Programming Chapter 9 |
|
| November 8 | Backtracking and Branch and Bound Chapter 10 |
|
| November 15 | Applications of Major Design Strategies |
|
| November 22 | String Matching and Document Processing Chapter 20 |
|
| November 29 | NP-Complete Problems Chapter 26 |
|
| December 6 | Review |