CS 174 Schedule
| Wk | Day | Date | Topic | Reading Due | Homework Due |
| 1 | M | Jan 14 | Introduction; Basic counting | ||
| W | Jan 16 | Basic counting, cont. | 1.1 | ||
| F | Jan 18 | Counting permutations and subsets | 1.2 | ||
| M | Jan 21 | MLK Day - NO CLASS | |||
| 2 | T | Jan 22 | Counting permutations and subsets (continued) | ||
| W | Jan 23 | Binomial coefficients | 1.3 | Section 1.1 problems (p. 7-8) | |
| F | Jan 25 | Labeling problems | |||
| M | Jan 28 | Cryptography | 2.1 | Section 1.2 problems | |
| 3 | T | Jan 29 | Arithmetic modulo n | ||
| W | Jan 30 | Cryptography using addition and multiplication mod n | |||
| F | Feb 1 | Inverses mod n | 2.2 | Section 1.3 problems | |
| M | Feb 4 | ||||
| 4 | T | Feb 5 | Greatest common divisors | ||
| W | Feb 6 | Euclid's division theorem | Section 2.1 problems 1-14 | ||
| F | Feb 8 | Exam 1 | |||
| M | Feb 11 | Review exam 1 | |||
| 5 | T | Feb 12 | Euclid's GCD algorithm | ||
| W | Feb 13 | Euclid's extended GCD algorithm | |||
| F | Feb 15 | Exponents mod n | 2.3 | Section 2.2 problems 1-8, 11-13, 19 | |
| M | Feb 18 | RSA | |||
| 6 | T | Feb 19 | Equivalence and implication | 3.1 | Section 2.3 problems 1-6, 10 |
| W | Feb 20 | RSA project | |||
| F | Feb 22 | Variables and quantifiers | 3.2 | ||
| M | Feb 25 | Direct proofs | 3.3 | ||
| 7 | T | Feb 26 | Proof by contraposition | 3.3 Problem 2 | |
| W | Feb 27 | Proof by contradiction | 3.3 Problem 7 | ||
| F | Feb 29 | RSA work day | 3.1 problems 1-9, 12-13; 3.2 problems 1-10 |
||
| M | Mar 3 | More proof practice | |||
| 8 | T | Mar 4 | RSA project | ||
| W | Mar 5 | Review for exam | 3.3 problems 1-3, 6-7, 9-10, 14 | ||
| F | Mar 7 | Exam 2 | |||
| M-F | Mar 10-14 | Spring Break | |||
| M | Mar 17 | Proofs by smallest counterexample | 4.1 pp. 127-130 |
||
| 9 | T | Mar 18 | Mathematical induction | 4.1 pp. 130-135 |
|
| W | Mar 19 | Weak induction | 3.3 problems 8, 11-13 | ||
| F | Mar 21 | Strong induction | 4.1 problems 1-4 | ||
| M | Mar 24 | More induction proofs | 4.1 pp. 135-136 |
||
| 10 | T | Mar 25 | Yet more induction proofs | ||
| W | Mar 26 | And yet more induction proofs | 4.1 problems 6-8 | ||
| F | Mar 28 | Last day of induction | 4.1 problems 9, 11, 12 | ||
| M | Mar 31 | Probability | 5.1 | ||
| 11 | T | Apr 1 | Probability | 5.1 | |
| W | Apr 2 | Principle of inclusion & exclusion | 5.2 | ||
| F | Apr 4 | Exam 3 | |||
| M | Apr 7 | Review exam 3 | 5.1 problems 1-7, 14 | ||
| 12 | T | Apr 8 | Conditional probability | 5.3 pp. 236-240 |
5.2 problems 1-6 |
| W | Apr 9 | Random variables and the binomial distribution | 5.4 pp. 249-252 |
||
| F | Apr 11 | 5.3 problems 1-6, 9, 11, 13 | |||
| M | Apr 14 | ||||
| 13 | T | Apr 15 | Expected value | 5.4 pp. 252-258 |
|
| W | Apr 16 | Indicator random variables and the geometric distribution | 5.4 pp. 258-262 |
||
| F | Apr 18 | Linear recurrences | pp. 137-140, 4.2 | 5.4 problems 3-11, 13-16 | |
| M | Apr 21 | Recursion trees | 4.3 | ||
| 14 | T | Apr 22 | 4.2 problems 1, 3-5, 11, 14 | ||
| W | Apr 23 | Exam 4 | |||
| F | Apr 25 | 4.3 problems 1, 3, 4, 6, 7, 14(c) | |||
| M | Apr 28 | ||||
| R | May 1 | Final Exam |