The MIT CDO Curriculum
The CDO program is designed with a common core that serves all engineering disciplines, and an elective component that focuses on particular applications. Students must complete coursework distributed as described below (F = course offered in Fall semester; S = course offered in Spring semester).
CDO Academic Requirements
Core Subjects (3 courses / 36 units)
Students are required to take three of four core subjects designed to provide foundation materials needed for the study of more advanced elective topics. The core subjects are chosen from the following:
Restricted Electives (2 courses / 24 units)
Students choose two H-level electives from a list of specialized subjects that have computational themes and related components, and that are aligned with the program's educational mission. The following is a current list of the eligible elective subjects (subjects may be added to the list over time):
- 1.124J/2.091J/ESD.51J Software
and Computation for Simulation (F)
- 1.270J/ESD.273J Logistics and Supply Chain Management (F)
- 1.723 Computational Methods for Flow in Porous Media (S)
- 2.089J/1.128J Computational Geometry (S; not offered in 2012-13)
- 2.093 Finite Element Analysis of Solids and Fluids I (F)
- 2.094 Finite Element Analysis of Solids and Fluids II (S)
- 2.29 Numerical Fluid Mechanics (F)
- 3.320 Atomistic Computer Modeling of Materials (S; not offered in 2011-12)
- 6.231 Dynamic Programming and Stochastic Control (F)
- 6.251J/15.081J Introduction to Mathematical Programming (F)
- 6.252J/15.084J Nonlinear Programming (S)
- 6.256 Algebraic Techniques and Semidefinite Optimization (S; not offered in 2012-13)
- 6.581J/20.482J Foundations of Algorithms and Computational Techniques in Systems Biology (S; not offered in 2011-12)
- 6.673 Introduction to Numerical Simulation in Electrical Engineering (S; not offered in 2012-13)
- 6.855J/15.082J/ESD.78J Network Optimization (F; not offered in 2011-12)
- 10.557 Mixed-integer and Nonconvex Optimization (S)
- 15.062J/ESD.754J Data Mining:
Finding the Data and Models that Create Value (F; second half of term; Sloan bidding process required)
- 15.070J/6.265J Advanced Stochastic Processes (F; not offered in 2011-12)
- 15.077J/ESD.753J Statistical Learning and Data Mining (S)
- 15.083J/6.859J Integer Programming and Combinatorial Optimization (F; not offered in 2011-12; Sloan bidding process required)
- 15.764 Theory of Operations Management (F, S; Sloan bidding process required)
- 16.225J/2.099J Computational Mechanics of Materials (S)
- 16.413 Principles of Autonomy and Decision Making (F)
- 16.888J/ESD.77J Multidisciplinary System Design Optimization (S)
- 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations (S; not offered in 2011-12)
- 16.940 Numerical Methods for Stochastic Modeling and Inference (S; not offered in 2012-13)
- 18.085 Computational Science and Engineering I (F, S)
- 18.086 Computational Science and Engineering II (S)
- 18.337J/6.338J Parallel Computing (F)
- 18.369 Mathematical Methods in Nanophotonics (S; not offered in 2012-13)
- 22.53 Statistical Processes and Atomistic Simulations (F; not offered in 2012-13)
Unrestricted Elective (1 course / 12 units)
Students may choose any graduate-level (H or G) 12-unit subject from the MIT Subject Listing and Schedule.
Thesis (36 units)
Students write a master's thesis under the supervision of a faculty advisor.
Timetable
The CDO program is designed so that students who are either self-supported or on fellowship can complete the program in 12-18 months. Students supported by research assistant or teaching assistant funds should allow two years to complete the program.
(top of page)
