| Week of | Material Covered | Remarks |
| September 15 | Introduction and Preliminaries Chapter 1 Mathematical tools for Algorithm Analysis Chapter 2 Appendix A |
|
| September 22 | Design and Analysis Fundamentals Chapter 2 Appendix B |
|
| September 29 | Fundamental Data Structures: Graphs, trees and other Data Structures Chapter 1.4 |
|
| October 6 | Divide and Conquer Chapter 4 |
|
| October 13 | Decrease and Conquer Chapter 5 |
|
| October 20 | Transform and Conquer Chapter 6 |
|
| October 27 | Space and Time Tradeoffs Chapter 7 |
Midterm |
| November 3 | Sorting Algorithms |
|
| November 10 | The Greedy method Chapter 9 |
|
| November 17 | Dynamic Programming Chapter 8 |
|
| November 24 | Iterative Improvement Chapter 10. |
|
| December 1 | Limitations of Algorithm Power Chapter 11 and 12 Review |