CMU 36-200: Reasoning with Data
36-200 is CMU's introductory statistics course: exploring data, sampling and study design, inference, and regression, taught with real datasets and a reasoning-first approach rather than formula drilling. It serves students across the university as the statistics gateway.
Fennie is independent and not affiliated with Carnegie Mellon University. This is an unofficial study guide.
What makes it hard
The course grades thinking, not computing: assessments favor choosing the right method for a scenario and interpreting results in context, which formula memorizers reliably miss. The material is cumulative (inference assumes sampling distributions assume study-design concepts) so a casual middle-of-semester stretch compounds quietly.
What you'll cover
- • Exploring and visualizing data
- • Study design and sampling
- • Probability and sampling distributions
- • Confidence intervals
- • Hypothesis testing
- • Correlation and regression
The 36-200 study guide
How to study for CMU 36-200, step by step.
- 1
Study the reasoning, not the recipes
36-200 assessments ask why a method applies and what its result means, not just the computation. For every procedure, learn the conditions and the interpretation as part of the procedure itself.
- 2
Practice scenario-to-method matching
Given a study description, decide which analysis fits and why, before any numbers. That decision is the tested skill and the one rereading notes never builds.
- 3
Write the plain-English conclusion every time
End every practiced analysis with one sentence in context, stating what the interval or test actually says about the question. That format is what exam answers are graded on.
- 4
Take study design seriously early
Sampling, bias, and causation-versus-correlation concepts anchor the whole course and recur on every assessment. They feel soft and they're load-bearing.
- 5
Review cumulatively each week
Inference assumes everything before it fluently. Folding a few earlier-unit questions into each week keeps the foundation warm without a pre-exam scramble.
Today
Today's 36-200 plan
What a Fennie Daily Plan looks like for 36-200. Yours is built from your own syllabus and adapts every day to your deadlines and progress.
First plan free, no card required. Fennie is independent and unaffiliated with your school.
FAQ
Is 36-200 hard?
It's accessible but graded on reasoning: choosing methods for scenarios and interpreting results in context. Students expecting plug-and-compute statistics find the assessments surprisingly resistant to formula memorization, which is the design, not an accident.
Do I need calculus for 36-200?
No. The mathematics is light by design. The challenge is conceptual: understanding what sampling variability, intervals, and tests mean well enough to deploy and interpret them on unfamiliar scenarios.
What comes after 36-200?
For students continuing in statistics or data science, 36-202 and the methods sequence build directly on it. The scenario-to-method reasoning 200 develops is exactly what the follow-on courses assume, so genuine mastery beats a thin pass.
More CMU courses
15-112: Fundamentals of Programming and Computer Science
15-112 is CMU's famous accelerated introduction to programming in Python: control flow, functions, data structures, recursion, OOP, and efficiency, ending in an open-ended term project. Its public course website and the related CMU CS Academy platform give it a search footprint far beyond Pittsburgh.
15-110: Principles of Computing
15-110 is CMU's gentler introduction to computing, covering Python programming plus computing concepts like data representation, algorithms, and the limits of computation. It's designed for students who aren't CS majors or who want a runway before 15-112, and it's one of the largest courses on campus.
15-122: Principles of Imperative Computation
15-122 teaches imperative programming with correctness front and center: contracts, loop invariants, and reasoning about code in the C0 teaching language before transitioning to real C. It covers data structures from stacks and queues through hash tables, trees, and graphs, and it's the second course of the CMU CS core.
15-150: Principles of Functional Programming
15-150 teaches functional programming in Standard ML: types, recursion and induction, higher-order functions, and reasoning about programs as mathematical objects. It runs alongside 15-122 in the CMU CS core, and for most students it's the first time programming and proof become the same activity.