| General Information | Schedule | Homework |
| Schedule |
|---|
| Class Number | Date | Reading | Brief Description |
|---|---|---|---|
| 1 | Wednesday, 1/21 | - | Introduction, Scheme Review, Exponentiation |
| 2 | Friday, 1/23 | - | Exponentiation, Modular Arithmetic, Tail Recursion |
| 3 | Monday, 1/26 | - | Fast Exponentiation, Understanding Runtime |
| 4 | Wednesday, 1/28 | LLM 1.1 - 1.4 Notes |
Mathematical Statements, Quantifiers |
| 5 | Friday, 1/30 | LLM 1.5 - 1.9 Notes |
Evens and Odds, Proof Techniques, Sets |
| 6 | Monday, 2/2 | LLM 4.1 - 4.2 | Sets, Implementing Sets in Scheme |
| 7 | Wednesday, 2/4 | LLM 4.1 - 4.2 | Thinking Recursively, Implementing Sets in Scheme |
| 8 | Friday, 2/6 | LLM 4.3 Notes |
Functions, Injections and Surjections |
| 9 | Monday, 2/9 | LLM 6.1 Notes |
Injections and Surjections, Mathematical Induction |
| 10 | Wednesday, 2/11 | LLM 6.1 | Mathematical Induction |
| 11 | Friday, 2/13 | LLM 6.1 | Induction and Recursion |
| 12 | Monday, 2/16 | LLM 6.1 | Induction and Recursion, Division with Remainder, Modular Mutiplication |
| 13 | Wednesday, 2/18 | LLM 6.2 Notes |
Strong Induction |
| 14 | Friday, 2/20 | LLM 8.1 - 8.2 | The Euclidean Algorithm, Optimizing Recursion |
| 15 | Monday, 2/23 | - | First Exam |
| 16 | Wednesday, 2/25 | LLM 15.1 - 15.2 Notes |
The Euclidean Algorithm, Fundamental Counting Principles |
| 17 | Friday, 2/27 | LLM 15.1 - 15.2 | Cartesian Products, Power Sets, Using Functions to Count |
| 18 | Monday, 3/2 | LLM 15.3 Notes |
Permutations, Generating Permutations in Scheme |
| 19 | Wednesday, 3/4 | LLM 15.4 - 15.5 | k-Permutations, Counting Subsets of a Certain Cardinality, Combinations |
| 20 | Friday, 3/6 | LLM 15.9 | Counting Problems |
| 21 | Monday, 3/9 | LLM 15.7 Notes |
Recurrence for Combinations, Generating Subsets of a Given Size |
| 22 | Wednesday, 3/11 | LLM 15.7, 15.13 | The Binomial Theorem, Properties of Binomial Coefficients |
| 23 | Friday, 3/13 | LLM 15.13 | Properties of Binomial Coefficients, Weak Compositions |
| - | - | - | Spring Break |
| 24 | Monday, 3/30 | LLM 7.1 | Recursive Data Types, Binary Trees |
| 25 | Wednesday, 4/1 | - | Second Exam |
| 26 | Friday, 4/3 | LLM 7.1, 7.5 | Binary Trees, Structural Induction |
| 27 | Monday, 4/6 | - | Binary Search Trees, Coding Sets Efficiently |
| 28 | Wednesday, 4/8 | LLM 3.1 - 3.3 | Propositional Logic |
| 29 | Friday, 4/10 | LLM 3.3 - 3.4 | Truth Assignments |
| 30 | Monday, 4/13 | LLM 3.3 - 3.4 | Truth Tables, Equivalent Formulas |
| 31 | Wednesday, 4/15 | LLM 4.4 | Boolean Functions, Relations |
| 32 | Friday, 4/17 | LLM 4.4 | Coding Relations in Scheme |
| 33 | Monday, 4/20 | LLM 9.11 Notes |
Equivalence Relations |
| 34 | Wednesday, 4/22 | LLM 9.1 | Directed Graphs |
| 35 | Friday, 4/24 | LLM 9.2 | Walks and Paths in Digraphs, Search Strategies |
| 36 | Monday, 4/27 | LLM 9.2 | Depth First Search vs. Breadth First Search, Computing Distances |
| 37 | Wednesday, 4/29 | - | Thid Exam |
| 38 | Friday, 5/1 | LLM 9.2 - 9.4 | Computing Distances in Digraphs, Representations of Graphs |
| 39 | Monday, 5/4 | - | Cryptography - Motivation and Examples |
| 40 | Wednesday, 5/6 | - | Encoding Using Modular Multiplication |
| 41 | Friday, 5/8 | - | Public-Key Cryptography, RSA |