| Current SB programs: | 6-3 | 6-4 | 6-5 | 6-7 | 6-14 | 6-9![]() |
11-6![]() |
| Current MNG programs: | 6-P3 | 6-P4 | 6-P5 | 6-P7 | 6-P14 | 6-P9![]() |
|
| Older programs: | |||||||
Degree Requirements for 6-P14_2022
MNG in Computer Science, Economics, and Data Science
Show old EECS subject numbers
-
Three math subjects:
One of18.06 18.06 Linear Algebra,
(
,
)
Prereqs: GIR:CAL2
Units: 4-0-8Basic subject on matrix theory and linear algebra, emphasizing topics useful in other disciplines, including systems of equations, vector spaces, determinants, eigenvalues, singular value decomposition, and positive definite matrices. Applications to least-squares approximations, stability of differential equations, networks, Fourier transforms, and Markov processes. Uses linear algebra software. Compared with 18.700, more emphasis on matrix algorithms and many applications.
18.C06
18.C06 Linear Algebra and Optimization,
(
)
Prereqs: GIR:CAL2
Units: 5-0-7Introductory course in linear algebra and optimization, assuming no prior exposure to linear algebra and starting from the basics, including vectors, matrices, eigenvalues, singular values, and least squares. Covers the basics in optimization including convex optimization, linear/quadratic programming, gradient descent, and regularization, building on insights from linear algebra. Explores a variety of applications in science and engineering, where the tools developed give powerful ways to understand complex systems and also extract structure from data.
6.C06
6.C06 Linear Algebra and Optimization
(
)
Prereqs: GIR:CAL2
Units: 5-0-7Introductory course in linear algebra and optimization, assuming no prior exposure to linear algebra and starting from the basics, including vectors, matrices, eigenvalues, singular values, and least squares. Covers the basics in optimization including convex optimization, linear/quadratic programming, gradient descent, and regularization, building on insights from linear algebra. Explores a variety of applications in science and engineering, where the tools developed give powerful ways to understand complex systems and also extract structure from data.
One of14.30
14.30 Introduction to Statistical Methods in Economics,
(
)
Prereqs: GIR:CAL2
Units: 4-0-8Self-contained introduction to probability and statistics with applications in economics and the social sciences. Covers elements of probability theory, statistical estimation and inference, regression analysis, causal inference, and program evaluation. Couples methods with applications and with assignments involving data analysis. Uses basic calculus and matrix algebra. Students taking graduate version complete additional assignments. May not count toward HASS requirement.
18.600 18.600 Probability and Random Variables,
(
,
)
Prereqs: GIR:CAL2
Units: 4-0-8Probability spaces, random variables, distribution functions. Binomial, geometric, hypergeometric, Poisson distributions. Uniform, exponential, normal, gamma and beta distributions. Conditional probability, Bayes theorem, joint distributions. Chebyshev inequality, law of large numbers, and central limit theorem. Credit cannot also be received for 6.041A or 6.041B.
6.37006.041 6.3700 Introduction to Probability
(
,
)
Prereqs: GIR:CAL2
Units: 4-0-8An introduction to probability theory, the modeling and analysis of probabilistic systems, and elements of statistical inference. Probabilistic models, conditional probability. Discrete and continuous random variables. Expectation and conditional expectation, and further topics about random variables. Limit Theorems. Bayesian estimation and hypothesis testing. Elements of classical statistical inference. Bernoulli and Poisson processes. Markov chains. Students taking graduate version complete additional assignments.
6.12006.042 6.1200 Mathematics for Computer Science
(
,
)
Prereqs: GIR:CAL1
Units: 5-0-7Elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science. Topics include logical notation, sets, relations, elementary graph theory, state machines and invariants, induction and proofs by contradiction, recurrences, asymptotic notation, elementary analysis of algorithms, elementary number theory and cryptography, permutations and combinations, counting tools, and discrete probability.
-
Five computation and algorithms subjects:
One of6.1000 6.1000 Introduction to Programming and Computer Science,
(
,
)
Prereqs: none
Units: 3-0-9Develops foundational skills in programming and in computational modeling. Covers widely used programming concepts in Python, including mutability, function objects, and object-oriented programming. Introduces algorithmic complexity and some common libraries. Throughout, demonstrates using computation to help understand real-world phenomena; topics include optimization problems, building simulations, and statistical modeling. Intended for students with at least some prior exposure to programming. Students with no programming experience are encouraged to take 6.100A and 6.100B (or 16.C20) over two terms.
6.100A6.0001 6.100A Introduction to Computer Science Programming in Python,
(
,
)
Prereqs: none
Units: 2-0-4Introduction to computer science and programming. Students develop skills to program and use computational techniques to solve problems. Topics include: the notion of computation, Python, simple algorithms and data structures, object-oriented programming, testing and debugging, and algorithmic complexity. Lectures are viewed outside of class; in-class time is dedicated to problem-solving and discussion. Combination of 6.100A and 6.100B (or 16.C20) counts as REST subject.
6.100A6.0001 6.100A Introduction to Computer Science Programming in Python&
(
,
)
Prereqs: none
Units: 2-0-4Introduction to computer science and programming. Students develop skills to program and use computational techniques to solve problems. Topics include: the notion of computation, Python, simple algorithms and data structures, object-oriented programming, testing and debugging, and algorithmic complexity. Lectures are viewed outside of class; in-class time is dedicated to problem-solving and discussion. Combination of 6.100A and 6.100B (or 16.C20) counts as REST subject.
6.100B6.0002 6.100B Introduction to Computational Thinking and Data Science
(
,
)
Prereqs: 6.100A or permission of instructor
Units: 2-0-4Provides an introduction to using computation to build models that can be used to help understand real-world phenomena. Topics include optimization problems, simulation models, and statistical models. Requires experience programming in Python as a prerequisite. Combination of 6.100A and 6.100B counts as REST subject.
One of6.12106.006 6.1210 Introduction to Algorithms
(
,
)
Prereqs: 6.100A and (6.1200 or (6.120A and (6.3700, 6.3800, 18.05, or 18.600)))
Units: 5-0-7Introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. Emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. Enrollment may be limited.
6.12206.046 6.1220 Design and Analysis of Algorithms
(
,
)
Prereqs: 6.1200 and 6.1210
Units: 4-0-8Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.
One of6.39006.036 6.3900 Introduction to Machine Learning,
(
,
)
Prereqs: (6.1010 or 6.1210) and (18.03, 18.06, 18.700, or 18.C06)
Units: 4-0-8Introduction to the principles and algorithms of machine learning from an optimization perspective. Topics include linear and non-linear models for supervised, unsupervised, and reinforcement learning, with a focus on gradient-based methods and neural-network architectures. Previous experience with algorithms may be helpful.
6.C01
6.C01 Modeling with Machine Learning: from Algorithms to Applications&
(
)
Prereqs/[Coreqs]: GIR:CAL2 and 6.100A; [1.C01, 2.C01, 3.C01, 6.C011, 7.C01, 15.C01, or 22.C01]
Units: 2-0-4Focuses on modeling with machine learning methods with an eye towards applications in engineering and sciences. Introduction to modern machine learning methods, from supervised to unsupervised models, with an emphasis on newer neural approaches. Emphasis on the understanding of how and why the methods work from the point of view of modeling, and when they are applicable. Using concrete examples, covers formulation of machine learning tasks, adapting and extending methods to given problems, and how the methods can and should be evaluated. Students taking graduate version complete additional assignments. Students cannot receive credit without completion of a 6-unit disciplinary module in the same semester.
6.C011
6.C011 Modeling with Machine Learning for Computer Science
(
)
Prereqs: 6.100A, 6.C01, (6.1200 or 6.3700), and (18.06 or 18.C06)
Units: 3-0-3Focuses on in-depth modeling of engineering tasks as machine learning problems. Emphasizes framing, method design, and interpretation of results. In comparison to broader prerequisite 6.C01, this project-oriented subject consists of deep dives into select technical areas or engineering tasks involving both supervised and exploratory uses of machine learning. Explores technical areas such robustness, interpretability, fairness and engineering tasks such as recommender systems, performance optimization, and automated design. Students taking graduate version complete additional assignments. Students cannot receive credit without completion of the core subject 6.C01. Enrollment may be limited.
-
Three economics subjects:
One of14.01 14.01 Principles of Microeconomics,
(
,
)
Prereqs: none
Units: 3-0-9Introduces microeconomic concepts and analysis, supply and demand analysis, theories of the firm and individual behavior, competition and monopoly, and welfare economics. Applications to problems of current economic policy.
14.03 14.03 Microeconomic Theory and Public Policy
(
,
)
Prereqs: 14.01 or permission of instructor
Units: 4-0-8Students master and apply economic theory, causal inference, and contemporary evidence to analyze policy challenges. These include the effect of minimum wages on employment, the value of healthcare, the power and limitations of free markets, the benefits and costs of international trade, the causes and remedies of externalities, the consequences of adverse selection in insurance markets, the impacts of labor market discrimination, and the application of machine learning to supplement to decision-making. Class attendance and participation are mandatory. Students taking graduate version complete additional assignments.
14.32 14.32 Econometric Data Science
(
,
)
Prereqs: 14.30, 15.069, or 18.650
Units: 4-4-4Introduces regression and other tools for causal inference and descriptive analysis in empirical economics. Topics include analysis of randomized experiments, instrumental variables methods and regression discontinuity designs, differences-in-differences estimation, and regression with time series data. Develops the skills needed to conduct — and critique — empirical studies in economics and related fields. Empirical applications are drawn from published examples and frontier research. Familiarity with statistical programming languages is helpful. Students taking graduate version complete an empirical project leading to a short paper. No listeners. Limited to 70 total for versions meeting together.
One of -
One computer science elective subject:
-
Three economics elective subjects:
-
One communication-intensive subject:
15.276 15.276 Communicating with Data,
(
,
)
Prereqs: none
Units: 3-0-9Equips students with the strategies, tactics, and tools to use quantitative information to inform and persuade others. Emphasizes effective communication skills as the foundation of successful careers. Develops the skills to communicate quantitative information in a business context to drive people and organizations toward better decisions. Focuses heavily on the cycle of practicing, reflecting, and revising. Students receive extensive, personalized feedback from teaching team and classmates. Limited to 25; priority to 15-2 and 6-14 majors.
6.UAR 6.UAR Seminar in Undergraduate Advanced Research,
(
,
)
Prereqs: Permission of instructor
Units: 2-0-4Instruction in effective undergraduate research, including choosing and developing a research topic, surveying previous work and publications, research topics in EECS and the School of Engineering, industry best practices, design for robustness, technical presentation, authorship and collaboration, and ethics. Students engage in extensive written and oral communication exercises, in the context of an approved advanced research project. A total of 12 units of credit is awarded for completion of the fall and subsequent spring term offerings. Application required; consult EECS SuperUROP website for more information.
6.UAT 6.UAT Oral Communication
(
,
)
Prereqs: none
Units: 3-0-6Provides instruction in aspects of effective technical oral presentations and exposure to communication skills useful in a workplace setting. Students create, give and revise a number of presentations of varying length targeting a range of different audiences. Enrollment may be limited.
-
Two Economics advanced subjects subjects:
Two from the ECON_AAGS list
-
Two Economics/EECS advanced subjects subjects:
Two from the ECONEECS_AAGS list
-
Two Econ Math Restricted Elective subjects:
Two from the Econ Math Restricted Electives list
-
One Professional Perspective subject:
6.98306.997 6.9830 Professional Perspective Internship,
(
,
,
,
)
Prereqs: none
Units: 0-1-0Required for Course 6 MEng students to gain professional experience in electrical engineering or computer science through an internship (industry, government, or academic) of 4 or more weeks in IAP or summer. This can be completed as MEng students or as undergrads, through previous employment completed while deferring MEng entry or by attending a series of three colloquia, seminars, or technical talks related to their field. For internships/work experience, a letter from the employer confirming dates of employment is required. All students are required to write responses to short essay prompts about their professional experience. International students must consult ISO and the EECS Undergraduate Office on work authorization and allowable employment dates.
6.98706.951 6.9870 Graduate 6-A Internship,
(
,
,
)
Prereqs: 6.9850 or 6.9860
Units: 0-12-0Provides academic credit for a graduate assignment of graduate 6-A students at companies affiliated with the department's 6-A internship program. Limited to graduate students participating in the 6-A internship program.
6.98806.952 6.9880 Graduate 6-A Internship
(
,
,
)
Prereqs: 6.9870
Units: 0-12-0Provides academic credit for graduate students in the second half of their 6-A MEng industry internship. Limited to graduate students participating in the 6-A internship program.
-
One Masters Thesis subject:
- You must follow these requirements
- Includes subjects as of Spring 2026
- Each completed subject can only be used to satisfy at most one required subject but can be used to satisfy multiple additional constraints.
-
: only offered fall term
: only offered spring term
grey: not offered this academic year. - If your primary major is 6-14, at most three of your economics subjects may count toward the eight-subject HASS requirement.
- 16.0002/18.0002/CSE.01 are acceptable alternatives to 6.0002
Subject Lists
ECONDS: Economics electives in data scienceECONEECS_AAGS: Approved advanced subjects in EECS/ECON
ECONTH: Economics electives in theory
ECON_AAGS: Approved advanced subjects in Economics
Econ Math Restricted Electives:
-
At most one from
(
,
)Prereqs: 6.3700 or 18.600
Units: 4-0-8
A rapid introduction to the theoretical foundations of statistical methods that are useful in many applications. Covers a broad range of topics in a short amount of time with the goal of providing a rigorous and cohesive understanding of the modern statistical landscape. Mathematical language is used for intuition and basic derivations but not proofs. Main topics include: parametric estimation, confidence intervals, hypothesis testing, Bayesian inference, and linear and logistic regression. Additional topics may include: causal inference, nonparametric estimation, and classification.

