| Date | Lecture Topic | Reading | Assigned | Quiz/HW Due |
|---|---|---|---|---|
| Wed, Aug 30 | Goals, Logic | 1.1 | ||
| Mon, Sept 4 | NO CLASS -- LABOR DAY | |||
| Wed, Sept 6 | Propositional Equivalence | 1.2 | Homework 1 | |
| Mon, Sept 11 | Predicates and Quantifiers | 1.3 | Quiz 1 | |
| Wed, Sept 13 | Quantifiers (cont) | Homework 2 | Homework 1 | |
| Mon, Sept 18 | Laws of Inference | 3.1 through Example 13 | Quiz 2 | |
| Wed, Sept 20 | Direct and Indirect Proofs, Proof by Contradiction | 3.1 through Example 16 | Homework 3 | Homework 2 | Mon, Sept 25 | Additional Proof Techniques | 3.1 through Example 19 | Quiz 3 | Wed, Sept 27 | Existence Proofs | Remainder of 3.1 | Homework 3 |
| Mon, Oct 2 | Mathematical Induction | 3.2 | ||
| Wed, Oct 4 | EXAM 1 | Homework 4 | ||
| Mon, Oct 9 | Go over exam 1, work some additional exercises | Quiz 4 | ||
| Wed, Oct 11 | Mathematical Induction (cont), Recursive Definitions and Algorithms | 3.3-3.4 | Homework 5 | Homework 4 |
| Mon, Oct 16 | Program Correctness | 3.5 | Quiz 5 | |
| Wed, Oct 18 | Program Correctness (cont) | Homework 6 | Homework 5 | |
| Mon, Oct 23 | Functions | 1.6 | Quiz 6 | |
| Wed, Oct 25 | Sequences and Summations | 1.7 through Example 15 | Homework 7 | Homework 6 |
| Mon, Oct 30 | Sets, Cardinality | 1.5, Remainder of 1.7 | Quiz 7 | |
| Wed, Nov 1 | Why Study Counting? Basics of Counting | Homework 7 | ||
| Mon, Nov 6 | Pigeonhole Principle, Permutations and Combinations | 4.1 | ||
| Wed, Nov 8 | EXAM 2 | 4.2-4.3 | Homework 8 | Homework 7 |
| Mon, Nov 13 | Generalized Permutations and Combinations | 4.6 | Quiz 8 | |
| Wed, Nov 15 | Relations and Representing Relations | 6.1 and 6.3 | Homework 9 | Homework 8 |
| Mon, Nov 20 | Closures of Relations, Equivalence Relations | 6.4-6.5 | ||
| Wed, Nov 22 | No Class -- Thanksgiving Break | |||
| Mon, Nov 27 | Partial Orders, Introduction to Graphs | 6.6 and 7.1 | Quiz 9 | |
| Wed, Nov 29 | Graph Isomorphism, Euler and Hamilton Cycles | 7.2, 7.3, and 7.5 | Homework 10 | Homework 9 |
| Mon, Dec 4 | Using Finite State Machines and DFAs to Model Computation | 10.2-10.3 | Quiz 10 | |
| Wed, Dec 6 | Limitations of Computation Using a DFA | 10.4, Example 5 | Homework 10 | |
| Mon, Dec 11 | Overview and review for the final | |||
| Fri, Dec 15 | Final Exam 9:30am-12:30pm (Brown 100) |