Probabilistic System Analysis And Applied Probability (Fall 2013) (M-I-T)

• 1. Probability Models and Axioms (M-I-T)
• Geniuses and Chocolates (M-I-T)
• Uniform Probabilities on a Square (M-I-T)
• 2. Conditioning and Bayes' Rule (M-I-T)
• A Coin Tossing Puzzle (M-I-T)
• Conditional Probability Example (M-I-T)
• The Monty Hall Problem (M-I-T)
• 3. Independence (M-I-T)
• A Random Walker (M-I-T)
• Communication over a Noisy Channel (M-I-T)
• Network Reliability (M-I-T)
• A Chess Tournament Problem (M-I-T)
• 4. Counting (M-I-T)
• Rooks on a Chessboard (M-I-T)
• Hypergeometric Probabilities (M-I-T)
• 5. Discrete Random Variables I (M-I-T)
• Sampling People on Buses (M-I-T)
• PMF of a Function of a Random Variable (M-I-T)
• 6. Discrete Random Variables II (M-I-T)
• Flipping a Coin a Random Number of Times (M-I-T)
• Joint Probability Mass Function (PMF) Drill 1 (M-I-T)
• The Coupon Collector Problem (M-I-T)
• 7. Discrete Random Variables III (M-I-T)
• Joint Probability Mass Function (PMF) Drill 2 (M-I-T)
• 8. Continuous Random Variables (M-I-T)