(
)Prereqs: GIR:CAL2 or permission of instructor
Units: 4-4-4
Introduces probabilistic modeling for problems of inference and machine learning from data, emphasizing analytical and computational aspects. Distributions, marginalization, conditioning, and structure, including graphical and neural network representations. Belief propagation, decision-making, classification, estimation, and prediction. Sampling methods and analysis. Introduces asymptotic analysis and information measures. Computational laboratory component explores the concepts introduced in class in the context of contemporary applications. Students design inference algorithms, investigate their behavior on real data, and discuss experimental results.
At most one from

(
)Prereqs: GIR:CAL2 and (18.03 or 18.032)
Units: 4-0-8
Complex algebra and functions; analyticity; contour integration, Cauchy's theorem; singularities, Taylor and Laurent series; residues, evaluation of integrals; multivalued functions, potential theory in two dimensions; Fourier analysis, Laplace transforms, and partial differential equations.

(
)Prereqs: GIR:CAL2 and 18.03
Units: 3-0-9
Covers functions of a complex variable; calculus of residues. Includes ordinary differential equations; Bessel and Legendre functions; Sturm-Liouville theory; partial differential equations; heat equation; and wave equations. Students in Courses 6, 8, 12, 18, and 22 must register for undergraduate version, 18.075.
At most one from
(
,
)Prereqs: GIR:CAL2
Units: 3-0-9
Covers fundamentals of mathematical analysis: convergence of sequences and series, continuity, differentiability, Riemann integral, sequences and series of functions, uniformity, interchange of limit operations. Shows the utility of abstract concepts and teaches understanding and construction of proofs. Proofs and definitions are less abstract than in 18.100B. Gives applications where possible. Concerned primarily with the real line. Students in Course 18 must register for undergraduate version 18.100A.
(
,
)Prereqs: GIR:CAL2
Units: 3-0-9
Covers fundamentals of mathematical analysis: convergence of sequences and series, continuity, differentiability, Riemann integral, sequences and series of functions, uniformity, interchange of limit operations. Shows the utility of abstract concepts and teaches understanding and construction of proofs. More demanding than 18.100A, for students with more mathematical maturity. Places more emphasis on point-set topology and n-space. Students in Course 18 must register for undergraduate version 18.100B.
Any of
(
,
,
)Prereqs: GIR:CAL2 and (18.03 or 18.032)
Units: 3-0-9
Review of linear algebra, applications to networks, structures, and estimation, finite difference and finite element solution of differential equations, Laplace's equation and potential flow, boundary-value problems, Fourier series, discrete Fourier transform, convolution. Frequent use of MATLAB in a wide range of scientific and engineering applications. Students in Course 18 must register for the undergraduate version, 18.085.

