Date | Description |
---|---|
January 6 |
Overview Reading: BT 1.1, 1.2, 1.6, Intro to Schnapsen, Rules of Schnapsen |
January 8 |
Counting: product rule, permutations Reading: Safety First (Schnapsen analysis) Trick mechanics |
January 10 | Counting: combinations |
January 13 | Counting: complementing, inclusion-exclusion, pigeonhole; Intro to probability |
January 15 |
Probability axioms, equiprobable outcomes Reading: BT 1.3 |
January 17 |
Conditional probability Reading: BT 1.4 |
January 22 | Law of Total Probability |
January 24 |
Bayes' Rule Reading: BT 1.5 |
January 27 |
Independence Reading: BT 2.1-2.3 |
January 29 |
Random variables Reading: BT 2.4, 2.7 |
January 31 |
Expectation Reading: Expected Game Points, last year's exercise |
February 3 | Linearity of expectation |
February 5 | Variance |
February 10 | Uniform, Bernoulli, binomial distributions |
February 12 | Error-correcting codes |
February 14 |
Poisson distribution Reading: BT 3.1-3.2 |
February 19 |
Continuous random variables, uniform, exponential Reading: BT 3.3 |
February 21 |
Normal distribution Reading: BT 5.4 |
February 24 |
Central Limit Theorem, Markov and Chebyshev inequalities Reading: BT 5.1 |
February 26 | Chernoff bound, Quicksort |
February 28 |
Analysis of randomized Quicksort Reading: BT 5.2, 5.5 |
March 3 |
Law of large numbers Reading: BT 9.1 |
March 5 | Maximum likelihood estimators |
March 7 | Bias |
March 10 | Confidence intervals |
March 12 |
Freivalds' randomized algorithm slides |
March 14 | Final exam review |