UW STAT 311: Elements of Statistical Methods
STAT 311 is UW's primary introductory statistics course, covering descriptive statistics, probability, sampling distributions, confidence intervals, and hypothesis testing. It satisfies stats requirements for a wide range of majors and is a common prerequisite for upper-level quantitative work.
Fennie is independent and not affiliated with University of Washington. This is an unofficial study guide.
What makes it hard
The conceptual material (what a p-value actually means, when to use which test) is harder than the arithmetic, and exams punish formula-matching without understanding. The transition from probability to inference midway through the quarter is where most students lose the thread.
What you'll cover
- • Descriptive statistics and visualization
- • Probability basics
- • Random variables and distributions
- • Sampling distributions and the CLT
- • Confidence intervals
- • Hypothesis testing
The STAT 311 study guide
How to study for UW STAT 311, step by step.
- 1
Overlearn probability before inference arrives
The midquarter transition from probability to inference is where STAT 311 loses people. If sampling distributions are solid, confidence intervals and hypothesis tests are short steps; if not, nothing after week five makes sense.
- 2
Interpret every answer in plain English
After each computed interval or test, write one sentence about what it claims in context. Exams punish students who can compute but not interpret, and the interpretation sentence is usually worth points itself.
- 3
Build a test-selection decision chart
One page: data type, number of groups, question asked, which procedure applies. Most exam errors are choosing the wrong tool, not using a tool wrong.
- 4
Practice from word problems, not formula sheets
Start each practice session from a scenario description and decide what to do before touching the math. That mirrors how every exam question is built.
Today
Today's STAT 311 plan
What a Fennie Daily Plan looks like for STAT 311. 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 STAT 311 hard?
It's moderate. The math is light, but the concepts are slippery. Students who can compute but not interpret tend to hit a wall at hypothesis testing.
Does STAT 311 require calculus?
No heavy calculus is required for the core coursework, though comfort with algebra and functions matters. Check current prerequisites in the UW course catalog.
Is STAT 311 good preparation for data science?
It's a solid conceptual foundation in inference. Students heading into data-heavy majors usually follow it with programming-based statistics or the CSE/STAT data science pathways.
More UW courses
CSE 121: Introduction to Computer Programming I
CSE 121 is UW's no-experience-required intro to programming in Java, the first course in the CSE 12X sequence that replaced the old CSE 142/143 in 2022. It's designed for students who have never written code, covering variables, control flow, methods, and arrays through weekly programming assignments.
CSE 122: Introduction to Computer Programming II
CSE 122 is the second course in UW's intro programming sequence, and the usual starting point for students with AP CS A credit or prior coding experience. It covers data structures from the client perspective (lists, sets, maps, stacks, queues) plus file processing and reasoning about code complexity.
CSE 123: Introduction to Computer Programming III
CSE 123 completes UW's intro programming sequence, shifting from using data structures to building them. Students implement linked lists and binary trees, write recursive algorithms, and design class hierarchies with inheritance and interfaces, the material that used to be the back half of CSE 143.
CSE 311: Foundations of Computing I
CSE 311 is UW's discrete math and theory course: propositional logic, proofs, set theory, induction, regular expressions, and finite automata. It's the first course in the major where the work is writing proofs instead of writing programs, and it underpins everything from CSE 312 to algorithms.