Following schedule is tentative. Dates and materials to be covered will be kept updated regularly as the quarter proceeds.
| # | Date | Subject | Readings | Assignments |
| 1 | 1/8 | Propositional Logic, Quantifiers | [ch. 1.1, 1.2, 1.3] | Homework #1 given |
| 2 | 1/15 | Quantifiers, Mathematical Induction | [ch. 1.3, 1.6] | Homework #2 given |
| 3 | 1/22 | Induction, Algorithms | [ch. 1.6, 3.1, 3.2] | Homework #3 given |
| 4 | 1/29 | Euclidean Algo, Recursive Algo | [ch. 3.3, 3.4] | Homework #4 given |
| 5 | 2/5 | Midterm exam, Complexity of Algorithms |
||
| 6 | 2/12 | Complexity of Algorithms | [ch. 3.5] | Homework #5 given |
| 7 | 2/19 | Recurrence Relations | [ch. 5.1, 5.2] | Homework #6 given |
| 8 | 2/26 | Analysis of Recursive Algo, Graphs | [ch. 5.3, 6.1] | Homework #7 given |
| 9 | 3/5 | Paths, Cycles, Graph Algorithms | [ch. 6.2, 6.3, 6.4] | Homework #8 given |
| 10 | 3/12 | more on Graph Algorithms, Review | Homework #9 given | |
| 11 | 3/19 | Final exam |