| Date | Description |
|---|---|
| January 4 |
Overview Reading: BT 1.1, 1.2, 1.6, Intro to Schnapsen, Rules of Schnapsen |
| January 6 |
Counting: product rule Reading: Safety First (Schnapsen analysis) Trick mechanics |
| January 8 | Counting: permutations, combinations |
| January 11 | Counting: complementing, inclusion-exclusion, pigeonhole principle |
| January 13 |
Intro to probability; equiprobable outcomes Reading: BT 1.3 |
| January 15 |
Conditional probability Reading: BT 1.5 |
| January 20 |
Law of Total Probability Reading: BT 1.4 |
| January 22 |
Bayes' Theorem Reading: BT 2.1-2.3 |
| January 25 |
Independent events Reading: BT 2.4 |
| January 27 |
Random variables, expectation Reading: Expected Game Points, last year's exercise |
| January 29 |
Linearity of expectation Reading: BT 2.7 |
| February 1 |
Variance, independence Lecture notes |
| February 3 |
Uniform and Bernoulli distributions Lecture notes |
| February 5 |
Binomial distribution Reading: Close Quarters |
| February 8 |
Error-correcting codes, Poisson distribution Reading: BT 3.1-3.2 |
| February 12 |
Continuous random variables, uniform distribution, exponential distribution Reading: BT 3.3 Lecture notes |
| February 17 |
Normal distribution Reading: BT 7.4 |
| February 19 |
Central Limit Theorem Demo |
| February 22 |
Examples of Central Limit Theorem Reading: BT 7.1 |
| February 24 |
Markov, Chebyshev, and Chernoff inequalities Reading: BT 7.2, 7.5 Lecture notes |
| February 26 |
Law of large numbers Reading: Maximum likelihood estimators Lecture notes |
| February 29 |
Maximum likelihood estimators Reading: Bias and confidence intervals |
| March 2 |
Bias, confidence intervals Lecture notes |
| March 4 | Student's t-distribution |
| March 7 |
Probabilistic algorithms: Quicksort Lecture notes |
| March 9 |
Probabilistic algorithms: matrix multiplication Freivalds' algorithm |
| March 11 | HW8 solutions, final exam review |