MIT 6.0002: Introduction to Computational Thinking and Data Science
6.0002 is the half-semester sequel to 6.0001, covering optimization, simulation, Monte Carlo methods, and a first taste of machine learning. Through OCW and edX it's one of the most-taken data science introductions in the world. In MIT's current catalog the material lives on as 6.100B.
Fennie is independent and not affiliated with MIT. This is an unofficial study guide.
What makes it hard
The course pivots from learning Python to using Python as a thinking tool, and the statistics is the silent difficulty: stochastic simulations, confidence in results, and knowing what a model's output does and doesn't mean. Self-learners who breezed through 6.0001 often stall when the psets stop being about syntax.
What you'll cover
- • Optimization and knapsack problems
- • Graph search
- • Stochastic thinking and randomness
- • Monte Carlo simulation
- • Sampling and confidence intervals
- • Curve fitting and basic machine learning
The 6.0002 study guide
How to study for MIT 6.0002, step by step.
- 1
Shift your goal from syntax to modeling
6.0002's psets ask you to model a situation, not implement a spec. Before coding, write down what's being simulated, what's random, and what question the output answers.
- 2
Run every simulation more than the pset requires
Vary the parameters and watch how the answers move. Intuition for stochastic results (when to trust them, how much they wobble) is the course's real product.
- 3
Treat the statistics as content, not commentary
Confidence intervals and sampling error are exam material and life material. When a lecture mentions a statistical idea, chase it until you could explain it without the code.
- 4
Keep the 6.0001 toolkit sharp
Classes, dictionaries, and plotting get used constantly without being retaught. A quick weekly rep on the prerequisites keeps the new material from being blocked by the old.
Today
Today's 6.0002 plan
What a Fennie Daily Plan looks like for 6.0002. 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
Should I take 6.0001 before 6.0002?
Yes. 6.0002 assumes the Python fluency 6.0001 builds and reuses its toolkit constantly. Together they form MIT's classic intro-to-CS-and-data-science pair on OCW and edX.
Is 6.0002 still offered at MIT?
The material lives on as 6.100B in the current numbering; the OCW and edX versions remain published as 6.0002 and stay fully usable for self-study.
How long does 6.0002 take to self-study?
Most self-learners finish in 4-8 weeks at several hours per week. The psets are where the learning happens, so budget most of the time there.
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, covering sorting, hashing, trees, graph algorithms, shortest paths, and dynamic programming, with emphasis on 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.