Module 3: Probability & Statistics

Primary text: Introduction to Probability
Selective support: Mathematics for Computer Science probability chapters and the local semester book chunks only where they sharpen modeling, expectation, or confidence language

This guide is the primary teacher. You do not need to read the source books front-to-back to complete this module. You do need to become operationally strong at probability modeling, random variables, expectation, dependence, and the statistical meaning of averaging and uncertainty.

---

Scope of This Module

The required continuous-model and inference extension adds concepts 16–20 after the original five clusters. See its learning sequence and PS9–PS12 gates.

This module is not a formula sheet for "plug and chug" probability. It is where uncertainty becomes something you model precisely.

What it covers in depth:

• building probability spaces from combinatorial structure instead of vague intuition
• event algebra, complements, overlap, and why equally likely outcomes must be justified
• conditional probability as a restricted world, not a decorative fraction
• Bayes' rule, total probability, base rates, and why many diagnostic intuitions fail
• independence as information neutrality, not the same thing as disjointness
• random variables as functions on outcomes, together with PMFs, CDFs, and transformations
• standard discrete models: Bernoulli, binomial, hypergeometric, geometric, and Poisson
• expectation, linearity, indicator variables, variance, covariance, and dependence structure
• continuous random variables, densities, Normal and Exponential models, and location-scale thinking
• the law of large numbers, the central limit theorem, empirical distributions, simulation, and careful confidence language

What it deliberately does not try to finish here:

• full mathematical statistics as a separate course
• measure-theoretic probability
• advanced stochastic processes beyond brief motivation
• hypothesis-testing catalogs and cookbook procedures detached from probabilistic meaning

This is an in-depth foundation module. If you can compute answers but cannot explain the model that produced them, you are not done.

---

Before You Start

Discrete probability may be studied before calculus. Before the continuous-model cluster, pass CAL1–CAL6 in Calculus Foundations: limits, differentiation, integration, density normalization and tail/error reasoning. The density bridge provides the missing integration prerequisites; it does not replace probabilistic model choice or inference.

Complete the prerequisite diagnostic. It checks fractions, sets, counting, and weighted averages from earlier modules. Probability questions are learning objectives here, not entry requirements. A short coding bridge supports learners who need to review loops and functions before the labs.

Use the assessment map to see the evidence required for each competency. This module does not promise a percentile rank; it asks you to demonstrate specific mathematical and engineering abilities.

---

What This Module Is For

Probability is the mathematical language for controlled uncertainty. Later CS work repeatedly asks questions like:

• what is the chance this randomized algorithm succeeds quickly?
• how many collisions, retries, failures, or rare events should we expect?
• when does new evidence actually change our belief?
• how much trust should we put in a sample, simulation, benchmark, or test result?
• what does "unlikely" mean quantitatively rather than rhetorically?

This module builds the probability and statistical reasoning needed for:

• randomized algorithms and expected running time
• data-structure analysis such as hashing and Bloom filters
• reliability, failure, and queueing intuition in systems
• machine learning foundations such as distributions, averaging, and variance
• simulation, experimentation, and confidence claims in engineering work

You are learning to reason about uncertainty without handwaving.

---

Concept Map

---

How To Use This Module

Work in order. The later clusters only make sense if the earlier modeling habits are stable.

Cluster 1: Probability Models

Order	Concept	Type	Focus
1	Probability Starts with a Well-Defined Model	PRIMARY	Outcomes, events, and the difference between the world and your model of it
2	Counting Models, Equally Likely Outcomes, and Event Algebra	SUPPORTING	When combinatorics legitimately turns into probability and how events combine
3	Complements, Unions, and Overlap Control	SUPPORTING	Complement counting, inclusion-exclusion, and avoiding double counting

Cluster mastery check: Can you define the sample space and justify why the probability model is valid before writing any formula?

Cluster 2: Conditioning and Information

Order	Concept	Type	Focus
4	Conditional Probability Restricts the World	PRIMARY	Reweighting when new information rules out outcomes
5	Bayes, Total Probability, and Base-Rate Reasoning	PRIMARY	Forward and reverse conditioning, priors, posteriors, and diagnostic thinking
6	Independence Is Information Neutrality, Not Disjointness	SUPPORTING	What independence really means and where intuition fails

Cluster mastery check: Can you explain in words what information is being conditioned on and whether it should change the model?

Cluster 3: Random Variables and Distributions

Order	Concept	Type	Focus
7	Random Variables Turn Outcomes into Quantities	PRIMARY	Random variables as functions, not mysterious containers
8	PMFs, CDFs, and Functions of Random Variables	SUPPORTING	Distribution descriptions, cumulative viewpoints, and transformation thinking
9	Core Discrete Distribution Families	PRIMARY	Bernoulli, binomial, hypergeometric, geometric, and Poisson models

Cluster mastery check: Can you choose a random variable that captures the real question instead of only the raw event?

Cluster 4: Expectation, Variance, and Dependence

