MIT 7.012: Introductory Biology

7.012 is one of MIT's introductory biology GIR options, famously taught by Eric Lander and Robert Weinberg in its OCW incarnation, covering biochemistry, genetics, molecular biology, and special topics like cancer, immunology, and genomics. Every MIT student takes a 7.01x course regardless of major.

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

Build my 7.012 study plan

What makes it hard

MIT biology exams test problem-solving — designing experiments, interpreting genetic crosses, predicting outcomes of perturbations — not recall, which surprises students who aced memorization-based high school biology. Genetics problem sets are the classic difficulty spike.

What you'll cover

• Biochemistry and protein function
• Molecular biology and the central dogma
• Genetics and genetic analysis
• Recombinant DNA and genomics
• Cancer biology
• Immunology

The 7.012 study guide

How to study for MIT 7.012, step by step.

1
Study by solving, not by memorizing
7.012 exams test experimental reasoning — designing experiments, predicting perturbation outcomes — which memorization can't carry. Make problems the center of every study session from week one.
2
Work genetics crosses by hand until they're routine
The genetics psets are the classic 7.012 difficulty spike. Draw out crosses, pedigrees, and linkage problems repeatedly; the notation has to become automatic before exam reasoning can happen on top of it.
3
Reserve flashcards for the molecular machinery only
Polymerases, ribosomes, pathway components — drill the vocabulary so it's free, then spend the saved mental energy on the problem-solving exams actually reward.
4
Use the OCW exams to learn the question style
The Lander/Weinberg 7.012 materials on OCW include exams with solutions. Attempt them honestly first — the experimental-design question style surprises everyone once, and it's better for that to happen in practice.
5
Train the reasoning with Fennie
Upload the 7.012 syllabus or OCW outline and Fennie's Daily Plan paces each unit with problem-based review, generating genetics practice questions and machinery flashcards from the actual course content. Free to start.
Start my 7.012 plan free

How Fennie helps with 7.012

Daily Plans pace 7.012's units with problem-based review — the experimental-reasoning skill MIT exams test is built through practice, not rereading. Chat through a genetics cross or experimental-design question step by step, and use flashcards only for the molecular machinery vocabulary that frees you to think.

FAQ

Is 7.012 hard?

The concepts are accessible, but exams demand experimental reasoning and genetics problem-solving that memorization can't carry. Practice with problem-style questions is the differentiator.

What's the difference between 7.012, 7.013, and 7.014?

All cover the same core biology GIR material with different special-topic emphases — 7.012 leans genomics and disease. Any of them satisfies the requirement.

Is the 7.012 OCW course still worth taking?

Yes — the Lander/Weinberg lectures remain a renowned introduction to molecular biology, though the field has moved since recording, so supplement recent genomics topics with newer material.

Pass 7.012 with a plan, not a cram

Upload your 7.012 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 MIT courses

6.100A — Introduction to Computer Science Programming in Python

6.100A — formerly 6.0001, the number most search results still use — is MIT's half-semester introduction to programming in Python for students with little or no experience. The 6.0001 lectures on OpenCourseWare are among the most popular free programming courses anywhere.

6.006 — Introduction to Algorithms

6.006 is MIT's core algorithms class — sorting, hashing, trees, graph algorithms, shortest paths, and dynamic programming — emphasizing both rigorous analysis and Python implementation. Its OpenCourseWare lectures are a global standard for learning algorithms and prepping technical interviews.

6.046J — Design and Analysis of Algorithms

6.046J — renumbered 6.1220 in MIT's current catalog, but still searched overwhelmingly by its old number — is the advanced algorithms course following 6.006: divide and conquer, randomized algorithms, amortization, network flow, approximation, and complexity. The OCW lectures are a staple for advanced self-study.

6.042J — Mathematics for Computer Science

6.042J — now numbered 6.1200J — is MIT's discrete math course for CS: proofs, induction, number theory, graph theory, counting, and discrete probability. Its OCW versions, with full lecture videos and the famous free textbook, make it one of the most-used discrete math resources in the world.