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