| Week of | Material Covered | Remarks |
| September 6 | NO Class Individual study |
|
| September 11 | Introduction and Preliminaries Chapter 1 - |
|
| September 18 | Mathematical tools for Algorithm Analysis Chapter 2 Appendix A |
|
| September 25 | Design and Analysis Fundamentals Chapter 2 Appendix B |
|
| October 2 | Fundamental Data Structures: Graphs, trees and other Data Structures Chapter 1.4 |
|
| October 9 | Divide and Conquer Chapter 4 |
|
| October 16 | Decrease and Conquer Chapter 5 |
|
| October 23 | Transform and Conquer Chapter 6 |
Midterm |
| October 30 | Space and Time Tradeoffs Chapter 7 |
|
| October 30 | Sorting Algorithms |
|
| November 6 | The Greedy method Chapter 9. |
|
| November 13 | Dynamic Programming Chapter 8 |
|
| November 20 | Iterative Improvement Chapter 10 |
|
| Noovember 27 | Limitations of Algorithm Power Chapter 11 and 12 Review |