Order	Concept	Type	Focus
10	Expectation Is the Center of a Random Process	PRIMARY	Weighted averages, long-run meaning, and why expectation matters
11	Linearity and Indicator Variables Are the Main Workhorses	PRIMARY	Solving expectation questions without full distributions
12	Variance, Joint Structure, and Covariance	PRIMARY	Spread, dependence, and how variables move together

Cluster mastery check: Can you compute expectation and variance with a reason, and can you say what those numbers do and do not tell you?

Cluster 5: Continuous Models and Statistical Thinking

Order	Concept	Type	Focus
13	Continuous Random Variables Use Densities, Not Point Masses	PRIMARY	PDFs, intervals, and why point probabilities collapse to zero
14	Normal, Exponential, and the Return of Standardization	SUPPORTING	Two core continuous models and how scale changes interpretation
15	Averages, Simulation, and Confidence Language	PRIMARY	LLN, CLT, empirical distributions, Monte Carlo, and careful statistical claims

Cluster mastery check: Can you explain why averaging stabilizes, why Normal approximations recur, and why "95% confidence" is not the same thing as "95% probability the fact is true"?

Then work these practice pages:

Order	Practice path	Focus
1	Probability Modeling and Conditioning Lab	Sample spaces, event setup, conditioning, Bayes, and independence
2	Random Variables and Distribution Workshop	PMFs, CDFs, model selection, and distribution comparison
3	Expectation, Variance, and Statistical Reasoning Clinic	Indicators, variance, covariance, LLN, CLT, and confidence language
4	Code Katas	Simulation and probabilistic programming drills

Use Module Quiz after the concept and practice path. Use Reference and Selective Reading and Learning Resources only for targeted reinforcement.

---

Learning Objectives

By the end of this module you should be able to:

1. Build a correct probability space and justify whether an equally likely model is legitimate.
2. Compute event probabilities using complements, unions, overlap accounting, and counting arguments.
3. Interpret conditional probability as model restriction and use it to solve multistage problems.
4. Apply Bayes' rule and the law of total probability without losing track of base rates.
5. Distinguish clearly between mutual exclusivity, conditional dependence, and independence.
6. Define and use random variables, PMFs, CDFs, and simple transformations.
7. Recognize when Bernoulli, binomial, hypergeometric, geometric, or Poisson models fit a problem.
8. Compute and interpret expectation, linearity, indicator sums, variance, and covariance.
9. Work with continuous random variables using PDFs and interval probabilities.
10. Explain the law of large numbers, the central limit theorem, and the difference between probability statements and confidence statements.

---

Outputs and Completion Standard

• Written attempts for the 16 problems in the three practice sets, including assumptions, corrections, and changed cases for errors.
• Your original six-function lab implementation, passing checker output, two seeded reports, and completed evidence template.
• Your four-function inference lab, two additional seeded reports, memo appendix and PS9–PS12 evidence.
• The experiment-design memo, explaining what the workload fixture establishes and what it cannot establish.
• An independent eight-item assessment, scored per competency using the rubric, plus a delayed changed-case recheck.

Separate guided practice, self-assessment, and review by another person. Passing code checks alone is insufficient; a missing model assumption requires repair even when a total score is high. See the instructor guide for the review process and current validation limits.

---

Reading Policy

• Concept pages are the main path.
• Local book chunks are selective reinforcement, not a second syllabus.
• Read only if stuck means try the concept page, self-check, and drill first.
• Optional deep dive means additional nuance or exercise volume, not required progression.
• Because this is an in-depth module, written modeling explanations are required, not optional enrichment.

---

Suggested Workload and Sequence

Plan roughly 70–100 focused hours, or around 7–10 weeks at ten hours per week, including the required inference extension. These are author estimates awaiting learner pilots. Prior preparation and remediation can change the time substantially; do not compress the module into a calendar week simply to match a semester label.

Phase	Work	Estimated hours
Entry	Diagnostic and specific prerequisite repair	2–4
Models and information	Concepts 1–6, worked examples 1–2, practice A	9–12
Variables and expectation	Concepts 7–12, worked examples 3–4, practice B	10–14
Statistical reasoning	Concepts 13–15, practice C, experiment-design lesson	9–12
Executable work	Four labs, evidence, corrections; may interleave with lessons	8–12
Assessment and repair	Quiz, memo review, targeted repair, delayed recheck	7–11
Continuous models and inference extension	Concepts 16–20, new practice, lab/memo and PS9–PS12	25–35

The delay before the retention check is calendar time, not additional study hours. Optional external exercises and deeper reading add time; they are not hidden requirements in this estimate. Use the guided labs for the download and precise workflow, and the reading guide for selective book assignments.

---

Reference

If you need exact links into the local chunked books, use Reference and Selective Reading.

---

Rich Learning Pages

Worked Examples | Guided Labs | Case Studies | Mistake Clinic | Reading Guide | Capstone Thread

Required inference extension

After concepts 1–15 and the calculus entry gate, complete Continuous Models and Inference. It adds transformations, joint densities, maximum likelihood, Bayesian parameter updates and an exact paired randomization experiment. The original PS1–PS8 gates remain required; PS9–PS12 add independent evidence. Its 25–35 hours are included in the revised module total.