| Week of | Material Covered | Remarks |
| January 4 | Introduction and Preliminaries Chapter 1 - |
|
| January 9 | Mathematical tools for Algorithm Analysis Chapter 3 Appendix A |
|
| January 16 | Design and Analysis Fundamentals Chapter 2 |
|
| January 23 | Graphs, trees and other Data Structures Chapter 4 Appendix B |
|
| January 30 | Sorting Chapter 5 |
|
| February 5 | Divide and Conquer Chapter 8 . |
|
| February 12 | The Greedy method Chapter 7. |
|
| February 19 | Mid-semester break. No classes. | |
| February 26 | Dynamic Programming Chapter 9 |
|
| March 5 | Backtracking and Branch and Bound Chapter 10 |
|
| March 12 | Applications of Major Design Strategies |
|
| March 19 | String Matching and Document Processing Chapter 20 |
|
| March 26 | NP-Complete Problems Chapter 26 |
|
| April 3 | Review |