Stanford PSYCH 1: Introduction to Psychology
PSYCH 1 is Stanford's survey of psychology, covering research methods, the brain, learning, memory, development, social psychology, and disorders. It's one of the university's most popular courses, taught by marquee faculty in a large-lecture format.
Fennie is independent and not affiliated with Stanford University. This is an unofficial study guide.
What makes it hard
It's a volume game on a quarter clock: enormous vocabulary, a parade of studies and theorists, and exams favoring application questions where two answers look right unless you genuinely know the distinction. The fame and fun of the lectures lead students to under-prepare, and the first exam reliably recalibrates them.
What you'll cover
- • Research methods
- • Brain and behavior
- • Learning and conditioning
- • Memory
- • Social psychology
- • Development
- • Psychological disorders
The PSYCH 1 study guide
How to study for Stanford PSYCH 1, step by step.
- 1
Don't let great lectures replace studying
Enjoying the lecture and encoding the material are different events. Set up a real review routine in week one, before the first exam demonstrates the difference.
- 2
Flashcard each unit as you meet it
The vocabulary volume only stays manageable if the deck grows continuously. Capture terms, theorists, and key studies on first contact, not in a pre-exam scramble.
- 3
Review briefly every day
Fifteen daily minutes of spaced review beats a cram by a wide margin in vocabulary-dense courses, and on a ten-week clock there's no slack to relearn faded material.
- 4
Drill the look-alike distinctions
Exam questions are built so two options look right: reinforcement versus punishment, memory stages, adjacent disorders. Practice those contrasts explicitly with scenario questions.
Today
Today's PSYCH 1 plan
What a Fennie Daily Plan looks like for PSYCH 1. 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 PSYCH 1 at Stanford easy?
It's friendlier than the STEM gateways but not a free pass: the vocabulary volume is large, the quarter is short, and exam questions apply concepts to scenarios rather than asking definitions. Lecture attendance alone reliably under-prepares people for exam one.
How should I study for PSYCH 1 exams?
Spaced flashcard review through the week plus scenario practice, since exams favor questions that ask which concept a scenario illustrates over straight recall. Build the deck continuously from week one; a quarter leaves no room for relearning faded units.
What does PSYCH 1 cover?
The whole field at survey depth: research methods, neuroscience basics, sensation and perception, learning, memory, development, social psychology, personality, and disorders. It's broad coverage at quarter speed with exams carrying the grade.
More Stanford courses
CS 106A: Programming Methodology
CS 106A is Stanford's famous introduction to programming, taught in Python. It covers control flow, functions, decomposition, lists, dictionaries, and graphics, and assumes 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.