| Lecture | Section |
| January 6 | 1.1 - Basic Counting |
| January 8 | 1.2 - Counting Lists, Permutations, and Subsets |
| January 9 | 1.3 - Binomial Coefficients |
| January 10 | 1.4 - Equivalence Relations and Counting |
| January 13 | 2.1 - Cryptography and Modular Arithmetic |
| January 15 | 2.2 - Inverses and GCDs |
| January 17 | 2.3 - The RSA Cryptosystem |
| January 20 | MLK - Holiday- No class |
| January 22 | 2.4 - Details of the RSA Cryptosystem |
| January 24 | 2.4 - More on the RSA |
| January 27 | 3.1- Equivalence and Implication |
| January 29 | 3.2 - Variables and Quantifiers |
| January 31 | 3.3 - Inference |
| February 3 | 4.1 - Mathematical Induction |
| February 5 | 4.2 - Recursion, Recurrences and Induction |
| February 6 | 4.3 - Rooted Trees |
| February 7 | Winter Carnival - No Classes |
| February 10 | 4.4 - Growth Rates of Solutions to Recurrences |
| February 12 | 4.5 - The Master Theorem |
| February 14 | 4.6 - More General Types of Recurrences |
| February 17 | 4.7 - Recurrences and Selection |
| February 19 | 5.1 - Intro to Probability |
| February 21 | 5.2 - Unions and Intersections |
| February 24 | 5.3 - Conditional Probability and Independence |
| February 26 | 5.4 - Random Variables |
| February 28 | 5.5 - Probability calculations in Hashing |
| March 3 | 5.6 - Conditional Expectations, Recurrences and Algorithms |
| March 5 | 5.7 - Probability distributions and Variance |
| March 7 | REVIEW |