Subscribe to this calendar (Google, iCal, etc.)
Date | Description |
---|---|
January 7 |
Overview; Counting: product rule Reading: BT 1.1, 1.2, 1.6, Intro to Schnapsen, Rules of Schnapsen Notes, HW1 LaTeX source |
January 9 |
Counting: permutations Reading: Safety First (Schnapsen analysis) Trick mechanics, Notes |
January 11 |
Counting: combinations Notes |
January 14 |
Counting: Complementing, inclusion-exclusion, pigeonhole principle Reading: BT 1.3 Notes |
January 16 |
Intro to probability, equally likely outcomes Notes, HW2 LaTeX source |
January 18 |
Conditional probability Reading: BT 1.5 Notes |
January 23 |
Law of Total Probability, Bayes' Theorem Reading: BT 1.4 Notes, HW3 LaTeX source |
January 25 |
Independent events Reading: BT 2.1-2.3 Notes |
January 28 |
Gambler's Ruin, Naive Bayes classifier Reading: Naive Bayes notes Slides (PDF, PPTX), Notes |
January 30 |
Random variables, expectation Reading: BT 2.4, Expected Game Points, previous year's exercise Notes, HW4 LaTeX source |
February 1 |
Geometric random variable, linearity of expectation Reading: BT 2.7 Notes |
February 4 | UW snow closure |
February 6 |
Variance Notes |
February 8 |
Independent random variables Notes, HW5 LaTeX source |
February 11 | UW snow closure |
February 15 |
Uniform, Bernoulli, binomial distributions, error-correcting codes, Poisson distribution Reading: BT 3.1-3.2 Notes, Slide pack 6 slides 67-80, general Hamming code |
February 20 |
Continuous random variables Reading: BT 3.3 Notes, HW6 LaTeX source |
February 22 |
Uniform, exponential distributions Reading: BT 7.4 Notes |
February 25 |
Normal distribution, Central Limit Theorem Slide pack 7, slides 20-33, Demo, Notes |
February 27 |
Approximating binomial via Central Limit Theorem, continuity correction Reading: Maximum likelihood estimators Slide pack 10, slides 30-42, HW7 LaTeX source |
March 1 |
Maximum likelihood estimators Reading: Bias and confidence intervals Notes |
March 4 |
Maximum likelihood estimators for normal distribution; bias Notes |
March 6 |
Confidence intervals Reading: BT 7.1 Notes, HW8 LaTeX source |
March 8 |
Markov and Chebyshev inequalities Reading: BT 7.2, 7.5 Notes |
March 11 |
Chernoff Inequality, law of large numbers, probabilistic algorithms Slide pack 10, slides 14-19, Notes |
March 13 |
Probabilistic algorithms: quicksort, matrix multiplication Freivalds' algorithm |
March 15 |
Review, wrap-up Notes |