Stanford ECON 1: Principles of Economics
ECON 1 is Stanford's single-course introduction to economics: supply and demand, elasticity, firm behavior, and market structures, plus the macro core of GDP, inflation, and monetary and fiscal policy, all in one quarter. It's one of the university's largest courses and the gateway to the econ major.
Fennie is independent and not affiliated with Stanford University. This is an unofficial study guide.
What makes it hard
It's two semesters of material in ten weeks: micro and macro both, with exams favoring application (shift this curve, trace this policy through the economy) over definitions. The pace means each topic gets one pass, and the macro material's deceptive news-familiarity leads students to under-study precisely the questions that demand model-level precision.
What you'll cover
- • Supply, demand, and equilibrium
- • Elasticity
- • Costs and firm behavior
- • Market structures
- • GDP, inflation, and unemployment
- • Monetary and fiscal policy
The ECON 1 study guide
How to study for Stanford ECON 1, step by step.
- 1
Practice application from week one
ECON 1 exams test doing (curve shifts, elasticity computations, policy chains), not reciting. Study time belongs in practice questions from the start, not in rereading notes.
- 2
Draw the graphs by hand until automatic
Supply-demand shifts, surplus regions, cost curves, AD/AS. Recognizing a correct graph is easy; producing the reasoning behind it under exam time is the actual skill.
- 3
Respect the one-pass pace
Each topic gets a single quarter-speed pass, so same-week consolidation is mandatory. A topic left fuzzy on Friday stays fuzzy at the midterm.
- 4
Unlearn news-level macro intuition
The macro half feels familiar from headlines, which is exactly why students under-study it. Treat every term as new and trace policy effects through the actual model, not the vibe.
- 5
Rehearse the exam format under time
Timed question sets spanning everything covered. With micro and macro both live, breadth under time pressure is the thing to train before each exam.
Today
Today's ECON 1 plan
What a Fennie Daily Plan looks like for ECON 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 ECON 1 hard?
The concepts are introductory but the design is demanding: micro and macro in one quarter, application-heavy exams, one pass per topic. Students who consolidate weekly and practice graph-and-scenario questions land well; crammers face an unusually wide final.
How do I study for ECON 1 exams?
Work application questions in exam format (curve shifts, elasticity calculations, policy traced through AD/AS) under time limits. Draw graphs by hand until automatic, and give the macro half real study despite its news-familiarity; that familiarity is a trap.
Does ECON 1 cover both micro and macro?
Yes. It's Stanford's combined principles course, covering the micro core (markets, firms, elasticity) and the macro core (GDP, inflation, policy) in a single quarter. It's the prerequisite gateway for the economics major and most upper-level econ courses.
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.