(
)Prereqs: GIR:CAL2 and (18.03 or 18.032)
Units: 3-0-9
Initial value problems: finite difference methods, accuracy and stability, heat equation, wave equations, conservation laws and shocks, level sets, Navier-Stokes. Solving large systems: elimination with reordering, iterative methods, preconditioning, multigrid, Krylov subspaces, conjugate gradients. Optimization and minimum principles: weighted least squares, constraints, inverse problems, calculus of variations, saddle point problems, linear programming, duality, adjoint methods. Students in Course 18 must register for the undergraduate version, 18.086.

(
)Prereqs/[Coreqs]: [18.06]
Units: 3-0-9
Study of illustrative topics in discrete applied mathematics, including probability theory, information theory, coding theory, secret codes, generating functions, and linear programming.

(
)Prereqs: GIR:CAL2 and (18.03 or 18.032)
Units: 3-0-9
Basic techniques for the efficient numerical solution of problems in science and engineering. Root finding, interpolation, approximation of functions, integration, differential equations, direct and iterative methods in linear algebra. Knowledge of programming in a language such as MATLAB, Python, or Julia is helpful.

(
)Prereqs: GIR:CAL2
Units: 3-0-9
Vector spaces, systems of linear equations, bases, linear independence, matrices, determinants, eigenvalues, inner products, quadratic forms, and canonical forms of matrices. More emphasis on theory and proofs than in 18.06.

(
)Prereqs: none
Units: 3-0-9
An elementary introduction to number theory with no algebraic prerequisites. Primes, congruences, quadratic reciprocity, diophantine equations, irrational numbers, continued fractions, partitions.
