Berkeley STAT 134: Concepts of Probability

STAT 134 is Berkeley's calculus-based probability course — distributions, expectation, conditional probability, joint distributions, and the central limit theorem. It's a core requirement for the statistics major and a popular foundation for data science, economics, and quant-finance paths.

Fennie is independent and not affiliated with UC Berkeley. This is an unofficial study guide.

Build my STAT 134 study plan

What makes it hard

Probability problems don't pattern-match: two problems using the same distribution can require completely different setups, and exams punish students who memorized formulas without modeling skill. The multivariable material (joint densities, covariance) leans on calculus fluency that some students have let rust.

What you'll cover

• Counting and conditional probability
• Discrete distributions
• Continuous distributions and densities
• Expectation, variance, and covariance
• Joint distributions
• Law of large numbers and central limit theorem

The STAT 134 study guide

How to study for Berkeley STAT 134, step by step.

1
Refresh multivariable integration before joint distributions
Joint densities mean double integrals, and rusty calculus turns probability problems into calculus problems. Review MATH 53-level integration before that unit arrives, not during it.
2
Solve probability problems every day
Probability intuition is built through volume and decays fast without it. STAT 134 problems don't pattern-match — two problems on the same distribution can need totally different setups — so breadth of practice is everything.
3
Train the translation step deliberately
The hard part is converting a word problem into the right random variables and distributions. Practice writing just the setup for many problems — naming variables, stating distributions, identifying what's asked — before computing anything.
4
Stress-test with past exams, not formula sheets
Memorized formulas without modeling skill is exactly what STAT 134 exams punish. Work past exams timed and audit whether each miss was a setup error or an execution error.
5
Generate endless practice with Fennie
Upload the STAT 134 syllabus and Fennie's Daily Plans pace daily problem work to your exam dates — and when you've exhausted the assigned problems, Fennie generates fresh ones from your actual course materials. Free to start.
Start my STAT 134 plan free

How Fennie helps with STAT 134

Daily Plans pace STAT 134 with daily problem work, because probability intuition is built through volume and decays fast without it. Use Fennie's chat to practice the setup step — translating a word problem into the right random variables and distributions — and generate fresh practice problems when you've exhausted the assigned ones.

FAQ

Is STAT 134 hard?

It's considered one of the harder lower-to-mid division quantitative courses because problems require modeling judgment, not formula recall. Students comfortable with multivariable integration and word-problem setup do well; everyone else needs sustained practice volume.

What's the difference between STAT 134 and DATA 140?

Both cover probability; DATA 140 integrates computation and serves the Data Science major, while STAT 134 is the traditional pencil-and-paper treatment. They overlap enough that majors typically take one or the other — check which your degree plan expects.

Do I need multivariable calculus for STAT 134?

Joint continuous distributions require double integrals, so multivariable calculus (MATH 53 or equivalent) is the expected background. If your integration is rusty, review it before the joint-distributions unit arrives.

Pass STAT 134 with a plan, not a cram

Upload your STAT 134 materials and Fennie generates a Daily Plan paced to your deadline — plus chat, flashcards, and quizzes built from the actual course content.

Get started free

More Berkeley courses

CS 61A — The Structure and Interpretation of Computer Programs

CS 61A is Berkeley's legendary intro CS course, taught primarily in Python with excursions into Scheme and SQL. It emphasizes abstraction — higher-order functions, recursion, object-oriented programming, and interpreters — and it's the first course in the CS 61 series that every CS and Data Science student takes.

CS 61B — Data Structures

CS 61B is Berkeley's data structures course, taught in Java, covering lists, trees, hashing, graphs, sorting, and asymptotic analysis. It's the second course in the 61 series and the one most cited in industry-interview prep — its projects, including the famous build-your-own-world and Gitlet (build a mini Git), are substantial software engineering exercises.

CS 70 — Discrete Mathematics and Probability Theory

CS 70 is Berkeley's discrete math and probability course, required for the CS major, covering proofs, graph theory, modular arithmetic, RSA, polynomials, counting, and a substantial probability unit. It's the theory gateway — and by reputation, the hardest lower-division course in the major.

DATA 8 — Foundations of Data Science

DATA 8 is Berkeley's intro data science course and one of the largest courses on campus, combining Python programming, statistical inference, and prediction with real datasets in Jupyter notebooks. It assumes no prior programming or statistics and anchors the Data Science major.