Stanford STATS 60: Introduction to Statistical Methods: Precalculus
STATS 60 — also offered as PSYCH 10 and STATS 160 — is Stanford's precalculus introduction to statistics: exploring data, sampling, probability basics, inference, and regression, with modern offerings working in real datasets and code. It serves a wide range of majors as their statistics requirement.
Fennie is independent and not affiliated with Stanford University. This is an unofficial study guide.
Build my STATS 60 study planWhat makes it hard
No calculus doesn't mean no difficulty: the course is cumulative and conceptual, and exams reward choosing the right procedure for a scenario and interpreting results in plain English — exactly what formula memorizers miss. Students cruise through descriptive statistics, treat probability casually, then meet inference, which assumes both fluently.
What you'll cover
- • Exploring and visualizing data
- • Sampling and study design
- • Probability foundations
- • Confidence intervals
- • Hypothesis testing
- • Correlation and regression
The STATS 60 study guide
How to study for Stanford STATS 60, step by step.
- 1
Take the probability weeks seriously
The course's failure pattern is coasting through descriptive stats, half-learning probability, then drowning at inference. The probability unit is the foundation — give it full effort while it still feels easy.
- 2
Practice scenario-to-procedure matching
Given a question about data, decide which interval or test applies and why, before computing. Exams emphasize that choice, and it's the skill rereading notes never builds.
- 3
Write a plain-English sentence for every result
End each practiced test or interval with one sentence of interpretation in context. That's the format exam questions reward, and the habit is what makes the concepts stick.
- 4
Stay current with the hands-on work
The dataset and code-based exercises surface confusion while it's still cheap to fix. Doing them early in the week converts gaps into questions instead of exam losses.
- 5
Review cumulatively each week
Inference assumes sampling distributions, which assume probability. Fold a few earlier-unit questions into every week so nothing has gone cold by the time it's load-bearing.
- 6
Hold the cumulative line with Fennie
Upload your STATS 60 syllabus and Fennie's Daily Plan locks probability down before inference needs it and keeps review synced to the exams, with quizzes generated from the actual course content. It's free to start.
Start my STATS 60 plan free
How Fennie helps with STATS 60
Fennie's Daily Plans hold STATS 60's cumulative line — probability solid before inference arrives, weekly review keeping early units warm, everything synced to the exam dates. Chat until you can pick the right procedure for a scenario and explain a p-value in plain English, because interpretation is where these exams are decided.
FAQ
Is STATS 60 hard?
It's accessible but unforgiving of gaps: every unit builds on the last, and students who fall behind before hypothesis testing rarely catch up comfortably on a quarter clock. Exams reward interpretation and procedure choice over computation.
What's the difference between STATS 60, PSYCH 10, and STATS 160?
They're the same course under cross-listed numbers — enroll under whichever your program prefers. The content, exams, and credit are shared; only the catalog label differs.
Do I need calculus for STATS 60?
No — it's explicitly the precalculus statistics course. The challenge is conceptual: understanding what sampling distributions, intervals, and tests mean, and matching procedures to scenarios, rather than any difficult math.
Pass STATS 60 with a plan, not a cram
Upload your STATS 60 materials and Fennie generates a Daily Plan paced to your deadline — plus chat, flashcards, and quizzes built from the actual course content.
Get started freeMore Stanford courses
CS 106A — Programming Methodology
CS 106A is Stanford's famous introduction to programming, taught in Python — control flow, functions, decomposition, lists, dictionaries, and graphics — assuming zero prior experience. Its lectures and assignments are public, and through Code in Place it has been taught free to hundreds of thousands of people, so it's studied worldwide by enrolled students and self-learners alike.
CS 106B — Programming Abstractions
CS 106B follows 106A with programming abstractions in C++ — recursion, ADTs and the standard collections, big-O, linked structures, trees, and hashing. It's the course where Stanford CS gets real, and like 106A its materials are public and heavily used by self-learners.
CS 107 — Computer Organization and Systems
CS 107 takes students from C++ down to the machine: C programming, pointers and memory, bit-level representation, x86-64 assembly, and how the heap actually works — culminating in the famous heap allocator assignment. It's the systems gateway of the Stanford CS core.
CS 103 — Mathematical Foundations of Computing
CS 103 is Stanford's discrete math and theory gateway — proof techniques, set theory, induction, graph basics, then finite automata, regular languages, and the first look at computability and P vs NP. For most students it's the first course where the deliverable is a proof, not a program.