Electrical Engineering Computer Science

DEPARTMENT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE
DEPARTMENT OF ELECTRICAL ENGINEERING

AND COMPUTER SCIENCE Undergraduate Study
For MIT undergraduates, the Department of Electrical Engineering
Electrical engineers and computer scientists are everywhere and Computer Science oers several programs leading to the
—in industry and research areas as diverse as computer and Bachelor of Science. Students in 6-1, 6-2, 6-3, 6-4, 6-7, 6-9, or 6-14
communication networks, electronic circuits and systems, may also apply for one of the Master of Engineering programs oered
lasers and photonics, semiconductor and solid-state devices, by the department, which require an additional year of study for the
nanoelectronics, biomedical engineering, computational biology, simultaneous award of both the bachelor’s and master’s degrees.
articial intelligence, robotics, design and manufacturing, control
and optimization, computer algorithms, games and graphics, Bachelor of Science in Electrical Science and Engineering (Course
soware engineering, computer architecture, cryptography and 6-1)
computer security, power and energy systems, nancial analysis, The 6-1 program (http://catalog.mit.edu/degree-charts/electrical-
and many more. The infrastructure and fabric of the information science-engineering-course-6-1) leads to the Bachelor of Science in
age, including technologies such as the internet and the web, Electrical Science and Engineering. The program starts with three
search engines, cell phones, high-denition television, and foundation courses in circuits, signal processing, and computer
magnetic resonance imaging, are largely the result of innovations architecture. Those are followed by specialization in three header
in electrical engineering and computer science. The Department subjects chosen from signals, nanoelectronics, electromagnetics,
of Electrical Engineering and Computer Science (EECS) (http:// neurophysiology, or machine learning; two advanced undergraduate
www.eecs.mit.edu) at MIT and its graduates have been at the subjects; and two elective subjects from an extensive set of
forefront of a great many of these advances. Current work in the possibilities.
department holds promise of continuing this record of innovation
and leadership, in both research and education, across the full Bachelor of Science in Electrical Engineering and Computer
spectrum of departmental activity. Science (Course 6-2)
The 6-2 program (http://catalog.mit.edu/degree-charts/electrical-
The career paths and opportunities for EECS graduates cover a wide
engineering-computer-science-course-6-2) leads to the Bachelor of
range and continue to grow: fundamental technologies, devices,
Science in Electrical Engineering and Computer Science and is for
and systems based on electrical engineering and computer science
students whose interests focus on creating systems that interface
are pervasive and essential to improving the lives of people around
with the world, digital design and computer architecture, and control
the world and managing the environments they live in. The basis for
systems. The degree has a required foundation of 4.5 subjects in
the success of EECS graduates is a deep education in engineering
basic mathematics, programming, and algorithms. Students build
principles, built on mathematical, computational, physical, and
on these fundamental subjects with 3 core system design subjects
life sciences, and exercised with practical applications and project
encompassing the discipline, along with an integrative system
experiences in a wide range of areas. Our graduates have also
design laboratory class. There are then four subjects drawn from a
demonstrated over the years that EECS provides a strong foundation
range of application tracks, one communication-intensive subject,
for those whose work and careers develop in areas quite removed
and one additional elective.
from their origins in engineering.
Undergraduate students in the department take core subjects that Bachelor of Science in Computer Science and Engineering
introduce electrical engineering and computer science, and then (Course 6-3)
systematically build up broad foundations and depth in selected The 6-3 program (http://catalog.mit.edu/degree-charts/computer-
intellectual theme areas that match their individual interests. science-engineering-course-6-3) leads to the Bachelor of Science
Laboratory subjects, independent projects, and research provide in Computer Science and Engineering and is designed for students
engagement with principles and techniques of analysis, design, and whose interests focus on soware, computer systems, and
experimentation in a variety of elds. The department also oers theoretical computer science. The degree has a required core of 2.5
a range of programs that enable students to gain experience in subjects in programming, 2.5 subjects in systems, and 3 subjects
industrial settings, ranging from collaborative industrial projects in algorithmic thinking and theory, along with a math subject in
done on campus to term-long experiences at partner companies. either linear algebra or probability and statistics. Students then take
two upper-level courses in each of two specialized tracks, including
Graduate study in the department moves students toward mastery computer architecture, human-computer interaction, programming
of areas of individual interest, through coursework and signicant tools and techniques, computer systems, or theory. 6-3 students
research, oen dened in interdisciplinary areas that take advantage may alternatively choose an electrical engineering track from the 6-2
of the tremendous range of faculty expertise in the department and, degree, or an articial intelligence and decision-making track from
more broadly, across MIT. the 6-4 degree.
Department of Electrical Engineering and Computer Science | 3

program is for students who wish to specialize in computer science,

Bachelor of Science in Articial Intelligence and Decision Making economics, and data science. It is designed to equip students
(Course 6-4) with a foundational knowledge of economic analysis, computing,
The 6-4 program (http://catalog.mit.edu/degree-charts/artical- optimization, and data science, as well as hands-on experience with
intelligence-decision-making-course-6-4) leads to the Bachelor empirical analysis of economic data. Students take eight subjects
of Science in Articial Intelligence and Decision Making and is that provide a mathematical, computational, and algorithmic basis
designed for students whose interests focus on algorithms for for the major. Students then take two subjects in data science, two
learning and reasoning, applications of articial intelligence, in intermediate economics, and three elective subjects from data
and connections to natural cognition. The degree has a required science and economics theory. Additional information about the 6-14
foundation of 5.5 subjects in basic mathematics and computer program (http://catalog.mit.edu/interdisciplinary/undergraduate-
science; a breadth requirement of 5 subjects covering data, model, programs/degrees/computer-science-economics-data-science) can
decision, computation, and human-centric areas; two subjects drawn be found in the section Interdisciplinary Programs.
from applications or other advanced material; one additional breadth
subject; and one additional communications-intensive subject. Bachelor of Science in Urban Science and Planning with
Computer Science (Course 11-6)
Bachelor of Science in Computer Science and Molecular Biology The 11-6 program (http://catalog.mit.edu/degree-charts/urban-
(Course 6-7) science-planning-computer-science-11-6) leads to the Bachelor of
The 6-7 program (http://catalog.mit.edu/degree-charts/computer- Science in Urban Science and Planning with Computer Science. This
science-molecular-biology-course-6-7) leads to the Bachelor program, oered jointly by the Department of Electrical Engineering
of Science in Computer Science and Molecular Biology. Oered and Computer Science and the Department of Urban Studies and
jointly by the Department of Electrical Engineering and Computer Planning (Course 11), is for students who wish to specialize in urban
Science and the Department of Biology (Course 7), the program science and planning with computer science. Additional information
is for students who wish to specialize in computer science and about the 11-6 program (http://catalog.mit.edu/interdisciplinary/
molecular biology. Students begin with introductory courses in undergraduate-programs/degrees/urban-science-planning-
math, chemistry, programming, and lab skills. They then build computer-science) can be found in the section Interdisciplinary
on these skills with ve courses in algorithms and biology, which Programs.
lead to a choice of electives in biology, with a particular focus on
computational biology. Additional information about the 6-7 program Minor in Computer Science
(http://catalog.mit.edu/interdisciplinary/undergraduate-programs/ The department oers a Minor in Computer Science. The minor
degrees/computer-science-molecular-biology) can be found in the provides students with both depth and breadth in the eld, as well
section Interdisciplinary Programs. as the opportunity to explore areas of their own interest.
Bachelor of Science in Computation and Cognition (Course 6-9) To complete the minor, students must take at least six subjects (six-
The 6-9 program (http://catalog.mit.edu/degree-charts/ unit subjects count as half-subjects) totaling at least 72 units from
computation-cognition-6-9) leads to the Bachelor of Science in the lists below, including:
Computation and Cognition. Oered jointly by the Department of • at least one soware-intensive subject, and
Electrical Engineering and Computer Science and the Department
• one algorithms-intensive subject at either the basic or advanced
of Brain and Cognitive Sciences (Course 9), the program focuses on
level.
the emerging eld of computational and engineering approaches
to brain science, cognition, and machine intelligence. It is designed Introductory Level
to give students access to foundational and advanced material
Select up to 12 units of the following: 12
in electrical engineering and computer science, as well as in the
6.100A Introduction to Computer Science
architecture, circuits, and physiology of the brain. Additional
Programming in Python
information about the 6-9 program (http://catalog.mit.edu/
interdisciplinary/undergraduate-programs/degrees/computation- 6.100B Introduction to Computational
cognition) can be found in the section Interdisciplinary Programs. Thinking and Data Science
6.3400 Introduction to EECS via
Bachelor of Science in Computer Science, Economics, and Data Communication Networks
Science (Course 6-14) 6.9010 Introduction to EECS via
The 6-14 program (http://catalog.mit.edu/degree-charts/computer- Interconnected Embedded Systems
science-economics-data-science-course-6-14) leads to the Bachelor 6.9080 Introduction to EECS via Robotics
of Science in Computer Science, Economics, and Data Science.
Basic Level
Oered jointly by the Department of Electrical Engineering and
Select up to 63 units of the following: 63
Computer Science and the Department of Economics (Course 14), this
4 | Department of Electrical Engineering and Computer Science

6.1200[J] Mathematics for Computer Science 6.4550[J] Interactive Music Systems

6.1910 Computation Structures 6.5081 Multicore Programming
6.3700 Introduction to Probability
6.3800 Introduction to Inference Inquiries
Additional information about the department’s undergraduate
6.4100 Articial Intelligence
programs may be obtained from the EECS Undergraduate Oce
18.200 Principles of Discrete Applied
([email protected]), Room 38-476, 617-253-7329.
Mathematics
18.200A Principles of Discrete Applied
Mathematics Graduate Study
18.211 Combinatorial Analysis
Algorithms-intensive Master of Engineering
6.1210 Introduction to Algorithms The Department of Electrical Engineering and Computer Science
permits qualied MIT undergraduate students to apply for one of
Soware-intensive
three Master of Engineering (MEng) programs. These programs
6.1010 Fundamentals of Programming
consist of an additional, h year of study beyond one of the
Advanced Level Bachelor of Science programs oered by the department.
Select at least 12 units of the following: 12
Recipients of a Master of Engineering degree normally receive a
6.1220[J] Design and Analysis of Algorithms
Bachelor of Science degree simultaneously. No thesis is explicitly
6.1400[J] Computability and Complexity Theory
required for the Bachelor of Science degree. However, every program
6.1800 Computer Systems Engineering must include a major project experience at an advanced level,
6.3730[J] Statistics, Computation and culminating in written and oral reports.
Applications
The Master of Engineering degree also requires completion of 24
6.3900 Introduction to Machine Learning
units of thesis credit under 6.THM Master of Engineering Program
6.4120[J] Computational Cognitive Science
Thesis. While a student may register for more than this number of
6.4400 Computer Graphics thesis units, only 24 units count toward the degree requirement.
6.4530[J] Principles and Practice of Assistive Adjustments to the department requirements are made on an
Technology individual basis when it is clear that a student would be better
6.5151 Large-scale Symbolic Systems served by a variation in the requirements because of their strong
6.5831 Database Systems prior background.
6.8301 Advances in Computer Vision Programs leading to the ve-year Master of Engineering degree or
6.8371 Digital and Computational to the four-year Bachelor of Science degrees can easily be arranged
Photography to be identical through the junior year. At the end of the junior
6.8611 Quantitative Methods for Natural year, students with strong academic records may apply to continue
Language Processing through the ve-year master’s program. Admission to the Master
6.8701 Computational Biology: Genomes, of Engineering program is open only to undergraduate students
Networks, Evolution who have completed their junior year in the Department of Electrical
Engineering and Computer Science at MIT. Students with other
6.8711[J] Computational Systems Biology:
preparation seeking a master’s level experience in EECS at MIT
Deep Learning in the Life Sciences
should see the Master of Science program described later in this
18.404 Theory of Computation
section.
Algorithms-intensive
6.1220[J] Design and Analysis of Algorithms A student in the Master of Engineering program must be registered
as a graduate student for at least one regular (non-summer) term.
Soware-intensive
To remain in the program and to receive the Master of Engineering
6.1020 Soware Construction
degree, students will be expected to maintain strong academic
6.1040 Soware Design records.
6.1060 Soware Performance Engineering
Four MEng programs are available:
6.1100 Computer Language Engineering
6.1920 Constructive Computer Architecture • The Master of Engineering in Electrical Engineering and Computer
6.4200[J] Robotics: Science and Systems Science (6-P) program is intended to provide the depth of

knowledge and the skills needed for advanced graduate study engaged. Since a continuing liaison between the companies
and for professional work, as well as the breadth and perspective and faculty of the department is maintained, students receive
essential for engineering leadership in an increasingly complex assignments of progressive responsibility and sophistication that are
technological world. usually more professionally rewarding than typical summer jobs.
• The 6-A Master of Engineering Thesis Program with Industry
The 6-A program is primarily designed to work in conjunction with
combines the Master of Engineering academic program with
the department's ve-year Master of Engineering degree program.
periods of industrial practice at aliated companies. An
Internship students generally complete three assignments with their
undergraduate wishing to pursue this degree should initially
cooperating company—usually two summers and one regular term.
register for one of the department’s three bachelor’s programs.
While on 6-A assignment, students receive pay from the participating
• The Department of Electrical Engineering and Computer Science company as well as academic credit for their work. During their
jointly oers a Master of Engineering in Computer Science and graduate year, 6-A students generally receive a 6-A fellowship or a
Molecular Biology (6-7P) with the Department of Biology (Course research or teaching assistantship to help pay for the graduate year.
7). This program is modeled on the 6-P program, but provides
additional depth in computational biology through coursework The department conducts a fall recruitment during which juniors who
and a substantial thesis. wish to work toward an industry-based Master of Engineering thesis
• The Department of Electrical Engineering and Computer Science may apply for admission to the 6-A program. Acceptance of a student
jointly oers a Master of Engineering in Computation and into the program cannot be guaranteed, as openings are limited.
Cognition (6-9P) with the Department of Brain and Cognitive At the end of their junior year, most 6-A students can apply for
Sciences (Course 9). This program builds on the Bachelor of admission to 6-PA, which is the 6-A version of the department's ve-
Science in Computation and Cognition, providing additional year 6-P Master of Engineering degree program. 6-PA students do
depth in the subject areas through advanced coursework and a their Master of Engineering thesis at their participating company's
substantial thesis. facilities. They can apply up to 24 units of work-assignment credit
toward their Master of Engineering degree. The rst 6-A assignment
Master of Engineering in Electrical Engineering and Computer may be used for the advanced undergraduate project that is required
Science (Course 6-P) for award of a bachelor's degree, by including a written report and
Through a seamless, ve-year course of study, the Master of obtaining approval by a faculty member.
Engineering in Electrical Engineering and Computer Science At the conclusion of their program, 6-A students are not obliged to
(6-P) (http://catalog.mit.edu/degree-charts/master-electrical- accept employment with the company, nor is the company obliged to
engineering-computer-science-course-6-p) program leads directly oer such employment.
to the simultaneous awarding of the Master of Engineering and
one of the three bachelor’s degrees oered by the department. Additional information about the program is available at the 6-A
The 6-P program is intended to provide the skills and depth of Oce, Room 38-409E, 617-253-4644.
knowledge in a selected eld of concentration needed for advanced
graduate study and for professional work, as well as the breadth and Master of Engineering in Computer Science and Molecular
perspective essential for engineering leadership in an increasingly Biology (Course 6-7P)
complex technological world. The student selects 42 units from a The Departments of Biology and Electrical Engineering and Computer
list of subjects approved by the Graduate Oce; these subjects, Science jointly oer a Master of Engineering in Computer Science
considered along with the two advanced undergraduate subjects and Molecular Biology (6-7P) (http://catalog.mit.edu/degree-charts/
from the bachelor’s program, must include at least 36 units in an master-computer-science-molecular-biology-course-6-7p). A detailed
area of concentration. A further 24 units of electives are chosen description of the program (http://catalog.mit.edu/interdisciplinary/
from a restricted departmental list of mathematics, science, and graduate-programs/computer-science-molecular-biology)
engineering subjects. requirements may be found under the section on Interdisciplinary
Programs.
Master of Engineering Thesis Program with Industry (Course 6-A)
The 6-A Master of Engineering Thesis Program with Industry (http:// Master of Engineering in Computation and Cognition (Course
vi-a.mit.edu) enables students to combine classroom studies with 6-9P)
practical experience in industry through a series of supervised work The Departments of Brain and Cognitive Sciences and Electrical
assignments at one of the companies or laboratories participating Engineering and Computer Science jointly oer a Master of
in the program, culminating with a Master of Engineering thesis Engineering in Computation and Cognition (6-9P) (http://
performed at a 6-A member company. Collectively, the participating catalog.mit.edu/degree-charts/master-computation-cognition-
companies provide a wide spectrum of assignments in the various course-6-9p). A detailed description of the program (http://
elds of electrical engineering and computer science, as well as an catalog.mit.edu/interdisciplinary/graduate-programs/computation-
exposure to the kinds of activities in which engineers are currently

cognition) requirements may be found under the section on VLSI system design and technology; nanoelectronics; bioelectrical
Interdisciplinary Programs. engineering; and computational biology.
Master of Computer Science, Economics, and Data Science In addition to graduate subjects in electrical engineering and
(Course 6-14P) computer science, many students nd it protable to study subjects
The Department of Electrical Engineering and Computer Science and in other departments such as Biology, Brain and Cognitive Sciences,
the Department of Economics jointly oer a Master of Engineering in Economics, Linguistics and Philosophy, Management, Mathematics,
Computer Science, Economics, and Data Science (6-14P). A detailed and Physics.
description of the program requirements (http://catalog.mit.edu/ The informal seminar is an important mechanism for bringing
interdisciplinary/graduate-programs/computer-science-economics- together members of the various research groups. Numerous
data-science) can be found in the Interdisciplinary Programs section. seminars meet every week. In these, graduate students, faculty, and
visitors report their research in an atmosphere of free discussion and
Predoctoral and Doctoral Programs criticism. These open seminars are excellent places to learn about
The programs of education oered by the Department of Electrical the various research activities in the department.
Engineering and Computer Science at the doctoral and predoctoral
level have three aspects. First, a variety of classroom subjects Research activities in electrical engineering and computer
in physics, mathematics, and fundamental elds of electrical science are carried on by students and faculty in laboratories
engineering and computer science is provided to permit students of extraordinary range and strength, including the Laboratory
to develop strong scientic backgrounds. Second, more specialized for Information and Decision Systems, Research Laboratory of
classroom and laboratory subjects and a wide variety of colloquia Electronics, Computer Science and Articial Intelligence Laboratory,
and seminars introduce the student to the problems of current Laboratory for Energy and the Environment (see MIT Energy
interest in many elds of research, and to the techniques that may Initiative), Kavli Institute for Astrophysics and Space Research,
be useful in attacking them. Third, each student conducts research Lincoln Laboratory, Materials Research Laboratory, MIT Media Lab,
under the direct supervision of a member of the faculty and reports Francis Bitter Magnet Laboratory, Operations Research Center,
the results in a thesis. Plasma Science and Fusion Center, and the Microsystems Technology
Laboratories. Descriptions of many of these laboratories (http://
Three advanced degree programs are oered in addition to the catalog.mit.edu/mit/research) may be found under the section
Master of Engineering program described above. A well-prepared on Research and Study.
student with a bachelor's degree in an appropriate eld from some
school other than MIT (or from another department at MIT) normally Because the backgrounds of applicants to the department's doctoral
requires about one and one-half to two years to complete the and predoctoral programs are extremely varied, both as to eld
formal studies and the required thesis research in the Master of (electrical engineering, computer science, physics, mathematics,
Science degree program. (Students who have been undergraduates biomedical engineering, etc.) and as to level of previous degree
in Electrical Engineering and Computer Science at MIT and who (bachelor's or master's), no specic admissions requirements are
seek opportunities for further study must complete the Master of listed. All applicants for any of these advanced programs will be
Engineering rather than the Master of Science degree program.) With evaluated in terms of their potential for successful completion of the
an additional year of study and research beyond the master's level, department's doctoral program. Superior achievement in relevant
a student in the doctoral or predoctoral program can complete the technical elds is considered particularly important.
requirements for the degree of Electrical Engineer or Engineer in
Computer Science. The doctoral program usually takes about four to Master of Science in Electrical Engineering and Computer
ve years beyond the master's level. Science
The general requirements for the degree of Master of Science
There are no xed programs of study for these doctoral and (http://catalog.mit.edu/mit/graduate-education/general-degree-
predoctoral degrees. Each student plans a program in consultation requirements) are listed under Graduate Education. The department
with a faculty advisor. As the program moves toward thesis research, requires that the 66-unit program consist of at least four subjects
it usually centers in one of a number of areas, each characterized from a list of approved subjects by the Graduate Oce which must
by an active research program. Areas of specialization in the include a minimum of 42 units of advanced graduate subjects. In
department that have active research programs and related graduate addition, a 24-unit thesis is required beyond the 66 units. Students
subjects include communications, control, signal processing, and working full-time for the Master of Science degree may take as many
optimization; computer science; articial intelligence, robotics, as four classroom subjects per term. The subjects are wholly elective
computer vision, and graphics; electronics, computers, systems, and and are not restricted to those given by the department. The program
networks; electromagnetics and electrodynamics; optics, photonics, of study must be well balanced, emphasizing one or more of the
and quantum electronics; energy conversion devices and systems;
power engineering and power electronics; materials and devices;

theoretical or experimental aspects of electrical engineering or most 27 units. They receive additional academic units for their
computer science. participation in the teaching or research program. Support through
an assistantship may extend the period required to complete the
Electrical Engineer or Engineer in Computer Science Master of Engineering program by an additional term or two. Support
The general requirements for an engineer's degree (http:// is granted competitively to graduate students and may not be
catalog.mit.edu/mit/graduate-education/general-degree- available for all of those admitted to the Master of Engineering
requirements) are given under the section on Graduate Education. program. The MEng degree is normally completed by students
These degrees are open to those able students in the doctoral taking a full load of regular subjects in two graduate terms. Students
or predoctoral program who seek more extensive training and receiving assistantships commonly require a third term and may
research experiences than are possible within the master's program. petition to continue for a fourth graduate term.
Admission to the engineer's program depends upon a superior
academic record and outstanding progress on a thesis. The course Master of Science, Engineer, and Doctoral Degree Students
of studies consists of at least 162 units, 90 of which must be from Studies toward an advanced degree can be supported by personal
a list of subjects approved by the Graduate Oce, and the thesis funds, by an award such as the National Science Foundation
requirements for a master's degree. Fellowship (which the student brings to MIT), by a fellowship
or traineeship awarded by MIT, or by a graduate assistantship.
Doctor of Philosophy or Doctor of Science Assistantships require participation in research or teaching in
The general requirements for the degree of Doctor of Philosophy or the department or in one of the associated laboratories. Full-time
Doctor of Science (http://catalog.mit.edu/mit/graduate-education/ assistants may register for no more than two scheduled classroom
general-degree-requirements) are given under the section on or laboratory subjects during the term, but may receive additional
Graduate Education. Doctoral candidates are expected to participate academic credit for their participation in the teaching or research
fully in the educational program of the department and to perform program.
thesis work that is a signicant contribution to knowledge. As
preparation, MIT students in the Master of Engineering in Electrical Inquiries
Engineering and Computer Science program will be expected to Additional information concerning graduate academic and research
complete that program. Students who have received a bachelor's programs, admissions, nancial aid, and assistantships may be
degree outside the department, but who have not completed a obtained from the Electrical Engineering and Computer Science
master's degree program, will normally be expected to complete the Graduate Oce, Room 38-444, 617-253-4605, or visit the EECS
requirements for the Master of Science degree described earlier, website (http://www.eecs.mit.edu).
including a thesis. Students who have completed a master's degree
elsewhere without a signicant research component will be required Interdisciplinary Programs
to register for and carry out a research accomplishment equivalent
to a master's thesis before being allowed to proceed in the doctoral Computational Science and Engineering
program. The Master of Science in Computational Science and Engineering
(CSE SM) (https://cse.mit.edu/programs/sm) is an interdisciplinary
Details of how students in the department fulll the requirements program that provides students with a strong foundation in
for the doctoral program are spelled out in an internal memorandum. computational methods for applications in science and engineering.
The department does not have a foreign language requirement, but The CSE SM program trains students in the formulation, analysis,
does require an approved minor program. implementation, and application of computational approaches via a
Graduate students enrolled in the department may participate in common core, which serves all science and engineering disciplines,
the research centers described in the Research and Study (http:// and an elective component which focuses on particular disciplinary
catalog.mit.edu/mit/research) section, such as the Operations applications. The program emphasizes:
Research Center. • Breadth through introductory courses in numerical analysis,
simulation, and optimization
Financial Support
• Depth in the student’s chosen eld
Master of Engineering Degree Students • Multidisciplinary aspects of computation

Students in the h year of study toward the Master of Engineering • Hands-on experience through projects, assignments, and a
degree are commonly supported by a graduate teaching or research master's thesis
assistantship. In the 6-A Master of Engineering Thesis Program with
Current MIT graduate students may pursue a CSE SM in conjunction
Industry, students are supported by paid company internships.
with a department-based master's or PhD program.
Students supported by full-time research or teaching assistantships
may register for no more than two regular classes totaling at

For more information, see the full program description (http:// and planning. See the program description (http://catalog.mit.edu/
catalog.mit.edu/interdisciplinary/graduate-programs/ schools/mit-schwarzman-college-computing/data-systems-society)
computational-science-engineering) under Interdisciplinary under the Institute for Data, Systems, and Society.
Graduate Programs.
Joint Program with the Woods Hole Oceanographic Institution Faculty and Teaching Sta
The Joint Program with the Woods Hole Oceanographic Institution
Asuman E. Ozdaglar, PhD
(WHOI) (http://mit.whoi.edu) is intended for students whose primary
MathWorks Professor of Electrical Engineering and Computer Science
career objective is oceanography or oceanographic engineering.
Head, Department of Electrical Engineering and Computer Science
Students divide their academic and research eorts between the
Professor of Electrical Engineering
campuses of MIT and WHOI. Joint Program students are assigned
Deputy Dean of Academics, MIT Schwarzman College of Computing
an MIT faculty member as academic advisor; thesis research may
Member, Institute for Data, Systems, and Society
be supervised by MIT or WHOI faculty. While in residence at MIT,
students follow a program similar to that of other students in Arvind Mithal, PhD
their home department. The program is described in more detail Charles W. and Jennifer C. Johnson Professor in Electrical Engineering
(http://catalog.mit.edu/interdisciplinary/graduate-programs/ and Computer Science
joint-program-woods-hole-oceanographic-institution) under Professor of Computer Science and Engineering
Interdisciplinary Graduate Programs. Faculty Head, Computer Science, Department of Electrical
Engineering and Computer Science
Leaders for Global Operations
The 24-month Leaders for Global Operations (LGO) (http:// Antonio Torralba, PhD
catalog.mit.edu/interdisciplinary/graduate-programs/leaders- Delta Electronics Professor
global-operations) program combines graduate degrees in Professor of Electrical Engineering and Computer Science
engineering and management for those with previous postgraduate Faculty Head, Articial Intelligence and Decision-Making Department
work experience and strong undergraduate degrees in a technical of Electrical Engineering and Computer Science
eld. During the two-year program, students complete a six-
Joel Voldman, PhD
month internship at one of LGO's partner companies, where they
William R. Brody (1965) Professor
conduct research that forms the basis of a dual-degree thesis.
Students nish the program with two MIT degrees: an MBA (or
Faculty Head, Electrical Engineering, Department of Electrical
SM in management) and an SM from one of seven engineering
Engineering and Computer Science
programs, some of which have optional or required LGO tracks. Aer
graduation, alumni lead strategic initiatives in high-tech, operations,
Professors
and manufacturing companies.
Harold Abelson, PhD
Class of 1992 Professor
System Design and Management
Professor of Electrical Engineering and Computer Science
The System Design and Management (SDM) (http://
sdm.mit.edu) program is a partnership among industry, government, Elfar Adalsteinsson, PhD
and the university for educating technically grounded leaders Eaton-Peabody Professor
of 21st-century enterprises. Jointly sponsored by the School of Professor of Electrical Engineering
Engineering and the Sloan School of Management, it is MIT's rst Core Faculty, Institute for Medical Engineering and Science
degree program to be oered with a distance learning option in
addition to a full-time in-residence option. Anant Agarwal, PhD
Technology and Policy
Akintunde I. Akinwande, PhD
The Master of Science in Technology and Policy is an engineering
Thomas and Gerd Perkins Professor of Electrical Engineering and
research degree with a strong focus on the role of technology in
Computer Science
policy analysis and formulation. The Technology and Policy Program
(TPP) (http://tpp.mit.edu) curriculum provides a solid grounding
in technology and policy by combining advanced subjects in the Saman P. Amarasinghe, PhD
student's chosen technical eld with courses in economics, politics, Professor of Computer Science and Engineering
quantitative methods, and social science. Many students combine
TPP's curriculum with complementary subjects to obtain dual
degrees in TPP and either a specialized branch of engineering or
an applied social science such as political science or urban studies

Hari Balakrishnan, PhD Isaac Chuang, PhD

Fujitsu Professor in Electrical Engineering and Computer Science Professor of Electrical Engineering
Professor of Electrical Engineering and Computer Science Professor of Physics
(On leave)
Munther A. Dahleh, PhD
Marc A. Baldo, PhD William A. Coolidge Professor
Dugald C. Jackson Professor in Electrical Engineering Professor of Electrical Engineering and Computer Science
Professor of Electrical Engineering Member, Institute for Data, Systems, and Society
(On leave, fall)
Regina Barzilay, PhD
School of Engineering Distinguished Professor for AI and Health Luca Daniel, PhD
Professor of Electrical Engineering and Computer Science Professor of Electrical Engineering and Computer Science
Aliate Faculty, Institute for Medical Engineering and Science
Konstantinos Daskalakis, PhD
Karl K. Berggren, PhD Armen Avanessians (1982) Professor
Joseph F. and Nancy P. Keithley Professor in Electrical Engineering Professor of Electrical Engineering and Computer Science
Randall Davis, PhD
Dimitri P. Bertsekas, PhD Professor of Computer Science and Engineering
Jerry McAfee (1940) Professor Post-Tenure in Engineering
Professor Post-Tenure of Electrical Engineering Jesús A. del Alamo, PhD
Member, Institute for Data, Systems, and Society Donner Professor of Science
Robert C. Berwick, PhD
Professor of Computer Science and Engineering and Computational Erik D. Demaine, PhD
Linguistics Professor of Computer Science and Engineering
Member, Institute for Data, Systems, and Society Srinivas Devadas, PhD
(On leave) Edwin Sibley Webster Professor
Sangeeta N. Bhatia, MD, PhD Professor of Electrical Engineering
John J. and Dorothy Wilson Professor of Health Sciences and (On leave)
Technology and Electrical Engineering and Computer Science Frederic Durand, PhD
Professor of Electrical Engineering and Computer Science Amar Bose Professor of Computing
Core Faculty, Institute for Medical Engineering and Science Professor of Computer Science and Engineering
Duane S. Boning, PhD (On leave)
Clarence J. LeBel Professor in Electrical Engineering and Computer Dennis M. Freeman, PhD
Science Henry Ellis Warren (1894) Professor
Professor of Electrical Engineering Professor of Electrical Engineering
Vladimir Bulović, PhD Member, Health Sciences and Technology Faculty
Fariborz Maseeh (1990) Professor in Emerging Technology William T. Freeman, PhD
Professor of Electrical Engineering Thomas and Gerd Perkins Professor Post-Tenure of Electrical
Vincent W. S. Chan, PhD Engineering
Joan and Irwin M. (1957) Jacobs Professor Post-Tenure Professor Post-Tenure of Electrical Engineering and Computer
Professor Post-Tenure of Electrical Engineering Science
Anantha P. Chandrakasan, PhD James G. Fujimoto, PhD

Vannevar Bush Professor Elihu Thomson Professor in Electrical Engineering
Professor of Electrical Engineering and Computer Science Professor of Electrical Engineering
Dean, School of Engineering David K. Giord, PhD
Adam Chlipala, PhD Professor Post-Tenure of Computer Science and Engineering
(On leave, fall)

Shafrira Goldwasser, PhD Patrick Jaillet, PhD

RSA Professor Post-Tenure Dugald C. Jackson Professor in Electrical Engineering
Professor Post-Tenure of Computer Science and Engineering Professor of Electrical Engineering and Computer Science
Professor of Civil and Environmental Engineering
Polina Golland, PhD Member, Institute for Data, Systems, and Society
Sunlin (1966) and Priscilla Chou Professor (On leave, fall)
Professor of Computer Science and Engineering
Member, Institute for Data, Systems, and Society M. Frans Kaashoek, PhD
Charles A. Piper (1935) Professor
Martha L. Gray, PhD Professor of Electrical Engineering and Computer Science
Whitaker Professor in Biomedical Engineering
Professor of Electrical Engineering and Computer Science Leslie P. Kaelbling, PhD
Member, Health Sciences and Technology Faculty Panasonic Professor
Core Faculty, Institute for Medical Engineering and Science Professor of Computer Science and Engineering
(On leave) (On leave, spring)
W. Eric L. Grimson, PhD David R. Karger, PhD

Bernard M. Gordon Professor in Medical Engineering Professor of Computer Science and Engineering
Professor of Computer Science and Engineering (On leave)
Chancellor for Academic Advancement
Dina Katabi, PhD
John V. Guttag, PhD Thuan (1990) and Nicole Pham Professor
Dugald C. Jackson Professor in Electrical Engineering Professor of Electrical Engineering and Computer Science
Manolis Kellis, PhD
Jongyoon Han, PhD Professor of Computer Science
Professor of Biological Engineering James L. Kirtley Jr, PhD
Professor Post-Tenure of Electrical Engineering
Berthold Klaus Paul Horn, PhD
Professor Post-Tenure of Computer Science and Engineering Leslie A. Kolodziejski, PhD
Qing Hu, PhD
Distinguished Professor in Electrical Engineering and Computer Jing Kong, PhD
Science Professor of Electrical Engineering
Professor of Electrical Engineering (On leave, fall)
(On leave, spring) Jerey H. Lang, PhD
Daniel Huttenlocher, PhD Vitesse Professor
Henry Ellis Warren (1894) Professor Professor of Electrical Engineering
Professor of Electrical Engineering and Computer Science Hae-Seung Lee, PhD
Dean, MIT Schwarzman College of Computing Advanced Television and Signal Processing (ATSP) Professor
Piotr Indyk, PhD Professor of Electrical Engineering
Thomas D. and Virginia W. Cabot Professor (On leave, fall)
Professor of Electrical Engineering and Computer Science Steven B. Leeb, PhD
(On leave, fall) Emanuel Landsman (1958) Professor
Tommi S. Jaakkola, PhD Professor of Electrical Engineering
Thomas M. Siebel Distinguished Professor Professor of Mechanical Engineering
Professor of Electrical Engineering and Computer Science Charles E. Leiserson, PhD
Member, Institute for Data, Systems, and Society Edwin Sibley Webster Professor
Daniel Jackson, PhD Professor of Electrical Engineering
Professor of Computer Science and Engineering Jae S. Lim, PhD

Tomás Lozano-Pérez, PhD Terry Philip Orlando, PhD

School of Engineering Professor of Teaching Excellence Professor Post-Tenure of Electrical Engineering
(On leave) Tomás Palacios, PhD
Clarence J. Lebel Professor in Electrical Engineering
Nancy Ann Lynch, PhD Professor of Electrical Engineering
NEC Professor Post-Tenure of Soware Science and Engineering
Professor Post-Tenure of Electrical Engineering and Computer Pablo A. Parrilo, PhD
Science Joseph F. and Nancy P. Keithley Professor in Electrical Engineering
Samuel R. Madden, PhD Professor of Mathematics
Distinguished College of Computing Professor Member, Institute for Data, Systems, and Society
Professor of Computer Science and Engineering
David J. Perreault, PhD
Aleksander Madry, PhD Ford Foundation Professor of Engineering
Cadence Design Systems Professor Professor of Electrical Engineering and Computer Science
Professor of Computer Science
(On leave) Yury Polyanskiy, PhD
Thomas L. Magnanti, PhD Member, Institute for Data, Systems, and Society
Institute Professor
Professor of Operations Research Rajeev J. Ram, PhD
Professor of Electrical Engineering Professor of Electrical Engineering
(On leave)
Wojciech Matusik, PhD
Professor of Electrical Engineering and Computer Science L. Rafael Reif, PhD
Ray and Maria Stata Professor of Electrical Engineering and
Muriel Médard, ScD Computer Science
NEC Professor of Soware Science and Engineering Professor of Electrical Engineering
Professor of Electrical Engineering and Computer Science President Emeritus
(On leave) (On leave)
Alexandre Megretski, PhD Martin C. Rinard, PhD

Professor of Electrical Engineering Professor of Computer Science and Engineering
Member, Institute for Data, Systems, and Society
Ronitt Rubinfeld, PhD
Silvio Micali, PhD Edwin Sibley Webster Professor
Ford Foundation Professor Post-Tenure of Engineering Professor of Computer Science and Engineering
Professor Post-Tenure of Computer Science and Engineering (On leave)
Robert C. Miller, PhD Daniela L. Rus, PhD

Distinguished Professor of Electrical Engineering and Computer Andrew (1956) and Erna Viterbi Professor
Science Professor of Computer Science and Engineering
Professor of Computer Science and Engineering Deputy Dean of Research, MIT Schwarzman College of Computing
Robert T. Morris, PhD Daniel Sánchez Martín, PhD

Professor of Computer Science and Engineering Professor of Electrical Engineering and Computer Science
William D. Oliver, PhD Martin A. Schmidt, PhD

Henry Ellis Warren (1894) Professor Ray and Maria Stata Professor
(On leave)
Alan V. Oppenheim, PhD
Ford Foundation Professor Post-Tenure of Engineering
Professor Post-Tenure of Electrical Engineering and Computer
Science

Devavrat Shah, PhD John N. Tsitsiklis, PhD

Andrew (1956) and Erna Viterbi Professor Clarence J. LeBel Professor in Electrical Engineering and Computer
Professor of Electrical Engineering and Computer Science Science
Member, Institute for Data, Systems, and Society Professor Post-Tenure of Electrical Engineering
(On leave) Member, Institute for Data, Systems, and Society
Jerey H. Shapiro, PhD Caroline Uhler, PhD

Julius A. Stratton Professor Post-Tenure in Electrical Engineering and Professor of Electrical Engineering and Computer Science
Physics Member, Institute for Data, Systems, and Society
Vinod Vaikuntanathan, PhD
Nir N. Shavit, PhD Professor of Electrical Engineering and Computer Science
George C. Verghese, PhD
Charles G. Sodini, PhD Henry Ellis Warren (1894) Professor Post-Tenure
Clarence J. LeBel Professor Post-Tenure in Electrical Engineering Professor Post-Tenure of Electrical and Biomedical Engineering
Core Faculty, Institute for Medical Engineering and Science Martin J. Wainwright, PhD
Cecil H. Green Professor in Electrical Engineering
Armando Solar Lezama, PhD Professor of Electrical Engineering and Computer Science
Distinguished College of Computing Professor Professor of Mathematics
Professor of Electrical Engineering and Computer Science Member, Institute for Data, Systems, and Society
David A. Sontag, PhD Cardinal Warde, PhD

Hermann L. F. von Helmholtz Professor Professor of Electrical Engineering
Core Faculty, Institute for Medical Engineering and Science Jacob K. White, PhD
(On leave, fall) Cecil H. Green Professor in Electrical Engineering
Collin M. Stultz, MD, PhD (On leave, spring)
Nina T. and Robert H. Rubin Professor in Medical Engineering and
Science Richard Ryan Williams, PhD
Core Faculty, Institute for Medical Engineering and Science Virginia Williams, PhD
Co-Director, Health Sciences and Technology Program Professor of Electrical Engineering and Computer Science
Gerald Jay Sussman, PhD (On leave, fall)
Panasonic Professor Gregory W. Wornell, PhD
Professor of Electrical Engineering Sumitomo Electric Industries Professor in Engineering
Peter Szolovits, PhD Professor of Electrical Engineering
Professor of Computer Science and Engineering Member, Institute for Data, Systems, and Society
Core Faculty, Institute for Medical Engineering and Science Nickolai Zeldovich, PhD
Russell L. Tedrake, PhD Professor of Electrical Engineering and Computer Science
Toyota Professor Lizhong Zheng, PhD
Professor of Computer Science and Engineering Professor of Electrical Engineering
Professor of Aeronautics and Astronautics
Professor of Mechanical Engineering Victor Waito Zue, ScD
Delta Electronics Professor Post-Tenure
Bruce Tidor, PhD Professor Post-Tenure of Electrical Engineering and Computer
Professor of Electrical Engineering and Computer Science Science
Professor of Biological Engineering

Phillip John Isola, PhD

Associate Professors Class of 1948 Career Development Professor
Fadel Adib, PhD Associate Professor of Electrical Engineering and Computer Science
Associate Professor of Media Arts and Sciences
Associate Professor of Electrical Engineering and Computer Science Stefanie Sabrina Jegelka, ScD
Associate Professor of Electrical Engineering and Computer Science
Mohammadreza Alizadeh Attar, PhD Member, Institute for Data, Systems, and Society
Associate Professor of Electrical Engineering and Computer Science (On leave)
Jacob Andreas, PhD Tim Kraska, PhD

Associate Professor of Electrical Engineering and Computer Science Associate Professor of Electrical Engineering and Computer Science
Adam M. Belay, PhD Laura D. Lewis, PhD

Associate Professor of Electrical Engineering and Computer Science Athinoula A. Martinos Associate Professor
Guy Bresler, PhD Core Faculty, Institute for Medical Engineering and Science
Member, Institute for Data, Systems, and Society Luqiao Liu, PhD
(On leave) Associate Professor of Electrical Engineering and Computer Science
Tamara A. Broderick, PhD Stefanie Mueller, PhD

Associate Professor of Electrical Engineering and Computer Science TIBCO Founders Professor
Member, Institute for Data, Systems, and Society Associate Professor of Electrical Engineering and Computer Science
(On leave) Associate Professor of Mechanical Engineering
Michael J. Carbin, PhD Kevin O'Brien, PhD

Associate Professor of Electrical Engineering and Computer Science Associate Professor of Electrical Engineering and Computer Science
(On leave)
Jonathan M. Ragan-Kelley, PhD
Christina Delimitrou, PhD Associate Professor of Electrical Engineering and Computer Science
Arvind Satyanarayan, PhD
Dirk R. Englund, PhD Associate Professor of Electrical Engineering and Computer Science
Julian Shun, PhD
Mohsen Ghaari, PhD Associate Professor of Electrical Engineering and Computer Science
(On leave, fall) Justin Solomon, PhD
Manya Ghobadi, PhD
Associate Professor of Electrical Engineering and Computer Science Suvrit Sra, PhD
Peter L. Hagelstein, PhD Member, Institute for Data, Systems, and Society
Associate Professor of Electrical Engineering
Vivienne Sze, PhD
Ruonan Han, PhD Associate Professor of Electrical Engineering and Computer Science
Assistant Professors
Song Han, PhD Pulkit Agrawal, PhD
Associate Professor of Electrical Engineering and Computer Science Assistant Professor of Electrical Engineering and Computer Science
(On leave, spring)
Sara Beery, PhD
Thomas Heldt, PhD Assistant Professor of Electrical Engineering and Computer Science
Core Faculty, Institute for Medical Engineering and Science YuFeng Chen, PhD
Assistant Professor of Electrical Engineering and Computer Science

Samantha Coday, PhD Jelena Notaros, PhD

Assistant Professor of Electrical Engineering and Computer Science Robert J. Shillman (1974) Career Development Professor in EECS
Connor W. Coley, PhD
Class of 1957 Career Development Professor Manish Raghavan, PhD
Assistant Professor of Chemical Engineering Drew Houston (2005) Career Development Professor
Assistant Professor of Electrical Engineering and Computer Science Assistant Professor of Electrical Engineering and Computer Science
Assistant Professor of Information Technology
Henry Corrigan-Gibbs, PhD
Douglas Ross (1954) Career Development Professor of Soware Negar Reiskarimian, PhD
Technology Assistant Professor of Electrical Engineering and Computer Science
Nidhi Seethapathi, PhD
Priya Donti, PhD Assistant Professor of Brain and Cognitive Sciences
Gabriele Farina, PhD Vincent Sitzmann, PhD

Marzyeh Ghassemi, PhD Tess E. Smidt, PhD

Herman L. F. von Helmholtz Career Development Professor X-Window Consortium Professor
Core Faculty, Institute for Medical Engineering and Science
(On leave) Ashia Wilson, PhD
Lister Brothers (Gordon K. '30 and Donald K. '34) Professor
Dylan J. Hadeld-Menell, PhD Assistant Professor of Electrical Engineering and Computer Science
Bonnie and Marty (1964) Tenenbaum Career Development Professor
Assistant Professor of Electrical Engineering and Computer Science Mengjia Yan, PhD
Homer A. Burnell Career Development Professor
Samuel B. Hopkins, PhD Assistant Professor of Electrical Engineering and Computer Science
Jamieson Career Development Professor in Electrical Engineering and
Computer Science Guangyu Robert Yang, PhD
Assistant Professor of Electrical Engineering and Computer Science Assistant Professor of Brain and Cognitive Sciences
Ericmoore Jossou, PhD
John Clark Hardwick (1986) Professor Sixian You, PhD
Assistant Professor of Nuclear Science and Engineering Alfred Henry (1929) and Jean Morrison Hayes Career Development
Assistant Professor of Electrical Engineering and Computer Science Professor
Yoon Kim, PhD
NBX Professor Professors of the Practice
Assistant Professor of Electrical Engineering and Computer Science Ahmad Bahai, PhD
Professor of the Practice of Electrical Engineering and Computer
Mina Konakovic Lukovic, PhD Science
Joel S. Emer, PhD
Kuikui Liu, PhD Professor of the Practice of Electrical Engineering and Computer
Assistant Professor of Electrical Engineering and Computer Science Science
Anand Venkat Natarajan, PhD
ITT Career Development Professor in Computer Technology Adjunct Professors
Assistant Professor of Electrical Engineering and Computer Science David J. DeWitt, PhD
Adjunct Professor of Computer Science and Engineering
Farnaz Niroui, PhD
Assistant Professor of Electrical Engineering and Computer Science Marija Ilic, PhD
Adjunct Professor of Computer Science and Engineering

Butler W. Lampson, PhD Andrew Wang, PhD

Adjunct Professor of Computer Science and Engineering Lecturer in Electrical Engineering and Computer Science
Michael Stonebraker, PhD Technical Instructors

Adjunct Professor of Computer Science and Engineering David L. Lewis, AA
Technical Instructor of Electrical Engineering and Computer Science
Adjunct Associate Professors
Yael Kalai, PhD Anthony Pennes, SB
Adjunct Associate Professor of Electrical Engineering and Computer Technical Instructor of Electrical Engineering and Computer Science
Science
Alexander D. Reduker, SB
Senior Lecturers Technical Instructor of Electrical Engineering and Computer Science
Ana Bell, PhD
Senior Lecturer in Electrical Engineering and Computer Science Research Sta
Tony Eng, PhD Visiting Scholars
Senior Lecturer in Electrical Engineering and Computer Science Alfred Z. Spector, PhD
Adam J. Hartz, MEng Visiting Scholar of Electrical Engineering and Computer Science
Senior Lecturer in Electrical Engineering and Computer Science
Professors Emeriti
Katrina Leigh LaCurts, PhD
Senior Lecturer in Electrical Engineering and Computer Science Dimitri A. Antoniadis, PhD
Ray and Maria Stata Professor Emeritus
Joseph Daly Steinmeyer, PhD Professor Emeritus of Electrical Engineering
Senior Lecturer in Electrical Engineering and Computer Science
Arthur B. Baggeroer, ScD
Lecturers Professor Emeritus of Mechanical and Ocean Engineering
Zachary R. Abel, PhD Professor Emeritus of Electrical Engineering
Lecturer in Electrical Engineering and Computer Science
Tim Berners-Lee, BA
Brynmor Chapman, PhD 3 Com Founders Professor Emeritus of Engineering
Rodney A. Brooks, PhD
Silvina Z. Hanono Wachman, PhD Professor Emeritus of Computer Science and Engineering
Principal Lecturer in Electrical Engineering and Computer Science
James Donald Bruce, ScD
Mauricio Karchmer, PhD Professor Emeritus of Electrical Engineering
Jack B. Dennis, ScD
Kyle Keane, PhD Professor Emeritus of Computer Science and Engineering
Clion G. Fonstad Jr, PhD
Kimberle Koile, PhD Vitesse Professor Emeritus
Principal Lecturer in Electrical Engineering and Computer Science Professor Emeritus of Electrical Engineering
Vincent J. Monardo, PhD G. David Forney, ScD

Lecturer in Electrical Engineering and Computer Science Adjunct Professor Emeritus of Electrical Engineering
Srinivasan Raghuraman, PhD Robert G. Gallager, ScD

Lecturer in Electrical Engineering and Computer Science Professor Emeritus of Electrical Engineering
Shen Shen, PhD Alan J. Grodzinsky, ScD

Lecturer in Electrical Engineering and Computer Science Professor Emeritus of Biological Engineering
Professor Emeritus of Electrical Engineering
Christopher W. Tanner, MS Professor Emeritus of Mechanical Engineering

Frederick C. Hennie III, PhD Gerald L. Wilson, PhD

Professor Emeritus of Computer Science and Engineering Vannevar Bush Professor Emeritus
Erich P. Ippen, PhD Professor Emeritus of Mechanical Engineering
Elihu Thomson Professor Emeritus
Professor Emeritus of Physics
Programming & Soware Engineering
John G. Kassakian, ScD
Professor Emeritus of Electrical Engineering 6.100A Introduction to Computer Science Programming in
Python
Francis Fan Lee, PhD Prereq: None
Professor Emeritus of Electrical Engineering and Computer Science U (Fall, Spring; rst half of term)
3-0-3 units
Barbara H. Liskov, PhD Credit cannot also be received for 6.100L
Institute Professor Emerita
Professor Emerita of Computer Science Introduction to computer science and programming for students
with little or no programming experience. Students develop skills
Albert R. Meyer, PhD to program and use computational techniques to solve problems.
Hitachi America Professor Emeritus Topics include the notion of computation, Python, simple algorithms
Professor Emeritus of Computer Science and Engineering and data structures, testing and debugging, and algorithmic
Ronald R. Parker, PhD complexity. Combination of 6.100A and 6.100B or 16.C20[J] counts as
Professor Emeritus of Nuclear Science and Engineering REST subject. Final given in the seventh week of the term.
Professor Emeritus of Electrical Engineering A. Bell, J. V. Guttag
Ronald L. Rivest, PhD 6.100B Introduction to Computational Thinking and Data Science
Institute Professor Emeritus Prereq: 6.100A or permission of instructor
Professor Emeritus of Computer Science and Engineering U (Fall, Spring; second half of term)
3-0-3 units
Jerome H. Saltzer, ScD Credit cannot also be received for 9.C20[J], 16.C20[J], 18.C20[J],
Professor Emeritus of Computer Science and Engineering CSE.C20[J]
Herbert Harold Sawin, PhD Provides an introduction to using computation to understand real-
Professor Emeritus of Chemical Engineering world phenomena. Topics include plotting, stochastic programs,
Professor Emeritus of Electrical Engineering probability and statistics, random walks, Monte Carlo simulations,
Joel E. Schindall, PhD modeling data, optimization problems, and clustering. Combination
Bernard M. Gordon Professor of the Practice Emeritus of 6.100A and 6.100B counts as REST subject.
A. Bell, J. V. Guttag
Stephen D. Senturia, PhD
Professor Emeritus of Electrical Engineering 6.100L Introduction to Computer Science and Programming
Prereq: None
Henry Ignatius Smith, PhD U (Fall, Spring)
Joseph F. and Nancy P. Keithley Professor Emeritus in Electrical 3-0-6 units
Engineering Credit cannot also be received for 6.100A
Introduction to computer science and programming for students
Stephen A. Ward, PhD with no programming experience. Presents content taught in 6.100A
Professor Emeritus of Computer Science and Engineering over an entire semester. Students develop skills to program and
Thomas F. Weiss, PhD use computational techniques to solve problems. Topics include
Professor Emeritus of Electrical and Bioengineering the notion of computation, Python, simple algorithms and data
Professor Emeritus of Health Sciences and Technology structures, testing and debugging, and algorithmic complexity.
A. Bell, J. V. Guttag
Alan S. Willsky, PhD
Edwin Sibley Webster Professor Emeritus
Professor Emeritus of Electrical Engineering and Computer Science

6.1010 Fundamentals of Programming 6.1060 Soware Performance Engineering

Prereq: 6.100A Prereq: 6.1020, 6.1210, and 6.1910
U (Fall, Spring) U (Fall)
2-4-6 units. Institute LAB 3-12-3 units
Introduces fundamental concepts of programming. Designed Project-based introduction to building ecient, high-performance
to develop skills in applying basic methods from programming and scalable soware systems. Topics include performance
languages to abstract problems. Topics include programming and analysis, algorithmic techniques for high performance, instruction-
Python basics, computational concepts, soware engineering, level optimizations, vectorization, cache and memory hierarchy
algorithmic techniques, data types, and recursion. Lab component optimization, and parallel programming.
consists of soware design, construction, and implementation of S. Amarasinghe, C. E. Leiserson
design. Enrollment may be limited.
D. S. Boning, A. Chlipala, S. Devadas, A. Hartz 6.5060 Algorithm Engineering
Prereq: 6.1060 and 6.1220[J]
6.1020 Soware Construction G (Spring)
Prereq: 6.1010 3-0-9 units
U (Spring)
3-0-12 units Covers the theory and practice of algorithms and data structures.
Topics include models of computation, algorithm design
Introduces fundamental principles and techniques of soware and analysis, and performance engineering of algorithm
development: how to write soware that is safe from bugs, easy to implementations. Presents the design and implementation
understand, and ready for change. Topics include specications and of sequential, parallel, cache-ecient, and external-memory
invariants; testing, test-case generation, and coverage; abstract data algorithms. Illustrates many of the principles of algorithm
types and representation independence; design patterns for object- engineering in the context of parallel algorithms and graph
oriented programming; concurrent programming, including message problems.
passing and shared memory concurrency, and defending against J. Shun
races and deadlock; and functional programming with immutable
data and higher-order functions. Includes weekly programming 6.5080 Multicore Programming
exercises and larger group programming projects. Subject meets with 6.5081
M. Goldman, R. C. Miller Prereq: 6.1210
G (Spring)
6.1040 Soware Design 4-0-8 units
Prereq: 6.1020 and 6.1200[J]
U (Fall) Introduces principles and core techniques for programming
4-0-14 units multicore machines. Topics include locking, scalability, concurrent
data structures, multiprocessor scheduling, load balancing, and
Provides design-focused instruction on how to build complex state-of-the-art synchronization techniques, such as transactional
soware applications. Design topics include classic human- memory. Includes sequence of programming assignments on a
computer interaction (HCI) design tactics (need nding, heuristic large multicore machine, culminating with the design of a highly
evaluation, prototyping, user testing), conceptual design (inventing, concurrent application. Students taking graduate version complete
modeling and evaluating constituent concepts), social and additional assignments.
ethical implications, abstract data modeling, and visual design. N. Shavit
Implementation topics include reactive front-ends, web services,
and databases. Students work both on individual projects and a
larger team project in which they design and build full-stack web
applications.
D. N. Jackson, A. Satyanarayan

6.5081 Multicore Programming 6.5110 Foundations of Program Analysis

Subject meets with 6.5080 Prereq: 6.1100
Prereq: 6.1210 Acad Year 2023-2024: Not oered
U (Spring) Acad Year 2024-2025: G (Fall)
4-0-8 units 3-0-9 units
Introduces principles and core techniques for programming Presents major principles and techniques for program analysis.
multicore machines. Topics include locking, scalability, concurrent Includes formal semantics, type systems and type-based program
data structures, multiprocessor scheduling, load balancing, and analysis, abstract interpretation and model checking and synthesis.
state-of-the-art synchronization techniques, such as transactional Emphasis on Haskell and Ocaml, but no prior experience in these
memory. Includes sequence of programming assignments on a languages is assumed. Student assignments include implementing
large multicore machine, culminating with the design of a highly of techniques covered in class, including building simple veriers.
concurrent application. Students taking graduate version complete A. Solar-Lezama
additional assignments.
N. Shavit 6.5120 Formal Reasoning About Programs
Prereq: 6.1020 and 6.1200[J]
Acad Year 2023-2024: Not oered
Programming Languages
Acad Year 2024-2025: G (Spring)
6.1100 Computer Language Engineering 3-0-9 units
Prereq: 6.1020 and 6.1910 Surveys techniques for rigorous mathematical reasoning about
U (Spring) correctness of soware, emphasizing commonalities across
4-4-4 units approaches. Introduces interactive computer theorem proving
Analyzes issues associated with the implementation of higher- with the Coq proof assistant, which is used for all assignments,
level programming languages. Fundamental concepts, functions, providing immediate feedback on soundness of logical arguments.
and structures of compilers. The interaction of theory and practice. Covers common program-proof techniques, including operational
Using tools in building soware. Includes a multi-person project on semantics, model checking, abstract interpretation, type systems,
compiler design and implementation. program logics, and their applications to functional, imperative, and
M. C. Rinard concurrent programs. Develops a common conceptual framework
based on invariants, abstraction, and modularity applied to state
6.1120 Dynamic Computer Language Engineering and labeled transition systems.
Prereq: 6.1020 or 6.1910 A. Chlipala
U (Fall)
4-4-4 units 6.5150 Large-scale Symbolic Systems
Subject meets with 6.5151
Studies the design and implementation of modern, dynamic Prereq: 6.4100 or permission of instructor
programming languages. Topics include fundamental approaches G (Spring)
for parsing, semantics and interpretation, virtual machines, garbage 3-0-9 units
collection, just-in-time machine code generation, and optimization.
Includes a semester-long, group project that delivers a virtual Concepts and techniques for the design and implementation of large
machine that spans all of these topics. soware systems that can be adapted to uses not anticipated by
M. Carbin the designer. Applications include compilers, computer-algebra
systems, deductive systems, and some articial intelligence
applications. Covers means for decoupling goals from strategy,
mechanisms for implementing additive data-directed invocation,
work with partially-specied entities, and how to manage multiple
viewpoints. Topics include combinators, generic operations, pattern
matching, pattern-directed invocation, rule systems, backtracking,
dependencies, indeterminacy, memoization, constraint propagation,
and incremental renement. Students taking graduate version
complete additional assignments.
G. J. Sussman

6.5151 Large-scale Symbolic Systems 6.120A Discrete Mathematics and Proof for Computer Science
Subject meets with 6.5150 Prereq: Calculus I (GIR)
Prereq: 6.4100 or permission of instructor U (Spring; second half of term)
U (Spring) 3-0-3 units
3-0-9 units
Subset of elementary discrete mathematics for science and
Concepts and techniques for the design and implementation of large engineering useful in computer science. Topics may include logical
soware systems that can be adapted to uses not anticipated by notation, sets, done relations, elementary graph theory, state
the designer. Applications include compilers, computer-algebra machines and invariants, induction and proofs by contradiction,
systems, deductive systems, and some articial intelligence recurrences, asymptotic notation, elementary analysis of algorithms,
applications. Covers means for decoupling goals from strategy, elementary number theory and cryptography, permutations and
mechanisms for implementing additive data-directed invocation, combinations, counting tools.
work with partially-specied entities, and how to manage multiple Sta
viewpoints. Topics include combinators, generic operations, pattern
matching, pattern-directed invocation, rule systems, backtracking, 6.1210 Introduction to Algorithms
dependencies, indeterminacy, memoization, constraint propagation, Prereq: 6.100A and (6.120A or 6.1200[J])
and incremental renement. Students taking graduate version U (Fall, Spring)
complete additional assignments. 5-0-7 units
G. J. Sussman
Introduction to mathematical modeling of computational problems,
6.5160[J] Classical Mechanics: A Computational Approach as well as common algorithms, algorithmic paradigms, and
Same subject as 8.351[J], 12.620[J] data structures used to solve these problems. Emphasizes the
Prereq: Physics I (GIR), 18.03, and permission of instructor relationship between algorithms and programming, and introduces
G (Fall) basic performance measures and analysis techniques for these
3-3-6 units problems. Enrollment may be limited.
E. Demaine, S. Devadas
See description under subject 12.620[J].
J. Wisdom, G. J. Sussman 6.1220[J] Design and Analysis of Algorithms
Same subject as 18.410[J]
Prereq: 6.1200[J] and 6.1210
Theoretical Computer Science
U (Fall, Spring)
6.1200[J] Mathematics for Computer Science 4-0-8 units
Same subject as 18.062[J] Techniques for the design and analysis of ecient algorithms,
Prereq: Calculus I (GIR) emphasizing methods useful in practice. Topics include sorting;
U (Fall, Spring) search trees, heaps, and hashing; divide-and-conquer; dynamic
5-0-7 units. REST programming; greedy algorithms; amortized analysis; graph
Elementary discrete mathematics for science and engineering, algorithms; and shortest paths. Advanced topics may include
with a focus on mathematical tools and proof techniques useful in network flow; computational geometry; number-theoretic
computer science. Topics include logical notation, sets, relations, algorithms; polynomial and matrix calculations; caching; and
elementary graph theory, state machines and invariants, induction parallel computing.
and proofs by contradiction, recurrences, asymptotic notation, E. Demaine, M. Goemans
elementary analysis of algorithms, elementary number theory and
cryptography, permutations and combinations, counting tools, and
discrete probability.
Z. R. Abel, F. T. Leighton, A. Moitra

6.1400[J] Computability and Complexity Theory 6.5220[J] Randomized Algorithms

Same subject as 18.400[J] Same subject as 18.416[J]
Prereq: (6.1200[J] and 6.1210) or permission of instructor Prereq: (6.1200[J] or 6.3700) and (6.1220[J] or 6.5210[J])
U (Spring) Acad Year 2023-2024: G (Spring)
4-0-8 units Acad Year 2024-2025: Not oered
5-0-7 units
Mathematical introduction to the theory of computing. Rigorously
explores what kinds of tasks can be eciently solved with Studies how randomization can be used to make algorithms simpler
computers by way of nite automata, circuits, Turing machines, and and more ecient via random sampling, random selection of
communication complexity, introducing students to some major open witnesses, symmetry breaking, and Markov chains. Models of
problems in mathematics. Builds skills in classifying computational randomized computation. Data structures: hash tables, and skip
tasks in terms of their diculty. Discusses other fundamental issues lists. Graph algorithms: minimum spanning trees, shortest paths,
in computing, including the Halting Problem, the Church-Turing and minimum cuts. Geometric algorithms: convex hulls, linear
Thesis, the P versus NP problem, and the power of randomness. programming in xed or arbitrary dimension. Approximate counting;
R. Williams, R. Rubinfeld parallel algorithms; online algorithms; derandomization techniques;
and tools for probabilistic analysis of algorithms.
6.1420 Fixed Parameter and Fine-grained Computation D. R. Karger
Prereq: 6.1200[J], 6.1210, and (6.1220[J], 6.1400[J], or 18.404)
Acad Year 2023-2024: Not oered 6.5230 Advanced Data Structures
Acad Year 2024-2025: U (Fall) Prereq: 6.1220[J]
3-0-9 units Acad Year 2023-2024: G (Spring)
An overview of the theory of parameterized algorithms and the 3-0-9 units
"problem-centric" theory of ne-grained complexity, both of which
reconsider how to measure the diculty and feasibility of solving More advanced and powerful data structures for answering several
computational problems. Topics include: xed-parameter tractability queries on the same data. Such structures are crucial in particular for
(FPT) and its characterizations, the W-hierarchy (W[1], W[2], W[P], designing ecient algorithms. Dictionaries; hashing; search trees.
etc.), 3-sum-hardness, all-pairs shortest paths (APSP)-equivalences, Self-adjusting data structures; linear search; splay trees; dynamic
strong exponential time hypothesis (SETH) hardness of problems, optimality. Integer data structures; word RAM. Predecessor problem;
and the connections to circuit complexity and other aspects of van Emde Boas priority queues; y-fast trees; fusion trees. Lower
computing. bounds; cell-probe model; round elimination. Dynamic graphs; link-
R. Williams, V. Williams cut trees; dynamic connectivity. Strings; text indexing; sux arrays;
sux trees. Static data structures; compact arrays; rank and select.
6.5210[J] Advanced Algorithms Succinct data structures; tree encodings; implicit data structures.
Same subject as 18.415[J] External-memory and cache-oblivious data structures; B-trees;
Prereq: 6.1220[J] and (6.1200[J], 6.3700, or 18.600) buer trees; tree layout; ordered-le maintenance. Temporal data
Acad Year 2023-2024: Not oered structures; persistence; retroactivity.
Acad Year 2024-2025: G (Fall) E. D. Demaine
5-0-7 units
6.5240 Sublinear Time Algorithms
First-year graduate subject in algorithms. Emphasizes fundamental Prereq: 6.1220[J] or permission of instructor
algorithms and advanced methods of algorithmic design, analysis, Acad Year 2023-2024: Not oered
and implementation. Surveys a variety of computational models Acad Year 2024-2025: G (Fall)
and the algorithms for them. Data structures, network flows, linear 3-0-9 units
programming, computational geometry, approximation algorithms,
online algorithms, parallel algorithms, external memory, streaming Sublinear time algorithms understand parameters and properties of
algorithms. input data aer viewing only a minuscule fraction of it. Tools from
A. Moitra, D. R. Karger number theory, combinatorics, linear algebra, optimization theory,
distributed algorithms, statistics, and probability are covered.
Topics include: testing and estimating properties of distributions,
functions, graphs, strings, point sets, and various combinatorial
objects.
R. Rubinfeld

6.5250[J] Distributed Algorithms 6.5340 Topics in Algorithmic Game Theory

Same subject as 18.437[J] Prereq: 6.1210 or 6.1220[J]
Prereq: 6.1220[J] G (Spring)
Acad Year 2023-2024: Not oered 3-0-9 units
Acad Year 2024-2025: G (Fall)
3-0-9 units Presents research topics at the interface of computer science and
game theory, with an emphasis on algorithms and computational
Design and analysis of concurrent algorithms, emphasizing those complexity. Explores the types of game-theoretic tools that are
suitable for use in distributed networks. Process synchronization, applicable to computer systems, the loss in system performance
allocation of computational resources, distributed consensus, due to the conflicts of interest of users and administrators, and
distributed graph algorithms, election of a leader in a network, the design of systems whose performance is robust with respect
distributed termination, deadlock detection, concurrency control, to conflicts of interest inside the system. Algorithmic focus is on
communication, and clock synchronization. Special consideration algorithms for equilibria, the complexity of equilibria and xed
given to issues of eciency and fault tolerance. Formal models and points, algorithmic tools in mechanism design, learning in games,
proof methods for distributed computation. and the price of anarchy.
M. Ghaari, N. A. Lynch K. Daskalakis
6.5310 Geometric Folding Algorithms: Linkages, Origami, 6.5350 Matrix Multiplication and Graph Algorithms
Polyhedra Prereq: 6.1220[J]
Prereq: 6.1220[J] or permission of instructor Acad Year 2023-2024: Not oered
Acad Year 2023-2024: Not oered Acad Year 2024-2025: G (Fall)
Acad Year 2024-2025: G (Fall) 3-0-9 units
3-0-9 units
Explores topics around matrix multiplication (MM) and its use in the
Covers discrete geometry and algorithms underlying the design of graph algorithms. Focuses on problems such as transitive
reconguration of foldable structures, with applications to closure, shortest paths, graph matching, and other classical graph
robotics, manufacturing, and biology. Linkages made from one- problems. Explores fast approximation algorithms when MM
dimensional rods connected by hinges: constructing polynomial techniques are too expensive.
curves, characterizing rigidity, characterizing unfoldable versus V. Williams
locked, protein folding. Folding two-dimensional paper (origami):
characterizing flat foldability, algorithmic origami design, one-cut 6.5400[J] Theory of Computation
magic trick. Unfolding and folding three-dimensional polyhedra: Same subject as 18.4041[J]
edge unfolding, vertex unfolding, gluings, Alexandrov's Theorem, Subject meets with 18.404
hinged dissections. Prereq: 6.1200[J] or 18.200
E. D. Demaine G (Fall)
4-0-8 units
6.5320 Geometric Computing
Prereq: 6.1220[J] See description under subject 18.4041[J].
Acad Year 2023-2024: G (Spring) M. Sipser
3-0-9 units 6.5410[J] Advanced Complexity Theory
Introduction to the design and analysis of algorithms for geometric Prereq: 18.404
problems, in low- and high-dimensional spaces. Algorithms: Acad Year 2023-2024: Not oered
convex hulls, polygon triangulation, Delaunay triangulation, motion Acad Year 2024-2025: G (Spring)
planning, pattern matching. Geometric data structures: point 3-0-9 units
location, Voronoi diagrams, Binary Space Partitions. Geometric
problems in higher dimensions: linear programming, closest pair See description under subject 18.405[J].
problems. High-dimensional nearest neighbor search and low- R. Williams
distortion embeddings between metric spaces. Geometric algorithms
for massive data sets: external memory and streaming algorithms.
Geometric optimization.
P. Indyk

6.5420 Randomness and Computation 6.5610 Applied Cryptography and Security

Prereq: 6.1220[J] and 18.4041[J] Prereq: 6.1200[J] and 6.1800
Acad Year 2023-2024: Not oered G (Spring)
Acad Year 2024-2025: G (Spring) 4-0-8 units
3-0-9 units
Emphasis on applied cryptography. May include: basic notion
The power and sources of randomness in computation. Connections of systems security, cryptographic hash functions, symmetric
and applications to computational complexity, computational cryptography (one-time pad, block ciphers, stream ciphers, message
learning theory, cryptography and combinatorics. Topics include: authentication codes), hash functions, key-exchange, public-
probabilistic proofs, uniform generation and approximate counting, key cryptography (encryption, digital signatures), elliptic curve
Fourier analysis of Boolean functions, computational learning theory, cryptography, secret-sharing, fully homomorphic encryption, zero-
expander graphs, pseudorandom generators, derandomization. knowledge proofs, and electronic voting. Assignments include a nal
R. Rubinfeld group project. Topics may vary year to year.
H. Corrigan-Gibbs, Y. Kalai
6.5430 Quantum Complexity Theory
Prereq: 6.1400[J], 18.4041[J], and 18.435[J] 6.5620[J] Cryptography and Cryptanalysis
G (Spring) Same subject as 18.425[J]
3-0-9 units Prereq: 6.1220[J]
G (Fall)
Introduction to quantum computational complexity theory, the 3-0-9 units
study of the fundamental capabilities and limitations of quantum
computers. Topics include complexity classes, lower bounds, A rigorous introduction to modern cryptography. Emphasis on the
communication complexity, proofs and advice, and interactive proof fundamental cryptographic primitives of public-key encryption,
systems in the quantum world; classical simulation of quantum digital signatures, pseudo-random number generation, and basic
circuits. The objective is to bring students to the research frontier. protocols and their computational complexity requirements.
Sta S. Goldwasser, S. Micali, V. Vaikuntanathan
Security & Cryptography 6.5630 Advanced Topics in Cryptography

Prereq: 6.5620[J]
6.1600 Foundations of Computer Security G (Fall)
Prereq: 6.1210 and 6.1800 3-0-9 units
U (Fall) Can be repeated for credit.
4-0-8 units In-depth exploration of recent results in cryptography.
Fundamental notions and big ideas for achieving security in S. Goldwasser, S. Micali, V. Vaikuntanathan
computer systems. Topics include cryptographic foundations
(pseudorandomness, collision-resistant hash functions, 6.5660 Computer Systems Security
authentication codes, signatures, authenticated encryption, Prereq: 6.1020 and 6.1800
public-key encryption), systems ideas (isolation, non-interference, G (Spring)
authentication, access control, delegation, trust), and 3-6-3 units
implementation techniques (privilege separation, fuzzing, symbolic Design and implementation of secure computer systems. Lectures
execution, runtime defenses, side-channel attacks). Case studies of cover attacks that compromise security as well as techniques
how these ideas are realized in deployed systems. Lab assignments for achieving security, based on recent research papers. Topics
apply ideas from lectures to learn how to build secure systems and include operating system security, privilege separation, capabilities,
how they can be attacked. language-based security, cryptographic network protocols, trusted
H. Corrigan-Gibbs, S. Devadas, S. Goldwasser, Y. Kalai, S. Micali, R. hardware, and security in web applications and mobile phones. Labs
Rivest, V. Vaikuntanathan, N. Zeldovich involve implementing and compromising a web application that
sandboxes arbitrary code, and a group nal project.
N. B. Zeldovich

Computer Systems 6.1820[J] Mobile and Sensor Computing

Same subject as MAS.453[J]
6.1800 Computer Systems Engineering Prereq: 6.1800 or permission of instructor
Prereq: 6.1910 U (Spring)
U (Spring) 3-0-9 units
5-1-6 units Focuses on "Internet of Things" (IoT) systems and technologies,
Topics on the engineering of computer soware and hardware sensing, computing, and communication. Explores fundamental
systems: techniques for controlling complexity; strong modularity design and implementation issues in the engineering of mobile and
using client-server design, operating systems; performance, sensor computing systems. Topics include battery-free sensors,
networks; naming; security and privacy; fault-tolerant systems, seeing through wall, robotic sensors, vital sign sensors (breathing,
atomicity and coordination of concurrent activities, and recovery; heartbeats, emotions), sensing in cars and autonomous vehicles,
impact of computer systems on society. Case studies of working subsea IoT, sensor security, positioning technologies (including
systems and readings from the current literature provide GPS and indoor WiFi), inertial sensing (accelerometers, gyroscopes,
comparisons and contrasts. Includes a single, semester-long design inertial measurement units, dead-reckoning), embedded and
project. Students engage in extensive written communication distributed system architectures, sensing with radio signals,
exercises. Enrollment may be limited. sensing with microphones and cameras, wireless sensor networks,
K. LaCurts embedded and distributed system architectures, mobile libraries
and APIs to sensors, and application case studies. Includes readings
6.1810 Operating System Engineering from research literature, as well as laboratory assignments and a
Prereq: 6.1910 signicant term project.
U (Fall) H. Balakrishnan, S. Madden, F. Adib
3-0-9 units
6.1850 Computer Systems and Society
Design and implementation of operating systems, and their use as a Prereq: 6.1800
foundation for systems programming. Topics include virtual memory, U (Fall)
le systems, threads, context switches, kernels, interrupts, system 3-0-9 units
calls, interprocess communication, coordination, and interaction
between soware and hardware. A multi-processor operating Explores the impact of computer systems on individual humans,
system for RISC-V, xv6, is used to illustrate these topics. Individual society, and the environment. Examines large- and small-scale power
laboratory assignments involve extending the xv6 operating system, structures that stem from low-level technical design decisions,
for example to support sophisticated virtual memory features and the consequences of those structures on society, and how they
networking. can limit or provide access to certain technologies. Students
A. Belay, M. F. Kaashoek, R. T. Morris learn to assess design decisions within an ethical framework and
consider the impact of their decisions on non-users. Case studies
of working systems and readings from the current literature provide
comparisons and contrasts. Possible topics include the implications
of hierarchical designs (e.g., DNS) for scale; how layered models
influence what parts of a network have the power to take certain
actions; and the environmental impact of proof-of-work-based
systems such as Bitcoin. Enrollment may be limited.
K. LaCurts

6.5810 Operating System Engineering 6.5831 Database Systems

Prereq: 6.1020 and 6.1800 Subject meets with 6.5830
G (Fall) Prereq: (6.1800 and (6.1210 or 6.1220[J])) or permission of instructor
3-6-3 units U (Fall)
3-0-9 units
Fundamental design and implementation issues in the engineering
of operating systems. Lectures based on the study of a symmetric Topics related to the engineering and design of database systems,
multiprocessor version of UNIX version 6 and research papers. Topics including data models; database and schema design; schema
include virtual memory; le system; threads; context switches; normalization and integrity constraints; query processing;
kernels; interrupts; system calls; interprocess communication; query optimization and cost estimation; transactions; recovery;
coordination, and interaction between soware and hardware. concurrency control; isolation and consistency; distributed, parallel
Individual laboratory assignments accumulate in the construction of and heterogeneous databases; adaptive databases; trigger systems;
a minimal operating system (for an x86-based personal computer) pub-sub systems; semi structured data and XML querying. Lecture
that implements the basic operating system abstractions and a shell. and readings from original research papers. Semester-long project
Knowledge of programming in the C language is a prerequisite. and paper. Students taking graduate version complete dierent
M. F. Kaashoek assignments. Enrollment may be limited.
S. R. Madden
6.5820 Computer Networks
Prereq: 6.1800 or permission of instructor 6.5840 Distributed Computer Systems Engineering
G (Fall) Prereq: 6.1800 and permission of instructor
4-0-8 units G (Spring)
3-0-9 units
Topics on the engineering and analysis of network protocols and
architecture, including architectural principles for designing Abstractions and implementation techniques for engineering
heterogeneous networks; transport protocols; Internet routing; distributed systems: remote procedure call, threads and locking,
router design; congestion control and network resource client/server, peer-to-peer, consistency, fault tolerance, and security.
management; wireless networks; network security; naming; overlay Readings from current literature. Individual laboratory assignments
and peer-to-peer networks. Readings from original research papers. culminate in the construction of a fault-tolerant and scalable
Semester-long project and paper. network le system. Programming experience with C/C++ required.
H. Balakrishnan, D. Katabi Enrollment limited.
R. T. Morris, M. F. Kaashoek
6.5830 Database Systems
Subject meets with 6.5831 6.5850 Principles of Computer Systems
Prereq: (6.1800 and (6.1210 or 6.1220[J])) or permission of instructor Prereq: Permission of instructor
G (Fall) G (Fall)
3-0-9 units Not oered regularly; consult department
3-0-9 units
Topics related to the engineering and design of database systems,
including data models; database and schema design; schema Introduction to the basic principles of computer systems
normalization and integrity constraints; query processing; with emphasis on the use of rigorous techniques as an aid to
query optimization and cost estimation; transactions; recovery; understanding and building modern computing systems. Particular
concurrency control; isolation and consistency; distributed, parallel attention paid to concurrent and distributed systems. Topics
and heterogeneous databases; adaptive databases; trigger systems; include: specication and verication, concurrent algorithms,
pub-sub systems; semi structured data and XML querying. Lecture synchronization, naming, Networking, replication techniques
and readings from original research papers. Semester-long project (including distributed cache management), and principles and
and paper. Students taking graduate version complete dierent algorithms for achieving reliability.
assignments. Enrollment may be limited. M. F. Kaashoek, B. Lampson, N. B. Zeldovich
S. R. Madden

Computer Architecture 6.1920 Constructive Computer Architecture

Prereq: 6.1910
6.1903 Introduction to Low-level Programming in C and U (Spring)
Assembly (6.1900) 3-8-1 units
Prereq: 6.100A Illustrates a constructive (as opposed to a descriptive) approach
U (Spring; rst half of term) to computer architecture. Topics include combinational and
2-2-2 units pipelined arithmetic-logic units (ALU), in-order pipelined
Credit cannot also be received for 6.1904 microarchitectures, branch prediction, blocking and unblocking
Introduction to C and assembly language for students coming from caches, interrupts, virtual memory support, cache coherence
a Python background (6.100A). Studies the C language, focusing and multicore architectures. Labs in a modern Hardware Design
on memory and associated topics including pointers, and how Language (HDL) illustrate various aspects of microprocessor design,
dierent data structures are stored in memory, the stack, and the culminating in a term project in which students present a multicore
heap in order to build a strong understanding of the constraints design running on an FPGA board.
involved in manipulating complex data structures in modern Arvind
computational systems. Studies assembly language to facilitate a
rm understanding of how high-level languages are translated to 6.5900 Computer System Architecture
machine-level instructions. Prereq: 6.1910
J. D. Steinmeyer, S. Hanono Wachman G (Fall)
4-0-8 units
6.1904 Introduction to Low-level Programming in C and Introduction to the principles underlying modern computer
Assembly (New) architecture. Emphasizes the relationship among technology,
Prereq: 6.100A hardware organization, and programming systems in the evolution
U (Spring; second half of term) of computer architecture. Topics include pipelined, out-of-order,
2-2-2 units and speculative execution; caches, virtual memory and exception
Credit cannot also be received for 6.1903 handling, superscalar, very long instruction word (VLIW), vector,
Introduction to C and assembly language for students coming from and multithreaded processors; on-chip networks, memory models,
a Python background (6.100A). Studies the C language, focusing synchronization, and cache coherence protocols for multiprocessors.
on memory and associated topics including pointers, and how J. S. Emer, D. Sanchez
dierent data structures are stored in memory, the stack, and the
heap in order to build a strong understanding of the constraints 6.5910 Complex Digital Systems Design
involved in manipulating complex data structures in modern Prereq: 6.1910
computational systems. Studies assembly language to facilitate a G (Spring)
rm understanding of how high-level languages are translated to Not oered regularly; consult department
machine-level instructions. 5-5-2 units
J. D. Steinmeyer, S. Hanono Wachman Introduction to the design and implementation of large-scale
digital systems using hardware description languages and high-
6.1910 Computation Structures level synthesis tools in conjunction with standard commercial
Prereq: Physics II (GIR), 6.100A, and (6.1900 or 6.9010) electronic design automation (EDA) tools. Emphasizes modular and
U (Fall, Spring) robust designs, reusable modules, correctness by construction,
4-0-8 units. REST architectural exploration, meeting area and timing constraints,
Provides an introduction to the design of digital systems and and developing functional eld-programmable gate array (FPGA)
computer architecture. Emphasizes expressing all hardware designs prototypes. Extensive use of CAD tools in weekly labs serve as
in a high-level hardware language and synthesizing the designs. preparation for a multi-person design project on multi-million gate
Topics include combinational and sequential circuits, instruction set FPGAs. Enrollment may be limited.
abstraction for programmable hardware, single-cycle and pipelined Arvind
processor implementations, multi-level memory hierarchies, virtual
memory, exceptions and I/O, and parallel systems.
S. Z. Hanono Wachman, D. Sanchez

6.5920 Parallel Computing 6.5931 Hardware Architecture for Deep Learning

Prereq: 6.1910 or permission of instructor Subject meets with 6.5930
G (Spring) Prereq: 6.1910 and (6.3000 or 6.3900)
Not oered regularly; consult department U (Spring)
Introduction to parallel and multicore computer architecture and Introduction to the design and implementation of hardware
programming. Topics include the design and implementation of architectures for ecient processing of deep learning algorithms
multicore processors; networking, video, continuum, particle and tensor algebra in AI systems. Topics include basics of deep
and graph applications for multicores; communication and learning, optimization principles for programmable platforms,
synchronization algorithms and mechanisms; locality in parallel design principles of accelerator architectures, co-optimization of
computations; computational models, including shared memory, algorithms and hardware (including sparsity) and use of advanced
streams, message passing, and data parallel; multicore mechanisms technologies (including memristors and optical computing). Includes
for synchronization, cache coherence, and multithreading. labs involving modeling and analysis of hardware architectures,
Performance evaluation of multicores; compilation and runtime architecting deep learning inference systems, and an open-
systems for parallel computing. Substantial project required. ended design project. Students taking graduate version complete
A. Agarwal additional assignments.
V. Sze, J. Emer
6.5930 Hardware Architecture for Deep Learning
Subject meets with 6.5931 6.5940 TinyML and Ecient Deep Learning Computing (New)
Prereq: 6.1910 and (6.3000 or 6.3900) Prereq: 6.1910 and 6.3900
G (Spring) G (Fall)
Introduction to the design and implementation of hardware Introduces ecient deep learning computing techniques that
architectures for ecient processing of deep learning algorithms enable powerful deep learning applications on resource-constrained
and tensor algebra in AI systems. Topics include basics of deep devices. Topics include model compression, pruning, quantization,
learning, optimization principles for programmable platforms, neural architecture search, distributed training, data/model
design principles of accelerator architectures, co-optimization of parallellism, gradient compression, on-device ne-tuning. It also
algorithms and hardware (including sparsity) and use of advanced introduces application-specic acceleration techniques for video
technologies (including memristors and optical computing). Includes recognition, point cloud, and generative AI (diusion model, LLM).
labs involving modeling and analysis of hardware architectures, Students will get hands-on experience accelerating deep learning
architecting deep learning inference systems, and an open- applications with an open-ended design project.
ended design project. Students taking graduate version complete S. Han
V. Sze, J. Emer 6.5950 Secure Hardware Design (New)
Prereq: 6.1910
G (Spring)
3-0-9 units
Introduction to basic concepts, principles, and implementation

issues in the designing of secure hardware systems. Through a
mixture of lectures and paper discussions, covers state-of-the-art
security attacks and defenses targeting the computer architecture,
digital circuits, and physics layers of computer systems. Emphasizes
both the conceptual and the practical aspects of security issues
in modern hardware systems. Topics include microarchitectural
timing side channels, speculative execution attacks, RowHammer,
Trusted Execution Environment, physical attacks, hardware support
for soware security, and verication of digital systems. Students
taking graduate version complete additional assignments.
M. Yan

6.5951 Secure Hardware Design (New) 6.2020[J] Electronics Project Laboratory

Subject meets with 6.5950 Same subject as EC.120[J]
Prereq: 6.1910 Prereq: None
U (Spring) U (Fall, Spring)
Introduction to basic concepts, principles, and implementation Intuition-based introduction to electronics, electronic components,
issues in the designing of secure hardware systems. Through a and test equipment such as oscilloscopes, multimeters, and signal
mixture of lectures and paper discussions, covers state-of-the-art generators. Key components studied and used are op-amps,
security attacks and defenses targeting the computer architecture, comparators, bi-polar transistors, and diodes (including LEDs).
digital circuits, and physics layers of computer systems. Emphasizes Students design, build, and debug small electronics projects
both the conceptual and the practical aspects of security issues (oen featuring sound and light) to put their new knowledge into
in modern hardware systems. Topics include microarchitectural practice. Upon completing the class, students can take home a
timing side channels, speculative execution attacks, RowHammer, kit of components. Intended for students with little or no previous
Trusted Execution Environment, physical attacks, hardware support background in electronics. Enrollment may be limited.
for soware security, and verication of digital systems. Students J. Bales
taking graduate version complete additional assignments.
M. Yan 6.2030 Electronics First Laboratory
Prereq: None. Coreq: Physics II (GIR)
U (Spring)
Circuits & Applications
4-4-4 units
6.2000 Electrical Circuits: Modeling and Design of Physical Practical introduction to the design and construction of electronic
Systems circuits for information processing and control. Laboratory exercises
Prereq: Physics II (GIR) include activities such as the construction of oscillators for a simple
U (Fall, Spring) musical instrument, a laser audio communicator, a countdown timer,
3-2-7 units. REST an audio amplier, and a feedback-controlled solid-state lighting
Fundamentals of linear systems, and abstraction modeling of multi- system for daylight energy conservation. Introduces basic electrical
physics lumped and distributed systems using lumped electrical components including resistors, capacitors, and inductors; basic
circuits. Linear networks involving independent and dependent assembly techniques for electronics include breadboarding and
sources, resistors, capacitors, and inductors. Extensions to include soldering; and programmable system-on-chip electronics and C
operational ampliers and transducers. Dynamics of rst- and programming language. Enrollment limited.
second-order networks; analysis and design in the time and S. B. Leeb
frequency domains; signal and energy processing applications.
Design exercises. Weekly laboratory with microcontroller and 6.2040 Analog Electronics Laboratory
transducers. Prereq: 6.2000
J. H. Lang, T. Palacios, D. J. Perreault, J. Voldman U (Spring)
2-9-1 units. Institute LAB
Experimental laboratory explores the design, construction, and

debugging of analog electronic circuits. Lectures and laboratory
projects in the rst half of the course investigate the performance
characteristics of semiconductor devices (diodes, BJTs, and
MOSFETs) and functional analog building blocks, including single-
stage ampliers, op amps, small audio amplier, lters, converters,
sensor circuits, and medical electronics (ECG, pulse-oximetry).
Projects involve design, implementation, and presentation in an
environment similar to that of industry engineering design teams.
Instruction and practice in written and oral communication provided.
Opportunity to simulate real-world problems and solutions that
involve tradeos and the use of engineering judgment.
G. Hom, N. Reiskarimian

6.2050 Digital Systems Laboratory 6.2061 Microcomputer Project Laboratory - Independent Inquiry
Prereq: 6.1910 or permission of instructor Subject meets with 6.2060
U (Fall) Prereq: 6.1910, 6.2000, or 6.3000
3-7-2 units. Institute LAB U (Spring)
3-9-3 units
Lab-intensive subject that investigates digital systems with a focus
on FPGAs. Lectures and labs cover logic, flip flops, counters, timing, Introduces analysis and design of embedded systems.
synchronization, nite-state machines, digital signal processing, Microcontrollers provide adaptation, flexibility, and real-time
communication protocols, and modern sensors. Prepares students control. Emphasizes construction of complete systems, including
for the design and implementation of a large-scale nal project of a ve-axis robot arm, a fluorescent lamp ballast, a tomographic
their choice: games, music, digital lters, wireless communications, imaging station (e.g., a CAT scan), and a simple calculator. Presents
video, or graphics. Extensive use of System/Verilog for describing a wide range of basic tools, including soware and development
and implementing and verifying digital logic designs. tools, programmable system on chip, peripheral components such
J. Steinmeyer, G. P. Hom, A. P. Chandrakasan as A/D converters, communication schemes, signal processing
techniques, closed-loop digital feedback control, interface and
6.2060 Microcomputer Project Laboratory power electronics, and modeling of electromechanical systems.
Subject meets with 6.2061 Includes a sequence of assigned projects, followed by a nal project
Prereq: 6.1910, 6.2000, or 6.3000 of the student's choice, emphasizing creativity and uniqueness.
U (Spring) Provides instruction in written and oral communication. Students
3-6-3 units. Institute LAB taking independent inquiry version 6.2061 expand the scope of their
laboratory project.
Introduces analysis and design of embedded systems. S. B. Leeb
Microcontrollers provide adaptation, flexibility, and real-time
control. Emphasizes construction of complete systems, including 6.2080 Semiconductor Electronic Circuits
a ve-axis robot arm, a fluorescent lamp ballast, a tomographic Prereq: 6.2000
imaging station (e.g., a CAT scan), and a simple calculator. Presents U (Spring)
a wide range of basic tools, including soware and development 3-2-7 units
tools, programmable system on chip, peripheral components such
as A/D converters, communication schemes, signal processing Provides an introduction to basic circuit design, starting from basic
techniques, closed-loop digital feedback control, interface and semiconductor devices such as diodes and transistors, large and
power electronics, and modeling of electromechanical systems. small signal models and analysis, to circuits such as basic amplier
Includes a sequence of assigned projects, followed by a nal project and opamp circuits. Labs give students access to CAD/EDA tools to
of the student's choice, emphasizing creativity and uniqueness. design, analyze, and layout analog circuits. At the end of the term,
Provides instruction in written and oral communication. To satisfy students have their chip design fabricated using a 22nm FinFET
the independent inquiry component of this subject, students expand CMOS process.
the scope of their laboratory project. R. Han, N. Reiskarimian
S. B. Leeb

6.2090 Solid-State Circuits 6.6000 CMOS Analog and Mixed-Signal Circuit Design
Prereq: 6.2040, 6.2080, or permission of instructor G (Spring)
U (Fall) 3-0-9 units
3-2-7 units
A detailed exposition of the principles involved in designing and
Fosters deep understanding and intuition that is crucial in innovating optimizing analog and mixed-signal circuits in CMOS technologies.
analog circuits and optimizing the whole system in bipolar junction Small-signal and large-signal models. Systemic methodology for
transistor (BJT) and metal oxide semiconductor (MOS) technologies. device sizing and biasing. Basic circuit building blocks. Operational
Covers both theory and real-world applications of basic amplier amplier design. Large signal considerations. Principles of switched
structures, operational ampliers, temperature sensors, bandgap capacitor networks including switched-capacitor and continuous-
references. Covers topics such as noise, linearity and stability. time integrated lters. Basic and advanced A/D and D/A converters,
Homework and labs give students access to CAD/EDA tools to delta-sigma modulators, RF and other signal processing circuits.
design and analyze analog circuits. Provides practical experience Design projects on op amps and subsystems are a required part of
through lab exercises, including a broadband amplier design the subject.
and characterization. Students taking graduate version complete H. S. Lee, R. Han
N. Reiskarimian, H.-S. Lee, R. Han 6.6010 Analysis and Design of Digital Integrated Circuits
Prereq: 6.1910 and (6.2080 or 6.2500)
6.2092 Solid-State Circuits G (Fall)
Subject meets with 6.2090 3-3-6 units
Prereq: 6.2040, 6.2080, or permission of instructor
G (Fall) Device and circuit level optimization of digital building blocks. Circuit
3-2-7 units design styles for logic, arithmetic, and sequential blocks. Estimation
and minimization of energy consumption. Interconnect models
Fosters deep understanding and intuition that is crucial in innovating and parasitics, device sizing and logical eort, timing issues (clock
analog circuits and optimizing the whole system in bipolar junction skew and jitter), and active clock distribution techniques. Memory
transistor (BJT) and metal oxide semiconductor (MOS) technologies. architectures, circuits (sense ampliers), and devices. Evaluation
Covers both theory and real-world applications of basic amplier of how design choices aect tradeos across key metrics including
structures, operational ampliers, temperature sensors, bandgap energy consumption, speed, robustness, and cost. Extensive use of
references. Covers topics such as noise, linearity and stability. modern design flow and EDA/CAD tools for the analysis and design
Homework and labs give students access to CAD/EDA tools to of digital building blocks and digital VLSI design for labs and design
design and analyze analog circuits. Provides practical experience projects
through lab exercises, including a broadband amplier design V. Sze, A. P. Chandrakasan
and characterization. Students taking graduate version complete
additional assignments. 6.6020 High Speed Communication Circuits
N. Reiskarimian, H.-S. Lee, R. Han Prereq: 6.2090
G (Fall)
3-3-6 units
Principles and techniques of high-speed integrated circuits used

in wireless/wireline data links and remote sensing. On-chip
passive component design of inductors, capacitors, and antennas.
Analysis of distributed eects, such as transmission line modeling,
S-parameters, and Smith chart. Transceiver architectures and
circuit blocks, which include low-noise ampliers, mixers, voltage-
controlled oscillators, power ampliers, and frequency dividers.
Involves IC/EM simulation and laboratory projects.
R. Han

Energy 6.2220 Power Electronics Laboratory

Subject meets with 6.2221, 6.2222
6.2200 Electric Energy Systems Prereq: 6.2000 or 6.3100
Prereq: 6.2000 U (Fall)
U (Fall) 3-6-3 units. Institute LAB
4-0-8 units Introduces the design and construction of power electronic circuits
Analysis and design of modern energy conversion and delivery and motor drives. Laboratory exercises include the construction of
systems. Develops a solid foundation in electromagnetic phenomena drive circuitry for an electric go-cart, flash strobes, computer power
with a focus on electrical energy distribution, electro-mechanical supplies, three-phase inverters for AC motors, and resonant drives
energy conversion (motors and generators), and electrical-to- for lamp ballasts and induction heating. Basic electric machines
electrical energy conversion (DC-DC, DC-AC power conversion). introduced include DC, induction, and permanent magnet motors,
Students apply the material covered to consider critical challenges with drive considerations. Provides instruction in written and oral
associated with global energy systems, with particular examples communication. Students taking independent inquiry version 6.2221
related to the electrication of transport and decarbonization of the expand the scope of their laboratory project.
grid. S. B. Leeb
R. Ram, J. H. Lang, M. Ilic, D. J. Perreault
6.2221 Power Electronics Laboratory - Independent Inquiry
6.2210 Electromagnetic Fields, Forces and Motion Subject meets with 6.2220, 6.2222
Subject meets with 6.6210 Prereq: 6.2000 or 6.3000
Prereq: Physics II (GIR) and 18.03 U (Fall)
4-0-8 units Introduces the design and construction of power electronic circuits
Study of electromagnetics and electromagnetic energy conversion and motor drives. Laboratory exercises include the construction of
leading to an understanding of devices, including electromagnetic drive circuitry for an electric go-cart, flash strobes, computer power
sensors, actuators, motors and generators. Quasistatic Maxwell's supplies, three-phase inverters for AC motors, and resonant drives
equations and the Lorentz force law. Studies of the quasistatic elds for lamp ballasts and induction heating. Basic electric machines
and their sources through solutions of Poisson's and Laplace's introduced include DC, induction, and permanent magnet motors,
equations. Boundary conditions and multi-region boundary-value with drive considerations. Provides instruction in written and oral
problems. Steady-state conduction, polarization, and magnetization. communication. To satisfy the independent inquiry component of
Charge conservation and relaxation, and magnetic induction and this subject, students expand the scope of their laboratory project.
diusion. Extension to moving materials. Electric and magnetic S. B. Leeb
forces and force densities derived from energy, and stress tensors.
Extensive use of engineering examples. Students taking graduate 6.2222 Power Electronics Laboratory
version complete additional assignments. Subject meets with 6.2220, 6.2221
J. H. Lang Prereq: Permission of instructor
G (Fall)
3-9-3 units
Hands-on introduction to the design and construction of power

electronic circuits and motor drives. Laboratory exercises (shared
with 6.131 and 6.1311) include the construction of drive circuitry
for an electric go-cart, flash strobes, computer power supplies,
three-phase inverters for AC motors, and resonant drives for lamp
ballasts and induction heating. Basic electric machines introduced
including DC, induction, and permanent magnet motors, with
drive considerations. Students taking graduate version complete
additional assignments and an extended nal project.
S. B. Leeb

6.6210 Electromagnetic Fields, Forces and Motion Electromagnetics, Photonics, and Quantum
Prereq: Physics II (GIR) and 18.03 6.2300 Electromagnetics Waves and Applications
G (Fall) Prereq: Calculus II (GIR) and Physics II (GIR)
4-0-8 units U (Spring)
Study of electromagnetics and electromagnetic energy conversion 3-5-4 units
leading to an understanding of devices, including electromagnetic Analysis and design of modern applications that employ
sensors, actuators, motors and generators. Quasistatic Maxwell's electromagnetic phenomena for signals and power transmission
equations and the Lorentz force law. Studies of the quasistatic elds in RF, microwaves, optical and wireless communication systems.
and their sources through solutions of Poisson's and Laplace's Fundamentals include dynamic solutions for Maxwell's equations;
equations. Boundary conditions and multi-region boundary-value electromagnetic power and energy, waves in media, metallic and
problems. Steady-state conduction, polarization, and magnetization. dielectric waveguides, radiation, and diraction; resonance; lters;
Charge conservation and relaxation, and magnetic induction and and acoustic analogs. Lab activities range from building to testing
diusion. Extension to moving materials. Electric and magnetic of devices and systems (e.g., antenna arrays, radars, dielectric
forces and force densities derived from energy, and stress tensors. waveguides). Students work in teams on self-proposed maker-style
Extensive use of engineering examples. Students taking graduate design projects with a focus on fostering creativity, teamwork, and
version complete additional assignments. debugging skills. 6.2000 and 6.3000 are recommended but not
J. H. Lang required.
K. O'Brien, L. Daniel
6.6220 Power Electronics
Prereq: 6.2500 6.2370 Modern Optics Project Laboratory
G (Spring) Subject meets with 6.6370
3-0-9 units Prereq: 6.3000
The application of electronics to energy conversion and control. Acad Year 2023-2024: Not oered
Modeling, analysis, and control techniques. Design of power circuits Acad Year 2024-2025: U (Fall)
including inverters, rectiers, and dc-dc converters. Analysis and 3-5-4 units. Institute LAB
design of magnetic components and lters. Characteristics of power Lectures, laboratory exercises and projects on optical signal
semiconductor devices. Numerous application examples, such as generation, transmission, detection, storage, processing and
motion control systems, power supplies, and radio-frequency power display. Topics include polarization properties of light; reflection
ampliers. and refraction; coherence and interference; Fraunhofer and
D. J. Perreault Fresnel diraction; holography; Fourier optics; coherent and
incoherent imaging and signal processing systems; optical
6.6280 Electric Machines properties of materials; lasers and LEDs; electro-optic and acousto-
Prereq: 6.2200, 6.690, or permission of instructor optic light modulators; photorefractive and liquid-crystal light
G (Fall) modulation; display technologies; optical waveguides and ber-
Not oered regularly; consult department optic communication systems; photodetectors. Students may use
3-0-9 units this subject to nd an advanced undergraduate project. Students
Treatment of electromechanical transducers, rotating and linear engage in extensive oral and written communication exercises.
electric machines. Lumped-parameter electromechanics. Power Recommended prerequisite: 8.03.
flow using Poynting's theorem, force estimation using the Maxwell C. Warde
stress tensor and Principle of virtual work. Development of analytical
techniques for predicting device characteristics: energy conversion
density, eciency; and of system interaction characteristics:
regulation, stability, controllability, and response. Use of electric
machines in drive systems. Problems taken from current research.
J. L. Kirtley, Jr.

6.2400 Introduction to Quantum Systems Engineering 6.6310 Optics and Photonics

Prereq: 6.2300 and (18.06 or 18.C06[J]) Prereq: 6.2300 or 8.03
U (Fall) Acad Year 2023-2024: Not oered
4-2-6 units Acad Year 2024-2025: G (Fall)
3-0-9 units
Introduction to the quantum mechanics needed to engineer
quantum systems for computation, communication, and sensing. Introduction to fundamental concepts and techniques of optics,
Topics include: motivation for quantum engineering, qubits and photonics, and ber optics, aimed at developing skills for
quantum gates, rules of quantum mechanics, mathematical independent research. Topics include: Review of Maxwell's
background, quantum electrical circuits and other physical quantum equations, light propagation, reflection and transmission, dielectric
systems, harmonic and anharmonic oscillators, measurement, mirrors and lters. Scattering matrices, interferometers, and
the Schrödinger equation, noise, entanglement, benchmarking, interferometric measurement. Fresnel and Fraunhoer diraction
quantum communication, and quantum algorithms. No prior theory. Lenses, optical imaging systems, and soware design
experience with quantum mechanics is assumed. tools. Gaussian beams, propagation and resonator design. Optical
K. Berggren, A. Natarajan, K. O'Brien waveguides, optical bers and photonic devices for encoding
and detection. Discussion of research operations / funding and
6.2410 Quantum Engineering Platforms professional development topics. The course reviews and introduces
Prereq: 6.2400, 6.6400, 18.435[J], or (8.04 and 8.05) mathematical methods and techniques, which are fundamental in
U (Spring) optics and photonics, but also useful in many other engineering
1-5-6 units specialties.
J. G. Fujimoto
Provides practical knowledge and quantum engineering experience
with several physical platforms for quantum computation, 6.6330 Fundamentals of Photonics
communication, and sensing, including photonics, superconducting Subject meets with 6.6331
qubits, and trapped ions. Labs include both a hardware component Prereq: 2.71, 6.2300, or 8.07
— to gain experience with challenges, design, and non-idealities Acad Year 2023-2024: Not oered
— and a cloud component to run algorithms on state of the art Acad Year 2024-2025: G (Fall)
commercial systems. Use entangled photons to communicate 3-0-9 units
securely (quantum key distribution). Run quantum algorithms on
trapped ion and superconducting quantum computers. Covers the fundamentals of optics and the interaction of light
D. Englund and matter, leading to devices such as light emitting diodes,
optical ampliers, and lasers. Topics include classical ray, wave,
6.6300 Electromagnetics beam, and Fourier optics; Maxwell's electromagnetic waves;
Prereq: Physics II (GIR) and 6.3000 resonators; quantum theory of photons; light-matter interaction;
G (Fall) laser amplication; lasers; and semiconductors optoelectronics.
4-0-8 units Students taking graduate version complete additional assignments.
D. R. Englund
Explores electromagnetic phenomena in modern applications,
including wireless and optical communications, circuits, computer 6.6331 Fundamentals of Photonics
interconnects and peripherals, microwave communications and Subject meets with 6.6330
radar, antennas, sensors, micro-electromechanical systems, Prereq: 2.71, 6.2300, or 8.07
and power generation and transmission. Fundamentals include Acad Year 2023-2024: Not oered
quasistatic and dynamic solutions to Maxwell's equations; waves, Acad Year 2024-2025: U (Fall)
radiation, and diraction; coupling to media and structures; guided 3-0-9 units
and unguided waves; modal expansions; resonance; acoustic
analogs; and forces, power, and energy. Covers the fundamentals of optics and the interaction of light
Q. Hu, J. Notaros and matter, leading to devices such as light emitting diodes,
optical ampliers, and lasers. Topics include classical ray, wave,
beam, and Fourier optics; Maxwell's electromagnetic waves;
resonators; quantum theory of photons; light-matter interaction;
laser amplication; lasers; and semiconductors optoelectronics.
Students taking graduate version complete additional assignments.
D. R. Englund

6.6340[J] Nonlinear Optics 6.6400 Applied Quantum and Statistical Physics

Same subject as 8.431[J] Prereq: 18.06
Prereq: 6.2300 or 8.03 G (Fall)
G (Spring) 4-0-8 units
3-0-9 units
Elementary quantum mechanics and statistical physics. Introduces
Techniques of nonlinear optics with emphasis on fundamentals applied quantum physics. Emphasizes experimental basis for
for research in optics, photonics, spectroscopy, and ultrafast quantum mechanics. Applies Schrodinger's equation to the
science. Topics include: electro-optic modulators and devices, sum free particle, tunneling, the harmonic oscillator, and hydrogen
and dierence frequency generation, and parametric conversion. atom. Variational methods. Elementary statistical physics; Fermi-
Nonlinear propagation eects in optical bers including self-phase Dirac, Bose-Einstein, and Boltzmann distribution functions.
modulation, pulse compression, solitons, communication, and Simple models for metals, semiconductors, and devices such as
femtosecond ber lasers. Review of quantum mechanics, interaction electron microscopes, scanning tunneling microscope, thermonic
of light with matter, laser gain and operation, density matrix emitters, atomic force microscope, and more. Some familiarity with
techniques, perturbation theory, diagrammatic methods, nonlinear continuous time Fourier transforms recommended.
spectroscopies, ultrafast lasers and measurements. Discussion of P. L. Hagelstein
research operations and funding and professional development
topics. Introduces fundamental methods and techniques needed for 6.6410[J] Quantum Computation
independent research in advanced optics and photonics, but useful Same subject as 2.111[J], 8.370[J], 18.435[J]
in many other engineering and physics disciplines. Prereq: 8.05, 18.06, 18.700, 18.701, or 18.C06[J]
J. G. Fujimoto G (Fall)
3-0-9 units
6.6370 Optical Imaging Devices, and Systems
Subject meets with 6.2370 See description under subject 18.435[J].
Prereq: 6.3000 I. Chuang, A. Harrow, P. Shor
Acad Year 2024-2025: G (Fall) 6.6420[J] Quantum Information Science
3-0-9 units Same subject as 8.371[J], 18.436[J]
Prereq: 18.435[J]
Principles of operation and applications of optical imaging devices G (Spring)
and systems (includes optical signal generation, transmission, 3-0-9 units
detection, storage, processing and display). Topics include review
of the basic properties of electromagnetic waves; coherence and See description under subject 8.371[J].
interference; diraction and holography; Fourier optics; coherent I. Chuang, A. Harrow
and incoherent imaging and signal processing systems; optical
properties of materials; lasers and LEDs; electro-optic and acousto-
optic light modulators; photorefractive and liquid-crystal light
modulation; spatial light modulators and displays; near-eye and
projection displays, holographic and other 3-D display schemes,
photodetectors; 2-D and 3-D optical storage technologies; adaptive
optical systems; role of optics in next-generation computers.
Requires a research paper on a specic contemporary optical
imaging topic. Recommended prerequisite: 8.03.
C. Warde

Nanoelectronics & Nanotechnology 6.2540 Nanotechnology: From Atoms to Systems

Prereq: Physics II (GIR)
6.2500 Nanoelectronics and Computing Systems U (Fall)
Prereq: 6.2000 2-3-7 units
U (Spring) Introduces the fundamentals of applied quantum mechanics,
4-0-8 units materials science, and fabrication skills needed to design, engineer,
Studies interaction between materials, semiconductor physics, and build emerging nanodevices with diverse applications in energy,
electronic devices, and computing systems. Develops intuition memory, display, communications, and sensing. Focuses on the
of how transistors operate. Topics range from introductory application and outlines the full progression from the fundamentals
semiconductor physics to modern state-of-the-art nano-scale to the implemented device and functional technology. Closely
devices. Considers how innovations in devices have driven historical integrates lectures with design-oriented laboratory modules.
progress in computing, and explores ideas for further improvements F. Niroui, R. Ram, L. Liu, T. Palacios
in devices and computing. Students apply material to understand
how building improved computing systems requires knowledge of 6.2600[J] Micro/Nano Processing Technology
devices, and how making the correct device requires knowledge Same subject as 3.155[J]
of computing systems. Includes a design project for practical Prereq: Calculus II (GIR), Chemistry (GIR), Physics II (GIR), or
application of concepts, and labs for experience building silicon permission of instructor
transistors and devices. U (Spring)
A. I. Akinwande, J. Kong, T. Palacios, M. Shulaker 3-4-5 units
Introduces the theory and technology of micro/nano fabrication.

6.2530 Introduction to Nanoelectronics Includes lectures and laboratory sessions on processing techniques:
Subject meets with 6.2532 wet and dry etching, chemical and physical deposition, lithography,
Prereq: 6.3000 thermal processes, packaging, and device and materials
U (Fall) characterization. Homework uses process simulation tools to build
Not oered regularly; consult department intuition about higher order eects. Emphasizes interrelationships
4-0-8 units between material properties and processing, device structure,
Transistors at the nanoscale. Quantization, wavefunctions, and and the electrical, mechanical, optical, chemical or biological
Schrodinger's equation. Introduction to electronic properties behavior of devices. Students fabricate solar cells, and a choice
of molecules, carbon nanotubes, and crystals. Energy band of MEMS cantilevers or microfluidic mixers. Students formulate
formation and the origin of metals, insulators and semiconductors. their own device idea, either based on cantilevers or mixers, then
Ballistic transport, Ohm's law, ballistic versus traditional MOSFETs, implement and test their designs in the lab. Students engage in
fundamental limits to computation. extensive written and oral communication exercises. Course provides
M. A. Baldo background for research work related to micro/nano fabrication.
Enrollment limited.
6.2532 Nanoelectronics J. del Alamo, J. Michel, J. Scholvin
Prereq: 6.3000 6.6500[J] Integrated Microelectronic Devices
G (Fall) Same subject as 3.43[J]
Not oered regularly; consult department Prereq: 3.42 or 6.2500
4-0-8 units G (Fall)
4-0-8 units
Meets with undergraduate subject 6.2530, but requires the
completion of additional/dierent homework assignments and or Covers physics of microelectronic semiconductor devices for
projects. See subject description under 6.2530. integrated circuit applications. Topics include semiconductor
M. A. Baldo fundamentals, p-n junction, metal-oxide semiconductor structure,
metal-semiconductor junction, MOS eld-eect transistor, and
bipolar junction transistor. Emphasizes physical understanding of
device operation through energy band diagrams and short-channel
MOSFET device design and modern device scaling. Familiarity with
MATLAB recommended.
J. A. del Alamo, H. L. Tuller

6.6510 Physics for Solid-State Applications 6.6600[J] Nanostructure Fabrication

Prereq: 6.2300 and 6.6400 Same subject as 2.391[J]
Acad Year 2023-2024: Not oered Prereq: 2.710, 6.2370, 6.2600[J], or permission of instructor
Acad Year 2024-2025: G (Spring) G (Spring)
Classical and quantum models of electrons and lattice vibrations Describes current techniques used to analyze and fabricate
in solids, emphasizing physical models for elastic properties, nanometer-length-scale structures and devices. Emphasizes
electronic transport, and heat capacity. Crystal lattices, electronic imaging and patterning of nanostructures, including fundamentals
energy band structures, phonon dispersion relations, eective mass of optical, electron (scanning, transmission, and tunneling), and
theorem, semiclassical equations of motion, electron scattering atomic-force microscopy; optical, electron, ion, and nanoimprint
and semiconductor optical properties. Band structure and transport lithography, templated self-assembly, and resist technology. Surveys
properties of selected semiconductors. Connection of quantum substrate characterization and preparation, facilities, and metrology
theory of solids with quasi-Fermi levels and Boltzmann transport requirements for nanolithography. Addresses nanodevice processing
used in device modeling. methods, such as liquid and plasma etching, li-o, electroplating,
Q. Hu, R. Ram and ion-implant. Discusses applications in nanoelectronics,
nanomaterials, and nanophotonics.
6.6520 Semiconductor Optoelectronics: Theory and Design K. K. Berggren
Prereq: 6.2500 and 6.6400
Acad Year 2023-2024: G (Spring) 6.6630[J] Control of Manufacturing Processes
Acad Year 2024-2025: Not oered Same subject as 2.830[J]
3-0-9 units Prereq: 2.008, 6.2600[J], or 6.3700
G (Fall)
Focuses on the physics of the interaction of photons with 3-0-9 units
semiconductor materials. Uses the band theory of solids to calculate
the absorption and gain of semiconductor media; and uses rate See description under subject 2.830[J].
equation formalism to develop the concepts of laser threshold, D. E. Hardt, D. S. Boning
population inversion, and modulation response. Presents theory
and design for photodetectors, solar cells, modulators, ampliers,
Signal Processing
and lasers. Introduces noise models for semiconductor devices, and
applications of optoelectronic devices to ber optic communications. 6.3000 Signal Processing
R. J. Ram Prereq: 6.100A and 18.03
U (Fall, Spring)
6.6530 Physics of Solids 6-0-6 units. REST
Prereq: 6.6510 or 8.231
G (Fall) Fundamentals of signal processing, focusing on the use of Fourier
Not oered regularly; consult department methods to analyze and process signals such as sounds and images.
4-0-8 units Topics include Fourier series, Fourier transforms, the Discrete Fourier
Transform, sampling, convolution, deconvolution, ltering, noise
Continuation of 6.730 emphasizing applications-related physical reduction, and compression. Applications draw broadly from areas of
issues in solids. Topics include: electronic structure and energy contemporary interest with emphasis on both analysis and design.
band diagrams of semiconductors, metals, and insulators; Fermi D. M. Freeman, A. Hartz
surfaces; dynamics of electrons under electric and magnetic elds;
classical diusive transport phenomena such as electrical and
thermal conduction and thermoelectric phenomena; quantum
transport in tunneling and ballistic devices; optical properties of
metals, semiconductors, and insulators; impurities and excitons;
photon-lattice interactions; Kramers-Kronig relations; optoelectronic
devices based on interband and intersubband transitions;
magnetic properties of solids; exchange energy and magnetic
ordering; magneto-oscillatory phenomena; quantum Hall eect;
superconducting phenomena and simple models.
Q. Hu

6.3010 Signals, Systems and Inference 6.7010 Digital Image Processing

Prereq: 6.3000 and (6.3700, 6.3800, or 18.05) Prereq: 6.3000 and 6.3700
U (Spring) G (Spring)
Covers signals, systems and inference in communication, control Introduces models, theories, and algorithms key to digital image
and signal processing. Topics include input-output and state- processing. Core topics covered include models of image formation,
space models of linear systems driven by deterministic and random image processing fundamentals, ltering in the spatial and
signals; time- and transform-domain representations in discrete and frequency domains, image transforms, and feature extraction.
continuous time; and group delay. State feedback and observers. Additional topics include image enhancement, image restoration
Probabilistic models; stochastic processes, correlation functions, and reconstruction, compression of images and videos, visual
power spectra, spectral factorization. Least-mean square error recognition, and the application of machine learning-based
estimation; Wiener ltering. Hypothesis testing; detection; matched approaches to image processing. Includes student-driven term
lters. project.
P. L. Hagelstein, G. C. Verghese Y. Rachlin, J. S. Lim
6.3020[J] Fundamentals of Music Processing (New number 6.7020 Array Processing

6.187) Prereq: 6.7000 and (2.687 or (6.3010 and 18.06))
Same subject as 21M.387[J] Acad Year 2023-2024: G (Fall)
Subject meets with 21M.587 Acad Year 2024-2025: Not oered
Prereq: 6.3000 and 21M.051 3-2-7 units
U (Fall)
3-0-9 units. HASS-A Adaptive and non-adaptive processing of signals received at
arrays of sensors. Deterministic beamforming, space-time random
See description under subject 21M.387[J]. processes, optimal and adaptive algorithms, and the sensitivity of
E. Egozy algorithm performance to modeling errors and limited data. Methods
of improving the robustness of algorithms to modeling errors and
6.7000 Discrete-Time Signal Processing limited data are derived. Advanced topics include an introduction to
Prereq: 6.3010 matched eld processing and physics-based methods of estimating
Acad Year 2023-2024: Not oered signal statistics. Homework exercises providing the opportunity to
Acad Year 2024-2025: G (Fall) implement and analyze the performance of algorithms in processing
4-0-8 units data supplied during the course.
J. Bonnel
Representation, analysis, and design of discrete time signals and
systems. Decimation, interpolation, and sampling rate conversion.
Noise shaping. Flowgraph structures for DT systems. IIR and FIR lter
design techniques. Parametric signal modeling, linear prediction,
and lattice lters. Discrete Fourier transform, DFT computation, and
FFT algorithms. Spectral analysis, time-frequency analysis, relation
to lter banks. Multirate signal processing, perfect reconstruction
lter banks, and connection to wavelets.
A. V. Oppenheim, J. Ward

Control 6.7100[J] Dynamic Systems and Control

6.3100 Dynamical System Modeling and Control Design Prereq: 6.3000 and 18.06
Subject meets with 6.3102 Acad Year 2023-2024: Not oered
Prereq: Physics II (GIR) and (18.06 or 18.C06[J]) Acad Year 2024-2025: G (Spring)
U (Fall, Spring) 4-0-8 units
4-4-4 units. Institute LAB Linear, discrete- and continuous-time, multi-input-output systems
A learn-by-design introduction to modeling and control of discrete- in control, related areas. Least squares and matrix perturbation
and continuous-time systems, from intuition-building analytical problems. State-space models, modes, stability, controllability,
techniques to more computational and data-centric strategies. observability, transfer function matrices, poles and zeros,
Topics include: linear dierence/dierential equations (natural and minimality. Internal stability of interconnected systems,
frequencies, transfer functions); controller metrics (stability, feedback compensators, state feedback, optimal regulation,
tracking, disturbance rejection); analytical techniques (PID, root- observers, and observer-based compensators. Measures of control
loci, lead-lag, phase margin); computational strategies (state- performance, robustness issues using singular values of transfer
space, eigen-placement, LQR); and data-centric approaches (state functions. Introductory ideas on nonlinear systems. Recommended
estimation, regression, and identication). Concepts are introduced prerequisite: 6.3100.
with lectures and online problems, and then mastered during weekly M. A. Dahleh, A. Megretski
labs. In lab, students model, design, test, and explain systems
and controllers involving sensors, actuators, and a microcontroller 6.7110 Multivariable Control Systems
(e.g., optimizing thrust-driven positioners or stabilizing magnetic Prereq: 6.7100[J] or 16.31
levitators). Students taking graduate version complete additional G (Fall)
problems and labs. Not oered regularly; consult department
K. Chen, J. K. White 3-0-9 units
Computer-aided design methodologies for synthesis of multivariable

6.3102 Dynamical System Modeling and Control Design feedback control systems. Performance and robustness trade-
Subject meets with 6.3100 os. Model-based compensators; Q-parameterization; ill-posed
Prereq: Physics II (GIR) and (18.06 or 18.C06[J]) optimization problems; dynamic augmentation; linear-quadratic
G (Fall, Spring) optimization of controllers; H-innity controller design; Mu-
4-4-4 units synthesis; model and compensator simplication; nonlinear eects.
A learn-by-design introduction to modeling and control of discrete- Computer-aided (MATLAB) design homework using models of
and continuous-time systems, from intuition-building analytical physical processes.
techniques to more computational and data-centric strategies. A. Megretski
Topics include: linear dierence/dierential equations (natural
frequencies, transfer functions); controller metrics (stability, 6.7120 Principles of Modeling, Computing and Control for
tracking, disturbance rejection); analytical techniques (PID, root- Decarbonized Electric Energy Systems (New)
loci, lead-lag, phase margin); computational strategies (state- Subject meets with 6.7121
space, eigen-placement, LQR); and data-centric approaches Prereq: 6.2200, (6.2000 and 6.3100), or permission of instructor
(state estimation, regression and identication). Concepts are U (Fall)
introduced with lectures and on-line problems, and then mastered 4-0-8 units
during weekly labs. In lab, students model, design, test and Introduces fundamentals of electric energy systems as complex
explain systems and controllers involving sensors, actuators, and dynamical network systems. Topics include coordinated and
a microcontroller (e.g. optimizing thrust-driven positioners or distributed modeling and control methods for ecient and reliable
stabilizing magnetic levitators). Students in the graduate version power generation, delivery, and consumption; data-enabled
complete additional problems and labs. algorithms for integrating clean intermittent resources, storage, and
K. Chen, J. K. White flexible demand, including electric vehicles; examples of network
congestion management, frequency, and voltage control in electrical
grids at various scales; and design and operation of supporting
markets. Students taking graduate version complete additional
assignments.
M. Ilic

6.7121 Principles of Modeling, Computing and Control for 6.7201 Optimization Methods
Decarbonized Electric Energy Systems (New) Subject meets with 6.7200[J], 15.093[J], IDS.200[J]
Prereq: 6.2200, (6.2000 and 6.3100), or permission of instructor U (Fall)
G (Fall) 4-0-8 units
4-0-8 units
Introduces the principal algorithms for linear, network, discrete,
Introduces fundamentals of electric energy systems as complex robust, nonlinear, and dynamic optimization. Emphasizes
dynamical network systems. Topics include coordinated and methodology and the underlying mathematical structures. Topics
distributed modeling and control methods for ecient and reliable include the simplex method, network flow methods, branch and
power generation, delivery, and consumption; data-enabled bound and cutting plane methods for discrete optimization,
algorithms for integrating clean intermittent resources, storage, and optimality conditions for nonlinear optimization, interior point
flexible demand, including electric vehicles; examples of network methods for convex optimization, Newton's method, heuristic
congestion management, frequency, and voltage control in electrical methods, and dynamic programming and optimal control methods.
grids at various scales; and design and operation of supporting Expectations and evaluation criteria dier for students taking
markets. Students taking graduate version complete additional graduate version; consult syllabus or instructor for specic details.
assignments. D. Bertsimas, P. Parrilo
M. Ilic
6.7210[J] Introduction to Mathematical Programming
Optimization & Engineering Mathematics
Prereq: 18.06
6.3260[J] Networks G (Fall)
Same subject as 14.15[J] 4-0-8 units
Subject meets with 14.150 Introduction to linear optimization and its extensions emphasizing
Prereq: 6.3700 or 14.30 both methodology and the underlying mathematical structures and
U (Spring) geometrical ideas. Covers classical theory of linear programming
4-0-8 units. HASS-S as well as some recent advances in the eld. Topics: simplex
See description under subject 14.15[J]. method; duality theory; sensitivity analysis; network flow problems;
A. Wolitzky decomposition; robust optimization; integer programming; interior
point algorithms for linear programming; and introduction to
6.7200[J] Optimization Methods combinatorial optimization and NP-completeness.
Same subject as 15.093[J], IDS.200[J] J. N. Tsitsiklis, D. Bertsimas
Prereq: 18.06 6.7220[J] Nonlinear Optimization
G (Fall) Same subject as 15.084[J]
4-0-8 units Prereq: 18.06 and (18.100A, 18.100B, or 18.100Q)
G (Spring)
See description under subject 15.093[J]. 4-0-8 units
D. Bertsimas, P. Parrilo
Unied analytical and computational approach to nonlinear
optimization problems. Unconstrained optimization methods
include gradient, conjugate direction, Newton, sub-gradient
and rst-order methods. Constrained optimization methods
include feasible directions, projection, interior point methods,
and Lagrange multiplier methods. Convex analysis, Lagrangian
relaxation, nondierentiable optimization, and applications in
integer programming. Comprehensive treatment of optimality
conditions and Lagrange multipliers. Geometric approach to duality
theory. Applications drawn from control, communications, machine
learning, and resource allocation problems.
R. M. Freund, P. Parrilo, G. Perakis

6.7230[J] Algebraic Techniques and Semidenite Optimization 6.7260 Network Science and Models
Same subject as 18.456[J] Prereq: 6.3702 and 18.06
Prereq: 6.7210[J] or 15.093[J] Acad Year 2023-2024: Not oered
Acad Year 2023-2024: Not oered Acad Year 2024-2025: G (Spring)
3-0-9 units
Introduces the main mathematical models used to describe large
Theory and computational techniques for optimization problems networks and dynamical processes that evolve on networks. Static
involving polynomial equations and inequalities with particular, models of random graphs, preferential attachment, and other graph
emphasis on the connections with semidenite optimization. evolution models. Epidemic propagation, opinion dynamics, social
Develops algebraic and numerical approaches of general learning, and inference in networks. Applications drawn from social,
applicability, with a view towards methods that simultaneously economic, natural, and infrastructure networks, as well as networked
incorporate both elements, stressing convexity-based ideas, decision systems such as sensor networks.
complexity results, and ecient implementations. Examples P. Jaillet, J. N. Tsitsiklis
from several engineering areas, in particular systems and control
applications. Topics include semidenite programming, resultants/ 6.7300[J] Introduction to Modeling and Simulation
discriminants, hyperbolic polynomials, Groebner bases, quantier Same subject as 2.096[J], 16.910[J]
elimination, and sum of squares. Prereq: 18.03 or 18.06
P. Parrilo G (Fall)
3-6-3 units
6.7240 Game Theory with Engineering Applications
Prereq: 6.3702 Introduction to computational techniques for modeling and
G (Fall) simulation of a variety of large and complex engineering, science,
Not oered regularly; consult department and socio-economical systems. Prepares students for practical use
4-0-8 units and development of computational engineering in their own research
and future work. Topics include mathematical formulations (e.g.,
Introduction to fundamentals of game theory and mechanism design automatic assembly of constitutive and conservation principles);
with motivations for each topic drawn from engineering applications linear system solvers (sparse and iterative); nonlinear solvers
(including distributed control of wireline/wireless communication (Newton and homotopy); ordinary, time-periodic and partial
networks, transportation networks, pricing). Emphasis on the dierential equation solvers; and model order reduction. Students
foundations of the theory, mathematical tools, as well as modeling develop their own models and simulators for self-proposed
and the equilibrium notion in dierent environments. Topics include applications, with an emphasis on creativity, teamwork, and
normal form games, supermodular games, dynamic games, repeated communication. Prior basic linear algebra required and at least one
games, games with incomplete/imperfect information, mechanism numerical programming language (e.g., MATLAB, Julia, Python, etc.)
design, cooperative game theory, and network games. helpful.
A. Ozdaglar L. Daniel
6.7250 Optimization for Machine Learning 6.7310[J] Introduction to Numerical Methods

Prereq: 6.3900 and 18.06 Same subject as 18.335[J]
G (Spring) Prereq: 18.06, 18.700, or 18.701
3-0-9 units G (Spring)
3-0-9 units
Optimization algorithms are central to all of machine learning.
Covers a variety of topics in optimization, with a focus on non-convex See description under subject 18.335[J].
optimization. Focuses on both classical and cutting-edge results, A. J. Horning
including foundational topics grounded in convexity, complexity
theory of rst-order methods, stochastic optimization, as well as
recent progress in non-Euclidean optimization, deep learning, and
beyond. Prepares students to appreciate a broad spectrum of ideas
in OPTML, learning to be not only informed users but also gaining
exposure to research questions in the area.
S. Sra

6.7320[J] Parallel Computing and Scientic Machine Learning 6.7410 Principles of Digital Communication
Same subject as 18.337[J] Subject meets with 6.7411
Prereq: 18.06, 18.700, or 18.701 Prereq: (6.3000 or 6.3102) and (6.3700, 6.3800, or 18.05)
Acad Year 2023-2024: Not oered G (Fall)
3-0-9 units
Covers communications by progressing through signal
See description under subject 18.337[J]. representation, sampling, quantization, compression, modulation,
A. Edelman coding and decoding, medium access control, and queueing and
principles of protocols. By providing simplied proofs, seeks
6.7330[J] Numerical Methods for Partial Dierential Equations to present an integrated, systems-level view of networking and
Same subject as 2.097[J], 16.920[J] communications while laying the foundations of analysis and design.
Prereq: 18.03 or 18.06 Lectures are oered online; in-class time is dedicated to recitations,
G (Fall) exercises, and weekly group labs. Homework exercises are based on
3-0-9 units theoretical derivation and soware implementation. Students taking
graduate version complete additional assignments.
See description under subject 16.920[J]. M. Medard
J. Peraire
6.7411 Principles of Digital Communication
6.7340[J] Fast Methods for Partial Dierential and Integral Subject meets with 6.7410
Equations Prereq: (6.3000, 6.3100, or 6.3400) and (6.3700, 6.3800, or 18.05)
Same subject as 18.336[J] U (Fall)
Prereq: 6.7300[J], 16.920[J], 18.085, 18.335[J], or permission of 3-0-9 units
instructor
G (Fall, Spring) Covers communications by progressing through signal
3-0-9 units representation, sampling, quantization, compression, modulation,
coding and decoding, medium access control, and queueing and
See description under subject 18.336[J]. principles of protocols. By providing simplied proofs, seeks
K. Burns to present an integrated, systems-level view of networking and
communications while laying the foundations of analysis and design.
Communications Lectures are oered online; in-class time is dedicated to recitations,
exercises, and weekly group labs. Homework exercises are based on
6.3400 Introduction to EECS via Communication Networks theoretical derivation and soware implementation. Students taking
Prereq: 6.100A graduate version complete additional assignments.
U (Fall) M. Medard
Not oered regularly; consult department
Studies key concepts, systems, and algorithms to reliably

communicate data in settings ranging from the cellular phone
network and the Internet to deep space. Weekly laboratory
experiments explore these areas in depth. Topics presented in three
modules - bits, signals, and packets - spanning the multiple layers
of a communication system. Bits module includes information,
entropy, data compression algorithms, and error correction with
block and convolutional codes. Signals module includes modeling
physical channels and noise, signal design, ltering and detection,
modulation, and frequency-division multiplexing. Packets module
includes switching and queuing principles, media access control,
routing protocols, and data transport protocols.
K. LaCurts

6.7420 Heterogeneous Networks: Architecture, Transport, 6.7440 Principles of Wireless Communication

Proctocols, and Management Prereq: 6.7410
Prereq: 6.1200[J] or 6.3700 G (Fall)
Acad Year 2023-2024: Not oered Not oered regularly; consult department
Acad Year 2024-2025: G (Fall) 3-0-9 units
4-0-8 units
Introduction to design, analysis, and fundamental limits of wireless
Introduction to modern heterogeneous networks and the provision transmission systems. Wireless channel and system models; fading
of heterogeneous services. Architectural principles, analysis, and diversity; resource management and power control; multiple-
algorithmic techniques, performance analysis, and existing designs antenna and MIMO systems; space-time codes and decoding
are developed and applied to understand current problems in algorithms; multiple-access techniques and multiuser detection;
network design and architecture. Begins with basic principles broadcast codes and precoding; cellular and ad-hoc network
of networking. Emphasizes development of mathematical and topologies; OFDM and ultrawideband systems; architectural issues.
algorithmic tools; applies them to understanding network layer G. W. Wornell, L. Zheng
design from the performance and scalability viewpoint. Concludes
with network management and control, including the architecture 6.7450[J] Data-Communication Networks
and performance analysis of interconnected heterogeneous Same subject as 16.37[J]
networks. Provides background and insight to understand current Prereq: 6.3700 or 18.204
network literature and to perform research on networks with the aid Acad Year 2023-2024: Not oered
of network design projects. Acad Year 2024-2025: G (Fall)
V. W. S. Chan, R. G. Gallager 3-0-9 units
6.7430 Optical Networks Provides an introduction to data networks with an analytic

Prereq: 6.1200[J] or 6.3700 perspective, using wireless networks, satellite networks, optical
Acad Year 2023-2024: G (Spring) networks, the internet and data centers as primary applications.
Acad Year 2024-2025: Not oered Presents basic tools for modeling and performance analysis. Draws
3-0-9 units upon concepts from stochastic processes, queuing theory, and
optimization.
Introduces the fundamental and practical aspects of optical network E. Modiano
technology, architecture, design and analysis tools and techniques.
The treatment of optical networks are from the architecture and 6.7460 Essential Coding Theory
system design points of view. Optical hardware technologies are Prereq: 6.1210 and 6.1400[J]
introduced and characterized as fundamental network building G (Spring)
blocks on which optical transmission systems and network Not oered regularly; consult department
architectures are based. Beyond the Physical Layer, the higher 3-0-9 units
network layers (Media Access Control, Network and Transport Layers)
are treated together as integral parts of network design. Performance Introduces the theory of error-correcting codes. Focuses on the
metrics, analysis and optimization techniques are developed to help essential results in the area, taught from rst principles. Special
guide the creation of high performance complex optical networks. focus on results of asymptotic or algorithmic signicance. Principal
V. W. S. Chan topics include construction and existence results for error-correcting
codes; limitations on the combinatorial performance of error-
correcting codes; decoding algorithms; and applications to other
areas of mathematics and computer science.
Sta

6.7470 Information Theory 6.3702 Introduction to Probability

Prereq: 6.3700 Subject meets with 6.3700
Acad Year 2023-2024: Not oered Prereq: Calculus II (GIR)
Acad Year 2024-2025: G (Fall) G (Fall, Spring)
Credit cannot also be received for 18.600
Mathematical denitions of information measures, convexity,
continuity, and variational properties. Lossless source coding; An introduction to probability theory, the modeling and analysis
variable-length and block compression; Slepian-Wolf theorem; of probabilistic systems, and elements of statistical inference.
ergodic sources and Shannon-McMillan theorem. Hypothesis testing, Probabilistic models, conditional probability. Discrete and
large deviations and I-projection. Fundamental limits of block coding continuous random variables. Expectation and conditional
for noisy channels: capacity, dispersion, nite blocklength bounds. expectation, and further topics about random variables. Limit
Coding with feedback. Joint source-channel problem. Rate-distortion Theorems. Bayesian estimation and hypothesis testing. Elements
theory, vector quantizers. Advanced topics include Gelfand-Pinsker of classical statistical inference. Bernoulli and Poisson processes.
problem, multiple access channels, broadcast channels (depending Markov chains. Students taking graduate version complete
on available time). additional assignments.
M. Medard, Y. Polyanskiy, L. Zheng G. Bresler, P. Jaillet, J. N. Tsitsiklis
Probability & Statistics 6.3720 Introduction to Statistical Data Analysis

6.3700 Introduction to Probability Prereq: 6.100A and (6.3700, 6.3800, or 18.600)
Subject meets with 6.3702 U (Spring)
Prereq: Calculus II (GIR) 4-0-8 units
U (Fall, Spring) Introduction to the central concepts and methods of data
4-0-8 units. REST science with an emphasis on statistical grounding and modern
Credit cannot also be received for 18.600 computational capabilities. Covers principles involved in extracting
An introduction to probability theory, the modeling and analysis information from data for the purpose of making predictions
of probabilistic systems, and elements of statistical inference. or decisions, including data exploration, feature selection,
Probabilistic models, conditional probability. Discrete and model tting, and performance assessment. Topics include
continuous random variables. Expectation and conditional learning of distributions, hypothesis testing (including multiple
expectation, and further topics about random variables. Limit comparison procedures), linear and nonlinear regression and
Theorems. Bayesian estimation and hypothesis testing. Elements prediction, classication, time series, uncertainty quantication,
of classical statistical inference. Bernoulli and Poisson processes. model validation, causal inference, optimization, and decisions.
Markov chains. Students taking graduate version complete Computational case studies and projects drawn from applications
additional assignments. in nance, sports, engineering, and machine learning life sciences.
G. Bresler, P. Jaillet, J. N. Tsitsiklis Students taking graduate version complete additional assignments.
Recommended prerequisite: 18.06.
Y. Polyanskiy, D. Shah, J. N. Tsitsiklis

6.3722 Introduction to Statistical Data Analysis 6.7700[J] Fundamentals of Probability

Subject meets with 6.3720 Same subject as 15.085[J]
Prereq: 6.100A and (6.3700, 6.3800, 18.600, or permission of Prereq: Calculus II (GIR)
instructor) G (Fall)
4-0-8 units
Introduction to probability theory. Probability spaces and measures.
Introduction to the central concepts and methods of data Discrete and continuous random variables. Conditioning and
science with an emphasis on statistical grounding and modern independence. Multivariate normal distribution. Abstract integration,
computational capabilities. Covers principles involved in extracting expectation, and related convergence results. Moment generating
information from data for the purpose of making predictions and characteristic functions. Bernoulli and Poisson process. Finite-
or decisions, including data exploration, feature selection, state Markov chains. Convergence notions and their relations. Limit
model tting, and performance assessment. Topics include theorems. Familiarity with elementary probability and real analysis is
learning of distributions, hypothesis testing (including multiple desirable.
comparison procedures), linear and nonlinear regression and T. Broderick, D. Gamarnik, Y. Polyanskiy, J. N. Tsitsiklis
prediction, classication, time series, uncertainty quantication,
model validation, causal inference, optimization, and decisions. 6.7710 Discrete Stochastic Processes
Computational case studies and projects drawn from applications Prereq: 6.3702 or 18.204
in nance, sports, engineering, and machine learning life sciences. Acad Year 2023-2024: Not oered
Students taking graduate version complete additional assignments. Acad Year 2024-2025: G (Spring)
Recommended prerequisite: 18.06. 4-0-8 units
Y. Polyanskiy, D. Shah, J. N. Tsitsiklis
Review of probability and laws of large numbers; Poisson counting
6.3730[J] Statistics, Computation and Applications process and renewal processes; Markov chains (including Markov
Same subject as IDS.012[J] decision theory), branching processes, birth-death processes,
Subject meets with 6.3732[J], IDS.131[J] and semi-Markov processes; continuous-time Markov chains and
Prereq: (6.100B, (18.03, 18.06, or 18.C06[J]), and (6.3700, 6.3800, reversibility; random walks, martingales, and large deviations;
14.30, 16.09, or 18.05)) or permission of instructor applications from queueing, communication, control, and operations
U (Spring) research.
3-1-8 units R. G. Gallager, V. W. S. Chan
See description under subject IDS.012[J]. Enrollment limited; priority 6.7720[J] Discrete Probability and Stochastic Processes
to Statistics and Data Science minors, and to juniors and seniors. Same subject as 15.070[J], 18.619[J]
C. Uhler, N. Azizan Prereq: 6.3702, 6.7700[J], 18.100A, 18.100B, or 18.100Q
G (Spring)
6.3732[J] Statistics, Computation and Applications 3-0-9 units
Same subject as IDS.131[J]
Subject meets with 6.3730[J], IDS.012[J] See description under subject 15.070[J].
Prereq: (6.100B, (18.03, 18.06, or 18.C06[J]), and (6.3700, 6.3800, G. Bresler, D. Gamarnik, E. Mossel, Y. Polyanskiy
14.30, 16.09, or 18.05)) or permission of instructor
G (Spring)
3-1-8 units
See description under subject IDS.131[J]. Limited enrollment; priority

to Statistics and Data Science minors and to juniors and seniors.
C. Uhler, N. Azizan

Inference 6.7820[J] Graphical Models: A Geometric, Algebraic, and

Combinatorial Perspective
6.3800 Introduction to Inference Same subject as IDS.136[J]
Prereq: Calculus II (GIR) or permission of instructor Prereq: 6.3702 and 18.06
U (Fall) G (Fall)
4-4-4 units. Institute LAB Not oered regularly; consult department
3-0-9 units
Introduces probabilistic modeling for problems of inference
and machine learning from data, emphasizing analytical See description under subject IDS.136[J].
and computational aspects. Distributions, marginalization, C. Uhler
conditioning, and structure, including graphical and neural
network representations. Belief propagation, decision-making, 6.7830 Bayesian Modeling and Inference
classication, estimation, and prediction. Sampling methods and Prereq: 6.7700[J] and 6.7900
analysis. Introduces asymptotic analysis and information measures. Acad Year 2023-2024: Not oered
Computational laboratory component explores the concepts Acad Year 2024-2025: G (Spring)
introduced in class in the context of contemporary applications. 3-0-9 units
Students design inference algorithms, investigate their behavior on Covers Bayesian modeling and inference at an advanced graduate
real data, and discuss experimental results. level. Topics include de Finetti's theorem, decision theory,
P. Golland, G. W. Wornell approximate inference (modern approaches and analysis of Monte
Carlo, variational inference, etc.), hierarchical modeling, (continuous
6.7800 Inference and Information and discrete) nonparametric Bayesian approaches, sensitivity and
Prereq: 6.3700, 6.3800, or 6.7700[J] robustness, and evaluation.
G (Spring) T. Broderick
4-0-8 units
Introduction to principles of Bayesian and non-Bayesian statistical Machine Learning

inference. Hypothesis testing and parameter estimation, sucient
statistics; exponential families. EM agorithm. Log-loss inference 6.3900 Introduction to Machine Learning
criterion, entropy and model capacity. Kullback-Leibler distance and Prereq: (6.1010 or 6.1210) and (18.06, 18.700, or 18.C06[J])
information geometry. Asymptotic analysis and large deviations U (Fall, Spring)
theory. Model order estimation; nonparametric statistics. 4-0-8 units
Computational issues and approximation techniques; Monte Carlo
methods. Selected topics such as universal inference and learning, Introduces principles, algorithms, and applications of machine
and universal features and neural networks. learning from the point of view of modeling and prediction;
P. Golland, G. W. Wornell formulation of learning problems; representation, over-tting,
generalization; clustering, classication, probabilistic modeling;
6.7810 Algorithms for Inference and methods such as support vector machines, hidden Markov
Prereq: 18.06 and (6.3700, 6.3800, or 6.7700[J]) models, and neural networks. Recommended prerequisites: 6.1210
G (Fall) and 18.06. Enrollment may be limited.
4-0-8 units D. S. Boning, P. Jaillet, L. P. Kaelbling
Introduction to statistical inference with probabilistic graphical

models. Directed and undirected graphical models, and factor
graphs, over discrete and Gaussian distributions; hidden Markov
models, linear dynamical systems. Sum-product and junction tree
algorithms; forward-backward algorithm, Kalman ltering and
smoothing. Min-sum and Viterbi algorithms. Variational methods,
mean-eld theory, and loopy belief propagation. Particle methods
and ltering. Building graphical models from data, including
parameter estimation and structure learning; Baum-Welch and Chow-
Liu algorithms. Selected special topics.
P. Golland, G. W. Wornell, D. Shah

6.3950 AI, Decision Making, and Society 6.7910[J] Statistical Learning Theory and Applications
Subject meets with 6.3952 Same subject as 9.520[J]
Prereq: None. Coreq: 6.1200[J], 6.3700, 6.3800, 18.05, or 18.600 Prereq: 6.3700, 6.7900, 18.06, or permission of instructor
U (Fall) G (Fall)
Introduction to fundamentals of modern data-driven decision- See description under subject 9.520[J].
making frameworks, such as causal inference and hypothesis testing T. Poggio, L. Rosasco
in statistics as well as supervised and reinforcement learning in
machine learning. Explores how these frameworks are being applied 6.7920[J] Reinforcement Learning: Foundations and Methods
in various societal contexts, including criminal justice, healthcare, (New)
nance, and social media. Emphasis on pinpointing the non- Same subject as 1.127[J], IDS.140[J]
obvious interactions, undesirable feedback loops, and unintended Prereq: 6.3700 or permission of instructor
consequences that arise in such settings. Enables students to G (Fall)
develop their own principled perspective on the interface of data- 4-0-8 units
driven decision making and society. Students taking graduate
version complete additional assignments. Examines reinforcement learning (RL) as a methodology for
A. Ozdaglar, A. Madry, A. Wilson approximately solving sequential decision-making under
uncertainty, with foundations in optimal control and machine
6.3952 AI, Decision Making, and Society learning. Provides a mathematical introduction to RL, including
Subject meets with 6.3950 dynamic programming, statistical, and empirical perspectives,
Prereq: None. Coreq: 6.1200[J], 6.3700, 6.3800, or 18.05 and special topics. Core topics include: dynamic programming,
G (Fall) special structures, nite and innite horizon Markov Decision
4-0-8 units Processes, value and policy iteration, Monte Carlo methods,
temporal dierences, Q-learning, stochastic approximation, and
Introduction to fundamentals of modern data-driven decision- bandits. Also covers approximate dynamic programming, including
making frameworks, such as causal inference and hypothesis testing value-based methods and policy space methods. Applications and
in statistics as well as supervised and reinforcement learning in examples drawn from diverse domains. Focus is mathematical,
machine learning. Explores how these frameworks are being applied but is supplemented with computational exercises. An analysis
in various societal contexts, including criminal justice, healthcare, prerequisite is suggested but not required; mathematical maturity is
nance, and social media. Emphasis on pinpointing the non- necessary.
obvious interactions, undesirable feedback loops, and unintended C. Wu
consequences that arise in such settings. Enables students to
develop their own principled perspective on the interface of data- 6.7930[J] Machine Learning for Healthcare
driven decision making and society. Students taking graduate Same subject as HST.956[J]
version complete additional assignments. Prereq: 6.3900, 6.4100, 6.7810, 6.7900, 6.8611, or 9.520[J]
A. Ozdaglar, A. Madry, A. Wilson G (Spring)
4-0-8 units
6.7900 Machine Learning
Prereq: 18.06 and (6.3700, 6.3800, or 18.600) Introduces students to machine learning in healthcare, including
G (Fall) the nature of clinical data and the use of machine learning for risk
3-0-9 units stratication, disease progression modeling, precision medicine,
diagnosis, subtype discovery, and improving clinical workflows.
Principles, techniques, and algorithms in machine learning from the Topics include causality, interpretability, algorithmic fairness,
point of view of statistical inference; representation, generalization, time-series analysis, graphical models, deep learning and transfer
and model selection; and methods such as linear/additive models, learning. Guest lectures by clinicians from the Boston area, and
active learning, boosting, support vector machines, non-parametric projects with real clinical data, emphasize subtleties of working with
Bayesian methods, hidden Markov models, Bayesian networks, clinical data and translating machine learning into clinical practice.
and convolutional and recurrent neural networks. Recommended Limited to 55.
prerequisite: 6.3900 or other previous experience in machine D. Sontag, P. Szolovits
learning. Enrollment may be limited.
C. Daskalakis, T. Jaakkola

6.7940 Dynamic Programming and Reinforcement Learning 6.4102 Articial Intelligence

Prereq: 6.3700 or 18.600 Prereq: 6.100A
G (Spring) G (Fall)
Not oered regularly; consult department Not oered regularly; consult department
Dynamic programming as a unifying framework for sequential Introduces representations, methods, and architectures used to
decision-making under uncertainty, Markov decision problems, build applications and to account for human intelligence from a
and stochastic control. Perfect and imperfect state information computational point of view. Covers applications of rule chaining,
models. Finite horizon and innite horizon problems, including constraint propagation, constrained search, inheritance, statistical
discounted and average cost formulations. Value and policy inference, and other problem-solving paradigms. Also addresses
iteration. Suboptimal methods. Approximate dynamic programming applications of identication trees, neural nets, genetic algorithms,
for large-scale problems, and reinforcement learning. Applications support-vector machines, boosting, and other learning paradigms.
and examples drawn from diverse domains. While an analysis Considers what separates human intelligence from that of other
prerequisite is not required, mathematical maturity is necessary. animals. Students taking graduate version complete additional
J. N. Tsitsiklis assignments.
K. Koile
6.7950 Advanced Topics in Control
Prereq: Permission of instructor 6.4110 Representation, Inference, and Reasoning in AI
G (Fall) Subject meets with 16.420
Not oered regularly; consult department Prereq: (16.09 and 16.410[J]) or (6.1010, 6.1210, and (6.3700 or
3-0-9 units 6.3800))
Can be repeated for credit. U (Fall)
3-0-9 units
Advanced study of topics in control. Specic focus varies from year to
year. An introduction to representations and algorithms for articial
Consult Department intelligence. Topics covered include: constraint satisfaction in
discrete and continuous problems, logical representation and
inference, Monte Carlo tree search, probabilistic graphical models
Articial Intelligence
and inference, planning in discrete and continuous deterministic and
6.4100 Articial Intelligence probabilistic models including MDPs and POMDPs.
Prereq: 6.100A L. P. Kaelbling, T. Lozano-Perez, N. Roy
U (Fall)
Not oered regularly; consult department 6.4120[J] Computational Cognitive Science
4-3-5 units Same subject as 9.66[J]
Introduces representations, methods, and architectures used to Prereq: 6.3700, 6.3800, 9.40, 18.05, 6.3900, or permission of
build applications and to account for human intelligence from a instructor
computational point of view. Covers applications of rule chaining, U (Fall)
constraint propagation, constrained search, inheritance, statistical 3-0-9 units
inference, and other problem-solving paradigms. Also addresses
applications of identication trees, neural nets, genetic algorithms, See description under subject 9.66[J].
support-vector machines, boosting, and other learning paradigms. J. Tenenbaum
Considers what separates human intelligence from that of other
animals. 6.4130[J] Principles of Autonomy and Decision Making
Sta Same subject as 16.410[J]
Subject meets with 6.4132[J], 16.413[J]
Prereq: 6.100B or 6.9080
U (Fall)
4-0-8 units

H. E. Shrobe

6.4132[J] Principles of Autonomy and Decision Making 6.4210 Robotic Manipulation

Subject meets with 6.4130[J], 16.410[J] Prereq: (6.100A and 6.3900) or permission of instructor
Prereq: 6.100B, 6.9080, or permission of instructor U (Fall)
3-0-9 units
Introduces the fundamental algorithmic approaches for creating
See description under subject 16.413[J]. robot systems that can autonomously manipulate physical objects in
B. C. Williams unstructured environments such as homes and restaurants. Topics
include perception (including approaches based on deep learning
6.4150[J] Articial Intelligence for Business (New) and approaches based on 3D geometry), planning (robot kinematics
Same subject as 15.563[J] and trajectory generation, collision-free motion planning, task-
Prereq: None and-motion planning, and planning under uncertainty), as well
G (Spring) as dynamics and control (both model-based and learning-based).
3-0-6 units Students taking graduate version complete additional assignments.
Students engage in extensive written and oral communication
See description under subject 15.563[J]. exercises.
M. Raghavan R. Tedrake
6.8110[J] Cognitive Robotics 6.4212 Robotic Manipulation

Prereq: (6.4100 or 16.413[J]) and (6.1200[J], 6.3700, or 16.09) Prereq: (6.100A and 6.3900) or permission of instructor
G (Spring) G (Fall)
See description under subject 16.412[J]. Enrollment may be limited. Introduces the fundamental algorithmic approaches for creating
B. C. Williams robot systems that can autonomously manipulate physical objects in
unstructured environments such as homes and restaurants. Topics
Robotics include perception (including approaches based on deep learning
and approaches based on 3D geometry), planning (robot kinematics
6.4200[J] Robotics: Science and Systems and trajectory generation, collision-free motion planning, task-
Same subject as 2.124[J], 16.405[J] and-motion planning, and planning under uncertainty), as well
Prereq: ((1.00 or 6.100A) and (2.003[J], 6.1010, 6.1210, or 16.06)) or as dynamics and control (both model-based and learning-based.
permission of instructor Students taking graduate version complete additional assignments.
U (Spring) T. P. Lozano-Perez, R. Tedrake
Presents concepts, principles, and algorithmic foundations for

robots and autonomous vehicles operating in the physical world.
Topics include sensing, kinematics and dynamics, state estimation,
computer vision, perception, learning, control, motion planning, and
embedded system development. Students design and implement
advanced algorithms on complex robotic platforms capable of agile
autonomous navigation and real-time interaction with the physical
word. Students engage in extensive written and oral communication
exercises. Enrollment limited.
L. Carlone, S. Karaman, D. Hadeld-Manell, J. Leonard

6.8200 Sensorimotor Learning 6.4420[J] Computational Design and Fabrication

Prereq: 6.3900 or 6.7900 Same subject as 2.0911[J]
G (Spring) Subject meets with 6.8420
3-0-9 units Prereq: Calculus II (GIR) and (6.1010 or permission of instructor)
U (Spring)
Provides an in-depth view of the state-of-the-art learning methods 3-0-9 units
for control and the know-how of applying these techniques. Topics
span reinforcement learning, self-supervised learning, imitation Introduces computational aspects of computer-aided design
learning, model-based learning, and advanced deep learning and manufacturing. Explores relevant methods in the context of
architectures, and specic machine learning challenges unique to additive manufacturing (e.g., 3D printing). Topics include computer
building sensorimotor systems. Discusses how to identify if learning- graphics (geometry modeling, solid modeling, procedural modeling),
based control can help solve a particular problem, how to formulate physically-based simulation (kinematics, nite element method), 3D
the problem in the learning framework, and what algorithm to use. scanning/geometry processing, and an overview of 3D fabrication
Applications of algorithms in robotics, logistics, recommendation methods. Exposes students to the latest research in computational
systems, playing games, and other control domains covered. fabrication. Students taking the graduate version complete
Instruction involves two lectures a week, practical experience additional assignments.
through exercises, discussion of current research directions, and a W. Matusik
group project.
P. Agrawal 6.8410 Shape Analysis
Prereq: Calculus II (GIR), 18.06, and (6.8300 or 6.4400)
6.8210 Underactuated Robotics Acad Year 2023-2024: Not oered
Prereq: 18.03 and 18.06 Acad Year 2024-2025: G (Spring)
3-0-9 units
Introduces mathematical, algorithmic, and statistical tools needed
Covers nonlinear dynamics and control of underactuated mechanical to analyze geometric data and to apply geometric techniques
systems, with an emphasis on computational methods. Topics to data analysis, with applications to elds such as computer
include the nonlinear dynamics of robotic manipulators, applied graphics, machine learning, computer vision, medical imaging,
optimal and robust control and motion planning. Discussions include and architecture. Potential topics include applied introduction
examples from biology and applications to legged locomotion, to dierential geometry, discrete notions of curvature, metric
compliant manipulation, underwater robots, and flying machines. embedding, geometric PDE via the nite element method (FEM) and
R. Tedrake discrete exterior calculus (DEC),; computational spectral geometry
and relationship to graph-based learning, correspondence and
mapping, level set method, descriptor, shape collections, optimal
Graphics
transport, and vector eld design.
6.4400 Computer Graphics J. Solomon
Prereq: 6.1010 and (18.06 or 18.C06[J])
U (Fall) 6.8420 Computational Design and Fabrication
3-0-9 units Subject meets with 2.0911[J], 6.4420[J]
Prereq: Calculus II (GIR) and (6.1010 or permission of instructor)
Introduction to computer graphics algorithms, soware and G (Spring)
hardware. Topics include ray tracing, the graphics pipeline, 3-0-9 units
transformations, texture mapping, shadows, sampling, global
illumination, splines, animation and color. Introduces computational aspects of computer-aided design
F. P. Durand, W. Matusik, J. Solomon and manufacturing. Explores relevant methods in the context of
additive manufacturing (e.g., 3D printing). Topics include computer
graphics (geometry modeling, solid modeling, procedural modeling),
physically-based simulation (kinematics, nite element method), 3D
scanning/geometry processing, and an overview of 3D fabrication
methods. Exposes students to the latest research in computational
fabrication. Students taking graduate version complete additional
assignments.
W. Matusik

Human-Computer Interaction & Society 6.4570[J] Creating Video Games

Same subject as CMS.611[J]
6.4510 Engineering Interactive Technologies Prereq: 6.100A or CMS.301
Prereq: 6.1020, 6.2050, 6.2060, 6.9010, or permission of instructor U (Fall)
U (Fall) 3-3-6 units. HASS-A
Not oered regularly; consult department See description under subject CMS.611[J]. Limited to 36.
1-5-6 units P. Tan, S. Verrilli, R. Eberhardt, A. Grant
Provides instruction in building cutting-edge interactive
technologies, explains the underlying engineering concepts, and 6.4590[J] Foundations of Information Policy
shows how those technologies evolved over time. Students use Same subject as STS.085[J]
a studio format (i.e., extended periods of time) for constructing Subject meets with STS.487
soware and hardware prototypes. Topics include interactive Prereq: Permission of instructor
technologies, such as multi-touch, augmented reality, haptics, Acad Year 2023-2024: Not oered
wearables, and shape-changing interfaces. In a group project, Acad Year 2024-2025: U (Fall)
students build their own interactive hardware/soware prototypes 3-0-9 units. HASS-S
and present them in a live demo at the end of term. Enrollment may Studies the growth of computer and communications technology and
be limited. the new legal and ethical challenges that reflect tensions between
S. Mueller individual rights and societal needs. Topics include computer crime;
intellectual property restrictions on soware; encryption, privacy,
6.4530[J] Principles and Practice of Assistive Technology and national security; academic freedom and free speech. Students
Same subject as 2.78[J], HST.420[J] meet and question technologists, activists, law enforcement agents,
Prereq: Permission of instructor journalists, and legal experts. Instruction and practice in oral and
U (Fall) written communication provided. Students taking graduate version
Not oered regularly; consult department complete additional assignments. Enrollment limited.
2-4-6 units H. Abelson, M. Fischer, D. Weitzner
Students work closely with people with disabilities to develop
assistive and adaptive technologies that help them live more 6.8510 Intelligent Multimodal User Interfaces
independently. Covers design methods and problem-solving Prereq: (6.1020 and 6.4100) or permission of instructor
strategies; human factors; human-machine interfaces; community G (Spring)
perspectives; social and ethical aspects; and assistive technology 3-0-9 units
for motor, cognitive, perceptual, and age-related impairments. Prior Implementation and evaluation of intelligent multi-modal user
knowledge of one or more of the following areas useful: soware; interfaces, taught from a combination of hands-on exercises and
electronics; human-computer interaction; cognitive science; papers from the original literature. Topics include basic technologies
mechanical engineering; control; or MIT hobby shop, MIT PSC, or for handling speech, vision, pen-based interaction, and other
other relevant independent project experience. Enrollment may be modalities, as well as various techniques for combining modalities.
limited. Substantial readings and a term project, where students build a
R. C. Miller, J. E. Greenberg, J. J. Leonard program that illustrates one or more of the themes of the course.
R. Davis
6.4550[J] Interactive Music Systems
Same subject as 21M.385[J]
Subject meets with 21M.585
Prereq: (6.1010 and 21M.301) or permission of instructor
U (Fall, Spring)
3-0-9 units. HASS-A
See description under subject 21M.385[J]. Limited to 36.

E. Egozy, L. Kaelbling

6.8530 Interactive Data Visualization 6.8701 Computational Biology: Genomes, Networks, Evolution
Prereq: 6.1020 Subject meets with 6.8700[J], HST.507[J]
G (Spring) Prereq: (Biology (GIR), 6.1210, and 6.3700) or permission of
3-0-9 units instructor
Credit cannot also be received for 6.C35[J], 6.C85[J], 11.154, 11.454, U (Fall)
11.C35[J], 11.C85[J] 3-0-9 units
Interactive visualization provides a means of making sense of a Covers the algorithmic and machine learning foundations of
world awash in data. Covers the techniques and algorithms for computational biology, combining theory with practice. Principles
creating eective visualizations, using principles from graphic of algorithm design, influential problems and techniques, and
design, perceptual psychology, and cognitive science. Short analysis of large-scale biological datasets. Topics include (a)
assignments build familiarity with the data analysis and visualization genomes: sequence analysis, gene nding, RNA folding, genome
design process, and a nal project provides experience designing, alignment and assembly, database search; (b) networks: gene
implementing, and deploying an explanatory narrative visualization expression analysis, regulatory motifs, biological network analysis;
or visual analysis tool to address a concrete challenge. (c) evolution: comparative genomics, phylogenetics, genome
A. Satyanarayan duplication, genome rearrangements, evolutionary theory. These
are coupled with fundamental algorithmic techniques including:
dynamic programming, hashing, Gibbs sampling, expectation
Computational Biology
maximization, hidden Markov models, stochastic context-free
6.4710[J] Evolutionary Biology: Concepts, Models and grammars, graph clustering, dimensionality reduction, Bayesian
Computation networks.
Same subject as 7.33[J] M. Kellis
Prereq: (6.100A and 7.03) or permission of instructor
U (Spring) 6.8710[J] Computational Systems Biology: Deep Learning in the
3-0-9 units Life Sciences
Same subject as HST.506[J]
See description under subject 7.33[J]. Subject meets with 6.8711[J], 20.390[J], 20.490
R. Berwick, D. Bartel Prereq: Biology (GIR) and (6.3700 or 18.600)
6.8700[J] Advanced Computational Biology: Genomes, Acad Year 2024-2025: G (Spring)
Networks, Evolution 3-0-9 units
Same subject as HST.507[J]
Subject meets with 6.8701 Presents innovative approaches to computational problems in the
Prereq: (Biology (GIR), 6.1210, and 6.3700) or permission of life sciences, focusing on deep learning-based approaches with
instructor comparisons to conventional methods. Topics include protein-
G (Fall) DNA interaction, chromatin accessibility, regulatory variant
4-0-8 units interpretation, medical image understanding, medical record
understanding, therapeutic design, and experiment design (the
See description for 6.047. Additionally examines recent publications choice and interpretation of interventions). Focuses on machine
in the areas covered, with research-style assignments. A more learning model selection, robustness, and interpretation. Teams
substantial nal project is expected, which can lead to a thesis and complete a multidisciplinary nal research project using TensorFlow
publication. or other framework. Provides a comprehensive introduction to each
M. Kellis life sciences problem, but relies upon students understanding
probabilistic problem formulations. Students taking graduate
version complete additional assignments.
D. K. Giord

6.8711[J] Computational Systems Biology: Deep Learning in the Biomedical & Health
Life Sciences
Same subject as 20.390[J] 6.4800[J] Biomedical Systems: Modeling and Inference
Subject meets with 6.8710[J], 20.490, HST.506[J] Same subject as 22.54[J]
Prereq: (7.05 and (6.100B or 6.9080)) or permission of instructor Prereq: (6.3100 and (18.06 or 18.C06[J])) or permission of instructor
Acad Year 2023-2024: Not oered U (Spring)
Acad Year 2024-2025: U (Spring) 4-4-4 units
3-0-9 units
Medically motivated examples of problems in human health that
Presents innovative approaches to computational problems in the engage students in systems modeling, signal analysis and inference,
life sciences, focusing on deep learning-based approaches with and design. Content draws on two domains, rst by establishing a
comparisons to conventional methods. Topics include protein- model of the human cardiovascular system with signal analysis and
DNA interaction, chromatin accessibility, regulatory variant inference applications of electrocardiograms in health and disease.
interpretation, medical image understanding, medical record In a second topic, medical imaging by MRI is motivated by examples
understanding, therapeutic design, and experiment design (the of common clinical decision making, followed by laboratory work
choice and interpretation of interventions). Focuses on machine with technology and instrumentation with the functionality of
learning model selection, robustness, and interpretation. Teams commercial diagnostic scanners. Students apply concepts from
complete a multidisciplinary nal research project using TensorFlow lectures in labs for data collection for image reconstruction, image
or other framework. Provides a comprehensive introduction to each analysis, and inference by their own design. Labs further include kits
life sciences problem, but relies upon students understanding for interactive and portable low-cost devices that can be assembled
probabilistic problem formulations. Students taking graduate by the students to demonstrate fundamental building blocks of an
version complete additional assignments. MRI system.
D. K. Giord E. Adalsteinsson, T. Heldt, C. M. Stultz, J. K. White
6.8720[J] Principles of Synthetic Biology 6.4810[J] Cellular Neurophysiology and Computing

Same subject as 20.405[J] Same subject as 2.791[J], 9.21[J], 20.370[J]
Subject meets with 6.8721[J], 20.305[J] Subject meets with 2.794[J], 6.4812[J], 9.021[J], 20.470[J], HST.541[J]
Prereq: None Prereq: (Physics II (GIR), 18.03, and (2.005, 6.2000, 6.3000, 10.301,
G (Fall) or 20.110[J])) or permission of instructor
See description under subject 20.405[J]. 5-2-5 units
R. Weiss Integrated overview of the biophysics of cells from prokaryotes
to neurons, with a focus on mass transport and electrical signal
6.8721[J] Principles of Synthetic Biology generation across cell membrane. First third of course focuses
Same subject as 20.305[J] on mass transport through membranes: diusion, osmosis,
Subject meets with 6.8720[J], 20.405[J] chemically mediated, and active transport. Second third focuses
Prereq: None on electrical properties of cells: ion transport to action potential
U (Fall) generation and propagation in electrically excitable cells. Synaptic
3-0-9 units transmission. Electrical properties interpreted via kinetic and
See description under subject 20.305[J]. molecular properties of single voltage-gated ion channels. Final third
R. Weiss focuses on biophysics of synaptic transmission and introduction
to neural computing. Laboratory and computer exercises illustrate
the concepts. Students taking graduate version complete dierent
assignments. Preference to juniors and seniors.
J. Han, T. Heldt

6.4812[J] Cellular Neurophysiology and Computing 6.4822[J] Quantitative Physiology: Organ Transport Systems
Same subject as 2.794[J], 9.021[J], 20.470[J], HST.541[J] Same subject as 2.796[J]
Subject meets with 2.791[J], 6.4810[J], 9.21[J], 20.370[J] Subject meets with 2.792[J], 6.4820[J], HST.542[J]
Prereq: (Physics II (GIR), 18.03, and (2.005, 6.2000, 6.3000, 10.301, Prereq: 6.4810[J] and (2.006 or 6.2300)
or 20.110[J])) or permission of instructor G (Fall)
5-2-5 units
Application of the principles of energy and mass flow to major
Integrated overview of the biophysics of cells from prokaryotes human organ systems. Anatomical, physiological and clinical
to neurons, with a focus on mass transport and electrical signal features of the cardiovascular, respiratory and renal systems.
generation across cell membrane. First third of course focuses Mechanisms of regulation and homeostasis. Systems, features
on mass transport through membranes: diusion, osmosis, and devices that are most illuminated by the methods of physical
chemically mediated, and active transport. Second third focuses sciences and engineering models. Required laboratory work
on electrical properties of cells: ion transport to action potential includes animal studies. Students taking graduate version complete
generation and propagation in electrically excitable cells. Synaptic additional assignments.
transmission. Electrical properties interpreted via kinetic and T. Heldt, R. G. Mark
molecular properties of single voltage-gated ion channels. Final third
focuses on biophysics of synaptic transmission and introduction 6.4830[J] Fields, Forces and Flows in Biological Systems
to neural computing. Laboratory and computer exercises illustrate Same subject as 2.793[J], 20.330[J]
the concepts. Students taking graduate version complete dierent Prereq: Biology (GIR), Physics II (GIR), and 18.03
assignments. U (Spring)
J. Han, T. Heldt 4-0-8 units
6.4820[J] Quantitative and Clinical Physiology See description under subject 20.330[J].
Same subject as 2.792[J], HST.542[J] J. Han, S. Manalis
Subject meets with 2.796[J], 6.4822[J]
Prereq: Physics II (GIR), 18.03, or permission of instructor 6.4832[J] Fields, Forces, and Flows in Biological Systems
U (Fall) Same subject as 2.795[J], 10.539[J], 20.430[J]
4-2-6 units Prereq: Permission of instructor
G (Fall)
Application of the principles of energy and mass flow to major 3-0-9 units
human organ systems. Anatomical, physiological and clinical
features of the cardiovascular, respiratory and renal systems. See description under subject 20.430[J].
Mechanisms of regulation and homeostasis. Systems, features M. Bathe, A. J. Grodzinsky
and devices that are most illuminated by the methods of physical
sciences and engineering models. Required laboratory work 6.4840[J] Molecular, Cellular, and Tissue Biomechanics
includes animal studies. Students taking graduate version complete Same subject as 2.797[J], 3.053[J], 20.310[J]
additional assignments. Subject meets with 2.798[J], 3.971[J], 6.4842[J], 10.537[J], 20.410[J]
T. Heldt, R. G. Mark Prereq: Biology (GIR) and 18.03
U (Spring)
4-0-8 units

M. Bathe, K. Ribbeck, P. T. So
6.4842[J] Molecular, Cellular, and Tissue Biomechanics

Same subject as 2.798[J], 3.971[J], 10.537[J], 20.410[J]
Subject meets with 2.797[J], 3.053[J], 6.4840[J], 20.310[J]
Prereq: Biology (GIR) and 18.03
G (Spring)
3-0-9 units

M. Bathe, K. Ribbeck, P. T. So

6.4860[J] Medical Device Design 6.8800[J] Biomedical Signal and Image Processing
Same subject as 2.750[J] Same subject as 16.456[J], HST.582[J]
Subject meets with 2.75[J], 6.4861[J], HST.552[J] Subject meets with 6.8801[J], HST.482[J]
Prereq: 2.008, 6.2040, 6.2050, 6.2060, 22.071, or permission of Prereq: (6.3700 and (2.004, 6.3000, 16.002, or 18.085)) or
instructor permission of instructor
U (Spring) Acad Year 2023-2024: G (Spring)
3-3-6 units Acad Year 2024-2025: Not oered
3-1-8 units
See description under subject 2.750[J]. Enrollment limited.
A. H. Slocum, E. Roche, N. C. Hanumara, G. Traverso, A. Pennes Fundamentals of digital signal processing with emphasis on
problems in biomedical research and clinical medicine. Basic
6.4861[J] Medical Device Design principles and algorithms for processing both deterministic and
Same subject as 2.75[J], HST.552[J] random signals. Topics include data acquisition, imaging, ltering,
Subject meets with 2.750[J], 6.4860[J] coding, feature extraction, and modeling. Lab projects, performed
Prereq: 2.008, 6.2040, 6.2050, 6.2060, 22.071, or permission of in MATLAB, provide practical experience in processing physiological
instructor data, with examples from cardiology, speech processing, and
G (Spring) medical imaging. Lectures cover signal processing topics relevant
3-3-6 units to the lab exercises, as well as background on the biological signals
processed in the labs. Students taking graduate version complete
See description under subject 2.75[J]. Enrollment limited. additional assignments.
A. H. Slocum, E. Roche, N. C. Hanumara, G. Traverso, A. Pennes J. Greenberg, E. Adalsteinsson, W. Wells
6.4880[J] Biological Circuit Engineering Laboratory 6.8801[J] Biomedical Signal and Image Processing
Same subject as 20.129[J] Same subject as HST.482[J]
Prereq: Biology (GIR) and Calculus II (GIR) Subject meets with 6.8800[J], 16.456[J], HST.582[J]
U (Spring) Prereq: (6.3700 or permission of instructor) and (2.004, 6.3000,
2-8-2 units. Institute LAB 16.002, or 18.085)
See description under subject 20.129[J]. Enrollment limited. Acad Year 2023-2024: U (Spring)
T. Lu, R. Weiss Acad Year 2024-2025: Not oered
3-1-8 units
6.4900 Introduction to EECS via Medical Technology Fundamentals of digital signal processing with emphasis on
Prereq: Calculus II (GIR) and Physics II (GIR) problems in biomedical research and clinical medicine. Basic
U (Spring) principles and algorithms for processing both deterministic and
4-4-4 units. Institute LAB random signals. Topics include data acquisition, imaging, ltering,
Explores biomedical signals generated from electrocardiograms, coding, feature extraction, and modeling. Lab projects, performed
glucose detectors or ultrasound images, and magnetic resonance in MATLAB, provide practical experience in processing physiological
images. Topics include physical characterization and modeling of data, with examples from cardiology, speech processing, and
systems in the time and frequency domains; analog and digital medical imaging. Lectures cover signal processing topics relevant
signals and noise; basic machine learning including decision trees, to the lab exercises, as well as background on the biological signals
clustering, and classication; and introductory machine vision. processed in the labs. Students taking graduate version complete
Labs designed to strengthen background in signal processing and additional assignments.
machine learning. Students design and run structured experiments, J. Greenberg, E. Adalsteinsson, W. Wells
and develop and test procedures through further experimentation.
C. M. Stultz, E. Adalsteinsson

6.8810[J] Data Acquisition and Image Reconstruction in MRI 6.8301 Advances in Computer Vision
Same subject as HST.580[J] Subject meets with 6.8300
Prereq: 6.3010 Prereq: (6.1200[J] or 6.3700) and (18.06 or 18.C06[J])
Acad Year 2023-2024: G (Fall) U (Spring)
Acad Year 2024-2025: Not oered 4-0-11 units
3-0-9 units
Advanced topics in computer vision with a focus on the use of
Applies analysis of signals and noise in linear systems, sampling, machine learning techniques and applications in graphics and
and Fourier properties to magnetic resonance (MR) imaging human-computer interface. Covers image representations, texture
acquisition and reconstruction. Provides adequate foundation models, structure-from-motion algorithms, Bayesian techniques,
for MR physics to enable study of RF excitation design, ecient object and scene recognition, tracking, shape modeling, and image
Fourier sampling, parallel encoding, reconstruction of non-uniformly databases. Applications may include face recognition, multimodal
sampled data, and the impact of hardware imperfections on interaction, interactive systems, cinematic special eects, and
reconstruction performance. Surveys active areas of MR research. photorealistic rendering. Includes instruction and practice in written
Assignments include Matlab-based work with real data. Includes and oral communication. Students taking graduate version complete
visit to a scan site for human MR studies. additional assignments.
E. Adalsteinsson W. T. Freeman, M. Konakovic Lukovic, V. Sitzmann
6.8830[J] Signal Processing by the Auditory System: Perception 6.8320 Advanced Topics in Computer Vision
Same subject as HST.716[J] Prereq: 6.801, 6.8300, or permission of instructor
Prereq: (6.3000 and (6.3700 or 6.3702)) or permission of instructor G (Fall)
G (Fall) Not oered regularly; consult department
Not oered regularly; consult department 3-0-9 units
3-0-9 units Can be repeated for credit.
Studies information processing performance of the human auditory Seminar exploring advanced research topics in the eld of computer
system in relation to current physiological knowledge. Examines vision; focus varies with lecturer. Typically structured around
mathematical models for the quantication of auditory-based discussion of assigned research papers and presentations by
behavior and the relation between behavior and peripheral students. Example research areas explored in this seminar include
physiology, reflecting the tono-topic organization and stochastic learning in vision, computational imaging techniques, multimodal
responses of the auditory system. Mathematical models of human-computer interaction, biomedical imaging, representation
psychophysical relations, incorporating quantitative knowledge of and estimation methods used in modern computer vision.
physiological transformations by the peripheral auditory system. W. T. Freeman, B. K. P. Horn, A. Torralba
L. D. Braida
6.8370 Advanced Computational Photography
Vision
Prereq: Calculus II (GIR) and 6.1020
6.8300 Advances in Computer Vision Acad Year 2023-2024: Not oered
Subject meets with 6.8301 Acad Year 2024-2025: G (Fall)
Prereq: (6.1200[J] or 6.3700) and (18.06 or 18.C06[J]) 3-0-9 units
G (Spring) Presents fundamentals and applications of hardware and soware
3-0-9 units techniques used in digital and computational photography, with an
Advanced topics in computer vision with a focus on the use of emphasis on soware methods. Provides sucient background to
machine learning techniques and applications in graphics and implement solutions to photographic challenges and opportunities.
human-computer interface. Covers image representations, texture Topics include cameras and image formation, image processing
models, structure-from-motion algorithms, Bayesian techniques, and image representations, high-dynamic-range imaging, human
object and scene recognition, tracking, shape modeling, and image visual perception and color, single view 3-D model reconstruction,
databases. Applications may include face recognition, multimodal morphing, data-rich photography, super-resolution, and image-
interaction, interactive systems, cinematic special eects, and based rendering. Students taking graduate version complete
photorealistic rendering. Covers topics complementary to 6.8390. additional assignments.
Students taking graduate version complete additional assignments. F. P. Durand
W. T. Freeman, M. Konakovic Lukovic, V. Sitzmann

6.8371 Digital and Computational Photography 6.8620[J] Spoken Language Processing

Subject meets with 6.8370 Same subject as HST.728[J]
Prereq: Calculus II (GIR) and 6.1010 Prereq: 6.3000 and 6.3900
Acad Year 2023-2024: Not oered Acad Year 2023-2024: G (Spring)
Acad Year 2024-2025: U (Fall) Acad Year 2024-2025: Not oered
Presents fundamentals and applications of hardware and soware Introduces the rapidly developing eld of spoken language
techniques used in digital and computational photography, with an processing including automatic speech recognition. Topics include
emphasis on soware methods. Provides sucient background to acoustic theory of speech production, acoustic-phonetics, signal
implement solutions to photographic challenges and opportunities. representation, acoustic and language modeling, search, hidden
Topics include cameras and image formation, image processing Markov modeling, neural networks models, end-to-end deep
and image representations, high-dynamic-range imaging, human learning models, and other machine learning techniques applied
visual perception and color, single view 3-D model reconstruction, to speech and language processing topics. Lecture material
morphing, data-rich photography, super-resolution, and image- intersperses theory with practice. Includes problem sets, laboratory
based rendering. Students taking graduate version complete exercises, and open-ended term project.
additional assignments. J. R. Glass
F. P. Durand
6.8630[J] Natural Language and the Computer Representation of
Natural Language Processing & Speech Knowledge
Same subject as 9.611[J], 24.984[J]
6.8610 Quantitative Methods for Natural Language Processing Prereq: 6.4100
Subject meets with 6.8611 Acad Year 2023-2024: Not oered
Prereq: 6.3900 and (18.06 or 18.C06[J]) Acad Year 2024-2025: G (Spring)
3-0-9 units Explores the relationship between the computer representation and
Introduces the study of human language from a computational acquisition of knowledge and the structure of human language, its
perspective, including syntactic, semantic and discourse processing acquisition, and hypotheses about its dierentiating uniqueness.
models. Emphasizes machine learning methods and algorithms. Emphasizes development of analytical skills necessary to judge the
Uses these methods and models in applications such as syntactic computational implications of grammatical formalisms and their role
parsing, information extraction, statistical machine translation, in connecting human intelligence to computational intelligence. Uses
dialogue systems. Students taking graduate version complete concrete examples to illustrate particular computational issues in
additional assignments. this area.
J. Andreas, J. Glass R. C. Berwick
6.8611 Quantitative Methods for Natural Language Processing

Prereq: 6.3900 and (18.06 or 18.C06[J])
U (Fall)
4-0-11 units
Introduces the study of human language from a computational

perspective, including syntactic, semantic and discourse processing
models. Emphasizes machine learning methods and algorithms.
Uses these methods and models in applications such as syntactic
parsing, information extraction, statistical machine translation,
dialogue systems. Instruction and practice in oral and written
communication provided. Students taking graduate version complete
J. Andreas, J. Glass

Cross-cutting EECS Subjects 6.9030 Strobe Project Laboratory

Prereq: Physics II (GIR) or permission of instructor
6.9000 Engineering for Impact U (Fall, Spring)
Prereq: 6.1910, 6.2000, and 6.3100 2-8-2 units. Institute LAB
U (Spring) Application of electronic flash sources to measurement and
2-3-7 units photography. First half covers fundamentals of photography and
Students work in large teams to engineer hardware/soware electronic flashes, including experiments on application of electronic
systems that solve important problems in society. Topics include flash to photography, stroboscopy, motion analysis, and high-
requirements, specications, system design and partitioning, speed videography. Students write four extensive lab reports. In
detailed engineering design, prototyping and implementation, the second half, students work in small groups to select, design,
test and verication, and the ethical implications of these choices. and execute independent projects in measurement or photography
Explores case studies of existing hardware/soware systems to that apply learned techniques. Project planning and execution skills
understand implications of dierent system design choices. Teams are discussed and developed over the term. Students engage in
design and build functional prototypes of useful systems. Grading is extensive written and oral communication exercises. Enrollment
based on individual- and team-based elements. Enrollment may be limited.
limited due to stang and space requirements. J. K. Vandiver, J. W. Bales
J. Voldman
6.9080 Introduction to EECS via Robotics
6.9010 Introduction to EECS via Interconnected Embedded Prereq: 6.100A or permission of instructor
Systems U (Spring)
Prereq: 6.100A; Coreq: Physics II (GIR) Not oered regularly; consult department
U (Spring) 2-4-6 units. Institute LAB
Not oered regularly; consult department An integrated introduction to electrical engineering and computer
1-5-6 units. Institute LAB science, taught using substantial laboratory experiments with
Introduction to embedded systems in the context of connected mobile robots. Key issues in the design of engineered artifacts
devices, wearables, and the "Internet of Things" (IoT). Topics operating in the natural world: measuring and modeling system
include microcontrollers, energy utilization, algorithmic eciency, behaviors; assessing errors in sensors and eectors; specifying
interfacing with sensors, networking, cryptography, and local versus tasks; designing solutions based on analytical and computational
distributed computation. Students design, make, and program an models; planning, executing, and evaluating experimental tests
Internet-connected wearable or handheld device. In the nal project, of performance; rening models and designs. Issues addressed in
student teams design and demo their own server-connected IoT the context of computer programs, control systems, probabilistic
system. Enrollment limited; preference to rst- and second-year inference problems, circuits and transducers, which all play
students. important roles in achieving robust operation of a large variety of
S. Mueller, J. D. Steinmeyer, J. Voldman engineered systems.
D. M. Freeman, A. Hartz, L. P. Kaelbling, T. Lozano-Perez
6.9020[J] How to Make (Almost) Anything
Same subject as 4.140[J], MAS.863[J]
Prereq: Permission of instructor
G (Fall)
3-9-6 units
See description under subject MAS.863[J].

N. Gershenfeld, J. DiFrancesco, J. Lavallee, G. Darcey

6.UAR Seminar in Undergraduate Advanced Research 6.910A Design Thinking and Innovation Leadership for Engineers
Prereq: Permission of instructor Engineering School-Wide Elective Subject.
U (Fall, Spring) Oered under: 2.723A, 6.910A, 16.662A
2-0-4 units Prereq: None
Can be repeated for credit. U (Fall, Spring; rst half of term)
2-0-1 units
Instruction in eective undergraduate research, including
choosing and developing a research topic, surveying previous Introductory subject in design thinking and innovation. Develops
work and publications, research topics in EECS and the School students' ability to conceive, implement, and evaluate successful
of Engineering, industry best practices, design for robustness, projects in any engineering discipline. Lessons focus on an
technical presentation, authorship and collaboration, and ethics. iterative design process, a systems-thinking approach for
Students engage in extensive written and oral communication stakeholder analysis, methods for articulating design concepts,
exercises, in the context of an approved advanced research project. methods for concept selection, and techniques for testing with
A total of 12 units of credit is awarded for completion of the fall and users.
subsequent spring term oerings. Application required; consult EECS B. Kotelly
SuperUROP website for more information.
D. Katabi, A. P. Chandrakasan 6.910B Design Thinking and Innovation Project
Engineering School-Wide Elective Subject.
6.UAT Oral Communication Oered under: 2.723B, 6.910B, 16.662B
Prereq: None Prereq: 6.910A
U (Fall) U (Fall, Spring; second half of term)
Provides instruction in aspects of eective technical oral Project-based subject. Students employ design-thinking techniques
presentations and exposure to communication skills useful in learned in 6.902A to develop a robust speech-recognition
a workplace setting. Students create, give and revise a number application using a web-based platform. Students practice in
of presentations of varying length targeting a range of dierent leadership and teamwork skills as they collaboratively conceive,
audiences. Enrollment may be limited. implement, and iteratively rene their designs based on user
T. L. Eng feedback. Topics covered include techniques for leading the creative
process in teams, the ethics of engineering systems, methods
for articulating designs with group collaboration, identifying and
Gordon Engineering Leadership Program
reconciling paradoxes of engineering designs, and communicating
6.9101[J] Introduction to Design Thinking and Innovation in solution concepts with impact. Students present oral presentations
Engineering and receive feedback to sharpen their communication skills.
Same subject as 2.7231[J], 16.6621[J] B. Kotelly
Prereq: None
U (Fall, Spring; rst half of term) 6.9110 Engineering Leadership Lab
2-0-1 units Engineering School-Wide Elective Subject.
Oered under: 6.9110, 16.650
Introduces students to concepts of design thinking and innovation Subject meets with 6.9130[J], 16.667[J]
that can be applied to any engineering discipline. Focuses on Prereq: None. Coreq: 6.9120; or permission of instructor
introducing an iterative design process, a systems-thinking approach U (Fall, Spring)
for stakeholder analysis, methods for articulating design concepts, 0-2-1 units
methods for concept selection, and techniques for testing with Can be repeated for credit.
users. Provides an opportunity for rst-year students to explore
product or system design and development, and to build their See description under subject 6.9130. Preference to students
understanding of what it means to lead and coordinate projects in enrolled in the Bernard M. Gordon-MIT Engineering Leadership
engineering design. Subject can count toward the 6-unit discovery- Program.
focused credit limit for rst-year students. Enrollment limited to 25; L. McGonagle, J. Feiler
priority to rst-year students.
B. Kotelly

6.9120 Engineering Leadership 6.9140 Project Engineering

Engineering School-Wide Elective Subject. Engineering School-Wide Elective Subject.
Oered under: 6.9120, 16.651 Oered under: 6.9140, 16.669
Prereq: None. Coreq: 6.9110; or permission of instructor Prereq: (6.910A and (6.9110 or 6.9120)) or permission of instructor
U (Fall, Spring) U (IAP)
Can be repeated for credit.
Students attend and participate in a four-day o-site workshop
Exposes students to the models and methods of engineering covering an introduction to basic principles, methods, and tools
leadership within the contexts of conceiving, designing, for project management in a realistic context. In teams, students
implementing and operating products, processes and systems. create a plan for a project of their choice in one of several areas,
Introduces the Capabilities of Eective Engineering Leaders, and including: aircra modication, factory automation, flood prevention
models and theories related to the capabilities. Discusses the engineering, solar farm engineering, small-business digital
appropriate times and reasons to use particular models to deliver transformation/modernization, and disaster response, among
engineering success. Includes occasional guest speakers or panel others. Develops skills applicable to the planning and management
discussions. May be repeated for credit once with permission of complex engineering projects. Topics include cost-benet
of instructor. Preference to rst-year students in the Gordon analysis, resource and cost estimation, and project control and
Engineering Leadership Program. delivery which are practiced during an experiential, team-based
J. Magarian activity. Case studies highlight projects in both hardware/soware
and consumer packaged goods. Preference to students in the
6.9130 Engineering Leadership Lab Bernard M. Gordon-MIT Engineering Leadership Program.
Engineering School-Wide Elective Subject. O. de Weck, J. Feiler, L. McGonagle, R. Rahaman
Oered under: 6.9130, 16.667
Subject meets with 6.9110[J], 16.650[J] 6.9150[J] Leading Innovation in Teams
Prereq: 6.910A, 6.9110, 6.9120, or permission of instructor Same subject as 16.671[J]
U (Fall, Spring) Prereq: None
Can be repeated for credit. Not oered regularly; consult department
3-0-6 units
Advances students' leadership, teamwork and communication skills
through further exposure to leadership frameworks, models, and Empowers future innovators in engineering and technology with a
cases within an engineering context in an interactive, practice- foundation of leadership and teamwork skills. Grounded in research
based environment. Students coach others, assess performance, but practical in focus, equips students with leadership competencies
and lead guided reflections on individual and team successes, while such as building self-awareness, motivating and developing others,
discovering opportunities for improvement. Students assist with influencing without authority, managing conflict, and communicating
programmatic planning and implementation of role-play simulations, eectively. Teamwork skills include how to convene, launch, and
small group discussions, and performance and peer assessments develop various types of teams, including project teams. Reviews
by and of other students and by instructors. Includes frequent recent advances in implementing innovations and building personal
engineering industry-guest participation and involvement. Content is capacity for lifelong learning as a leading innovator. Enrollment
frequently student-led. Second year Gordon Engineering Leadership limited to seating capacity of classroom. Admittance may be
Program (GEL) Program students register for 6.913. Preference to controlled by lottery.
students enrolled in the second year of the Gordon-MIT Engineering D. Nino, J. Schindall
Leadership Program.
L. McGonagle, J. Feiler 6.9160[J] Engineering Innovation: Global Security Systems
Prereq: None
U (Spring)
3-3-6 units

F. Murray, V. Bulovic, G. Keselman

6.9260 Multistakeholder Negotiation for Technical Experts 6.EPE UPOP Engineering Practice Experience
Prereq: None Engineering School-Wide Elective Subject.
G (Spring) Oered under: 1.EPE, 2.EPE, 3.EPE, 6.EPE, 8.EPE, 10.EPE, 15.EPE,
2-0-4 units 16.EPE, 20.EPE, 22.EPE
Prereq: None
Presents strategies and proven techniques for improving U (Fall, Spring)
communications, relationships, and decision-making in groups 0-0-1 units
using simulations, role-plays, case studies, and video analysis. Aims Can be repeated for credit.
to provide the skill set needed to eectively negotiate with both
internal and external stakeholders to align eorts and overcome See description under subject 2.EPE. Application required; consult
dierences. No prior experience in negotiation required. Satises the UPOP website for more information.
requirements for the Graduate Certicate in Technical Leadership. K. Tan-Tiongco, D. Fordell
S. Dinnar
6.EPW UPOP Engineering Practice Workshop
6.9270 Negotiation and Influence Skills for Technical Leaders Engineering School-Wide Elective Subject.
Prereq: None Oered under: 1.EPW, 2.EPW, 3.EPW, 6.EPW, 10.EPW, 16.EPW,
G (Fall) 20.EPW, 22.EPW
2-0-4 units Prereq: 2.EPE
U (IAP, Spring)
Focuses around the premise that the abilities to negotiate with, 1-0-0 units
and influence others, are essential to being an eective leader in
technology rich environments. Provides graduate students with See description under subject 2.EPW. Enrollment limited to those in
underlying principles and a repertoire of negotiation and influence the UPOP program.
skills that apply to interpersonal situations, particularly those where K. Tan-Tiongco, D. Fordell
an engineer or project leader lacks formal authority over others in
delivering results. Utilizes research-based approaches through the
EECS & Beyond
application of multiple learning methods, including experiential
role plays, case studies, assessments, feedback, and personal 6.9300 StartMIT: Workshop for Entrepreneurs and Innovators
reflections. Concepts such as the zone of possible agreements, Subject meets with 6.9302[J], 15.352[J]
best alternative to negotiated agreements, and sources of influence Prereq: None
are put into practice. Satises the requirements for the Graduate U (IAP)
Certicate in Technical Leadership. 4-0-2 units
D. Nino, J. Wu
Designed for students who are interested in entrepreneurship and
6.9280[J] Leading Creative Teams want to explore the potential commercialization of their research
Same subject as 15.674[J], 16.990[J] project. Introduces practices for building a successful company,
Prereq: Permission of instructor such as idea creation and validation, dening a value proposition,
G (Fall, Spring) building a team, marketing, customer traction, and possible funding
3-0-6 units models. Students taking graduate version complete dierent
assignments.
Prepares students to lead teams charged with developing creative A. Chandrakasan, C. Chase, B. Aulet
solutions in engineering and technical environments. Grounded
in research but practical in focus, equips students with leadership
competencies such as building self-awareness, motivating and
developing others, creative problem solving, influencing without
authority, managing conflict, and communicating eectively.
Teamwork skills include how to convene, launch, and develop
various types of teams, including project teams. Learning methods
emphasize personalized and experiential skill development.
Enrollment limited.
D. Nino, J. Wu

6.9302[J] StartMIT: Workshop for Entrepreneurs and Innovators 6.9321 Ethics for Engineers - Independent Inquiry
Same subject as 15.352[J] Subject meets with 1.082[J], 2.900[J], 6.9320[J], 10.01[J], 16.676[J],
Subject meets with 6.9300 20.005, 22.014[J]
Prereq: None Prereq: None
G (IAP) U (Fall)
2-0-10 units
Designed for students who are interested in entrepreneurship and
want to explore the potential commercialization of their research Explores the ethical principles by which an engineer ought to be
project. Introduces practices for building a successful company, guided. Integrates foundational texts in ethics with case studies
such as idea creation and validation, dening a value proposition, illustrating ethical problems arising in the practice of engineering.
building a team, marketing, customer traction, and possible funding Readings from classic sources including Aristotle, Kant, Machiavelli,
models. Students taking graduate version complete dierent Hobbes, Locke, Rousseau, Franklin, Tocqueville, Arendt, and King.
assignments. Case studies include articles and lms that address engineering
B. Aulet, A. Chandrakasan, C. Chase disasters, safety, biotechnology, the internet and AI, and the
ultimate scope and aims of engineering. Dierent sections may focus
6.9310 Patents, Copyrights, and the Law of Intellectual Property on themes, such as AI or biotechnology. To satisfy the independent
Prereq: None inquiry component of this subject, students expand the scope of
U (Fall) their term project. Students taking 20.005 focus their term project
Not oered regularly; consult department on a problem in biological engineering in which there are intertwined
2-0-4 units ethical and technical issues.
D. A. Lauenburger, B. L. Trout
Intensive introduction to the law, focusing on intellectual property,
patents, copyrights, trademarks, and trade secrets. Covers the 6.9350[J] Financial Market Dynamics and Human Behavior
process of draing and ling patent applications, enforcement of Same subject as 15.481[J]
patents in the courts, the dierences between US and international Prereq: 15.401, 15.414, or 15.415
IP laws and enforcement mechanisms, and the inventor's ability Acad Year 2023-2024: Not oered
to monetize and protect his/her innovations. Highlights current Acad Year 2024-2025: G (Spring)
legal issues and trends relating to the technology, and life sciences 4-0-5 units
industries. Readings include judicial opinions and statutory
material. Class projects include patent draing, patent searching, See description under subject 15.481[J]. Enrollment may be limited;
and patentability opinions, and courtroom presentation. preference to Sloan graduate students.
S. M. Bauer A. Lo
6.9320 Ethics for Engineers 6.9360 Management in Engineering

Engineering School-Wide Elective Subject. Engineering School-Wide Elective Subject.
Oered under: 1.082, 2.900, 6.9320, 10.01, 16.676, 22.014 Oered under: 2.96, 6.9360, 10.806, 16.653
Subject meets with 6.9321, 20.005 Prereq: None
Prereq: None U (Fall)
2-0-4 units
See description under subject 2.96. Restricted to juniors and
See description under subject 10.01. seniors.
D. A. Lauenberger, B. L. Trout H. S. Marcus, J.-H. Chun

Independent Activities Period 6.9550 Structure and Interpretation of Computer Programs

Prereq: None
6.9500 Introduction to MATLAB U (IAP)
Prereq: None Not oered regularly; consult department
U (IAP) 1-0-5 units
Not oered regularly; consult department Studies the structure and interpretation of computer programs which
1-0-2 units transcend specic programming languages. Demonstrates thought
Accelerated introduction to MATLAB and its popular toolboxes. patterns for computer science using Scheme. Includes weekly
Lectures are interactive, with students conducting sample programming projects. Enrollment may be limited.
MATLAB problems in real time. Includes problem-based MATLAB Sta
assignments. Students must provide their own laptop and soware.
Enrollment limited. 6.9560 Introduction to Soware Engineering in Java
Sta Prereq: None
U (IAP)
6.9510 Introduction to Signals and Systems, and Feedback Not oered regularly; consult department
Control 1-1-4 units
Prereq: Calculus II (GIR) or permission of instructor Covers the fundamentals of Java, helping students develop intuition
U (IAP) about object-oriented programming. Focuses on developing working
Not oered regularly; consult department soware that solves real problems. Designed for students with little
2-2-2 units or no programming experience. Concepts covered useful to 6.3100.
Introduces fundamental concepts for 6.003, including Fourier and Enrollment limited.
Laplace transforms, convolution, sampling, lters, feedback control, Sta
stability, and Bode plots. Students engage in problem solving, using
Mathematica and MATLAB soware extensively to help visualize 6.9570 Introduction to C and C++
processing in the time frequency domains. Prereq: None
Sta U (IAP)
6.9520 Introduction to Electrical Engineering Lab Skills 3-3-0 units
Prereq: None Fast-paced introduction to the C and C++ programming languages.
U (IAP) Intended for those with experience in other languages who have
Not oered regularly; consult department never used C or C++. Students complete daily assignments, a small-
1-3-2 units scale individual project, and a mandatory online diagnostic test.
Introduces basic electrical engineering concepts, components, Enrollment limited.
and laboratory techniques. Covers analog integrated circuits, Sta
power supplies, and digital circuits. Lab exercises provide
practical experience in constructing projects using multi-meters, 6.9600 Mobile Autonomous Systems Laboratory: MASLAB
oscilloscopes, logic analyzers, and other tools. Includes a project in Prereq: None
which students build a circuit to display their own EKG. Enrollment U (IAP)
limited. 2-2-2 units
G. P. Hom Can be repeated for credit.
Autonomous robotics contest emphasizing technical AI, vision,

mapping and navigation from a robot-mounted camera. Few
restrictions are placed on materials, sensors, and/or actuators
enabling teams to build robots very creatively. Teams should have
members with varying engineering, programming and mechanical
backgrounds. Culminates with a robot competition at the end of IAP.
Enrollment limited.
Sta

6.9610 The Battlecode Programming Competition Non-classroom & Career

Prereq: None
U (IAP) 6.9700 Studies in Articial Intelligence and Decision Making
2-0-4 units Prereq: Permission of department
Can be repeated for credit. G (Fall)
Articial Intelligence programming contest in Java. Student teams Not oered regularly; consult department
program virtual robots to play Battlecode, a real-time strategy game. 0-0-48 units
Competition culminates in a live BattleCode tournament. Assumes Introduction to articial intelligence and decision making in a
basic knowledge of programming. series of online subjects followed by a comprehensive examination.
Sta Probability: distributions and probabilistic calculations, inference
methods, laws of large numbers, and random processes. Statistical
6.9620 Web Lab: A Web Programming Class and Competition data analysis: linear regression, parameter estimation, hypothesis
Prereq: None testing, model selection, and causal inference. Machine learning:
U (IAP) linear classication, fundamentals of supervised machine learning,
1-0-5 units deep learning, unsupervised learning, and generative models.
Can be repeated for credit. Online decision making: online optimization, online learning,
Student teams learn to build a functional and user-friendly website. Markov decision processes and reinforcement learning, elements
Topics include version control, HTML, CSS, JavaScript, ReactJS, and of control theory, and fundamentals of game theory. Computer
nodejs. All teams are eligible to enter a competition where sites vision: fundamentals of image and signal processing, introduction to
are judged by industry experts. Beginners and experienced web machine learning for vision, generative models and representation
programmers welcome, but some previous programming experience learning, and elements of scene understanding. Restricted to
is recommended. Registration on subject website required. Articial Intelligence and Decision Making MicroMasters Credential
Sta holders in the AI+D Blended Master's program.
A. Madry, P. Parrilo
6.9630 Pokerbots Competition
Prereq: None 6.9710 Internship in Articial Intelligence and Decision Making
U (IAP) Prereq: Permission of department
1-0-5 units G (Spring, Summer)
Can be repeated for credit. Units arranged [P/D/F]
Build autonomous poker players and aquire the knowledge of the Provides an opportunity for students to synthesize their coursework
game of poker. Showcase decision making skills, apply concepts in and to apply the knowledge gained in the program towards a project
mathematics, computer science and economics. Provides instruction with a host organization. All internship placements are subject to
in programming, game theory, probability and statistics and machine approval by program director. Each student must write a capstone
learning. Concludes with a nal competition and prizes. Enrollment project report. Restricted to students in the AI+D blended master's
limited. program.
Sta A. Madry, P. Parrilo
6.9720 Research in Articial Intelligence and Decision Making

Prereq: Permission of department
G (Spring, Summer)
0-0-12 units
Individual research project arranged with appropriate faculty

member or approved supervisor. A nal paper summarizing research
is required. Restricted to students in the AI+D blended master¿s
program.
A. Madry, P. Parrilo

6.9800 Independent Study in Electrical Engineering and 6.9840 Practical Experience in EECS
Computer Science Prereq: None
Prereq: Permission of instructor G (Fall, IAP, Spring, Summer)
U (Fall, IAP, Spring, Summer) 0-1-0 units
Units arranged [P/D/F] Can be repeated for credit.
For Course 6 students in the MEng program who seek practical o-
Opportunity for independent study at the undergraduate level under campus research experiences or internships in electrical engineering
regular supervision by a faculty member. Study plans require prior or computer science. Before enrolling, students must have an oer of
approval. employment from a company or organization and secure a supervisor
Consult Department Undergraduate Oce within EECS. Employers must document the work accomplished.
Proposals subject to departmental approval. For students who begin
6.9820 Practical Internship Experience the MEng program in the summer only, the experience or internship
Prereq: None cannot exceed 20 hours per week and must begin no earlier than
U (Fall, IAP, Spring, Summer) the rst day of the Summer Session, but may end as late as the last
0-1-0 units business day before the Fall Term.
Can be repeated for credit. Consult Department Undergraduate Oce
For Course 6 students participating in curriculum-related o-campus 6.9850 6-A Internship

internship experiences in electrical engineering or computer science. Prereq: None
Before enrolling, students must have an employment oer from a U (Fall, Spring, Summer)
company or organization and must nd an EECS supervisor. Upon 0-12-0 units
completion of the internship the student must submit a letter from
the employer evaluating the work accomplished, a substantive nal Provides academic credit for the rst assignment of 6-A
report from the student, approved by the MIT supervisor. Subject to undergraduate students at companies aliated with the
departmental approval. Consult Department Undergraduate Oce department's 6-A internship program. Limited to students
for details on procedures and restrictions. participating in the 6-A internship program.
Consult Department Undergraduate Oce T. Palacios
6.9830 Professional Perspective Internship 6.9860 Advanced 6-A Internship

Prereq: None Prereq: 6.9850
G (Fall, IAP, Spring, Summer) U (Fall, Spring, Summer)
Required for Course 6 MEng students to gain professional experience Provides academic credit for the second assignment of 6-
in electrical engineering or computer science through an internship A undergraduate students at companies aliated with the
(industry, government, or academic) of 4 or more weeks in IAP or department's 6-A internship program. Limited to students
summer. This can be completed as MEng students or as undergrads, participating in the 6-A internship program.
through previous employment completed while deferring MEng entry T. Palacios
or by attending a series of three colloquia, seminars, or technical
talks related to their eld. For internships/work experience, 6.9870 Graduate 6-A Internship
a letter from the employer conrming dates of employment is Prereq: 6.9850 or 6.9860
required. All students are required to write responses to short G (Fall, Spring, Summer)
essay prompts about their professional experience. International 0-12-0 units
students must consult ISO and the EECS Undergraduate Oce on
work authorization and allowable employment dates. Provides academic credit for a graduate assignment of graduate
Consult Department Undergraduate Oce 6-A students at companies aliated with the department's 6-A
internship program. Limited to graduate students participating in the
6-A internship program.
T. Palacios

6.9880 Graduate 6-A Internship 6.9930 Networking Seminars in EECS

Prereq: 6.9870 Prereq: None
G (Fall, Spring, Summer) G (Fall)
0-12-0 units Units arranged [P/D/F]
Provides academic credit for graduate students in the second half For rst year Course 6 students in the SM/PhD track, who seek
of their 6-A MEng industry internship. Limited to graduate students weekly engagement with departmental faculty and sta, to discuss
participating in the 6-A internship program. topics related to the graduate student experience, and to promote a
T. Palacios successful start to graduate school.
J. Fischer
6.9900 Teaching Electrical Engineering and Computer Science
Prereq: None 6.9932 Introduction to Research in Electrical Engineering and
G (Fall, Spring) Computer Science
Units arranged [P/D/F] Prereq: Permission of instructor
Can be repeated for credit. G (Fall, Spring, Summer)
3-0-0 units
For Teaching Assistants in Electrical Engineering and Computer
Science, in cases where teaching assignment is approved for Seminar on topics related to research leading to an SM, EE, ECS,
academic credit by the department. PhD, or ScD thesis. Limited to rst-year regular graduate students in
E. Adalsteinsson, D. M. Freeman, L. P. Kaelbling, R. C. Miller EECS with a fellowship or teaching assistantship.
L. A. Kolodziejski
6.9910 Research in Electrical Engineering and Computer Science
Prereq: None 6.9940 Professional Perspective I
G (Fall, Spring, Summer) Prereq: None
Units arranged [P/D/F] G (Fall, IAP, Spring, Summer)
Can be repeated for credit. 0-0-1 units
For EECS MEng students who are Research Assistants in Electrical
Engineering and Computer Science, in cases where the assigned Required for Course 6 students in the doctoral program to gain
research is approved for academic credit by the department. Hours professional perspective in research experiences, academic
arranged with research supervisor. experiences, and internships in electrical engineering and computer
Consult Department Undergraduate Oce science. Professional perspective options include: internships
(with industry, government or academia), industrial colloquia or
6.9920 Introductory Research in Electrical Engineering and seminars, research collaboration with industry or government, and
Computer Science professional development for entry into academia or entrepreneurial
Prereq: Permission of instructor engagement. For an internship experience, an oer of employment
G (Fall, Spring, Summer) from a company or organization is required prior to enrollment;
Units arranged [P/D/F] employers must document work accomplished. A written report is
Can be repeated for credit. required upon completion of a minimum of 4 weeks of o-campus
experiences. Proposals subject to departmental approval.
Enrollment restricted to rst-year graduate students in Electrical Consult Department Graduate Oce
Engineering and Computer Science who are doing introductory
research leading to an SM, EE, ECS, PhD, or ScD thesis. Opportunity
to become involved in graduate research, under guidance of a sta
member, on a problem of mutual interest to student and supervisor.
Individual programs subject to approval of professor in charge.
L. A. Kolodziejski

6.9950 Professional Perspective II 6.9990 Independent Study in Electrical Engineering and

Prereq: 6.9940 Computer Science
G (Fall, IAP, Spring, Summer) Prereq: None
0-0-1 units G (Fall, IAP, Spring, Summer)
Can be repeated for credit. Units arranged
Required for Course 6 students in the doctoral program to gain
professional perspective in research experiences, academic Opportunity for independent study under regular supervision by a
experiences, and internships in electrical engineering and computer faculty member. Projects require prior approval.
science. Professional perspective options include: internships L. A. Kolodziejski
(with industry, government or academia), industrial colloquia or
seminars, research collaboration with industry or government, and 6.THG Graduate Thesis
professional development for entry into academia or entrepreneurial Prereq: Permission of instructor
engagement. For an internship experience, an oer of employment G (Fall, IAP, Spring, Summer)
from a company or organization is required prior to enrollment; Units arranged
employers must document work accomplished. A written report is Can be repeated for credit.
required upon completion of a minimum of 4 weeks of o-campus
experiences. Proposals subject to departmental approval. Program of research leading to the writing of an SM, EE, ECS, PhD,
Consult Department Graduate Oce or ScD thesis; to be arranged by the student and an appropriate MIT
faculty member.
6.9960 Experience in Technical Communication (New) L. A. Kolodziejski
G (Fall, Spring) 6.THM Master of Engineering Program Thesis
Units arranged [P/D/F] Prereq: None
Can be repeated for credit. G (Fall, IAP, Spring, Summer)
Units arranged
Provides training and practice in technical communication. Can be repeated for credit.
Includes communication coaching, workshop facilitation, and other
communication-related projects under supervision of Communication Program of research leading to the writing of an MEng thesis; to be
Lab sta. Students selected by interview. Enrollment limited by arranged by the student and an appropriate MIT faculty member.
availability of suitable assignments. Enrollment could be limited if Restricted to MEng graduate students.
there isn't enough student participation. Consult Department Undergraduate Oce
D. Chien, D. Montgomery
6.UR Undergraduate Research in Electrical Engineering and
6.9970 Academic Job Search Computer Science
Prereq: Permission of instructor Prereq: None
G (Fall) U (Fall, IAP, Spring, Summer)
Interactive workshops and homework assignments provide guidance
for the faculty application process, including CV; cover letter; Individual research project arranged with appropriate faculty
research, teaching, and diversity statements; interview and job talk member or approved supervisor. Forms and instructions for the nal
preparation; and post-oer negotiations. Includes perspectives report are available in the EECS Undergraduate Oce.
of junior faculty, search committee members, and department Consult Department Undergraduate Oce
leadership at MIT and other institutions. Academic Career Day
provides opportunity for students to participate in one-on-one pre-
interviews with external faculty. Preference to EECS senior PhD
students and postdocs.
S. Amarasinghe, D. Montgomery

Special Subjects 6.S044 Special Subject in Electrical Engineering and Computer

Science
6.S040 Special Subject in Electrical Engineering and Computer Prereq: None
Science U (Fall, Spring)
Not oered regularly; consult department Can be repeated for credit.
3-0-9 units Covers subject matter not oered in the regular curriculum. Consult
Can be repeated for credit. department to learn of oerings for a particular term.
Covers subject matter not oered in the regular curriculum. Consult Consult Department
department to learn of oerings for a particular term.
Consult Department 6.S045 Special Subject in Electrical Engineering and Computer
Science
Science U (Fall)
3-0-9 units Covers subject matter not oered in the regular curriculum. Consult
Consult Department 6.S046 Special Subject in Electrical Engineering and Computer
Science
Science U (Fall)
Not oered regularly; consult department Covers subject matter not oered in the regular curriculum. Consult
3-0-9 units department to learn of oerings for a particular term.
Can be repeated for credit. Consult Department
Covers subject matter not oered in the regular curriculum. Consult
department to learn of oerings for a particular term. 6.S047 Special Subject in Electrical Engineering and Computer
Consult Department Science
Prereq: None
6.S043 Special Subject in Electrical Engineering and Computer U (Fall)
Science Not oered regularly; consult department
Prereq: None 3-0-9 units
U (Fall) Can be repeated for credit.
3-0-9 units department to learn of oerings for a particular term.
Consult Department

6.S050 Special Subject in Electrical Engineering and Computer 6.S054 Special Subject in Electrical Engineering and Computer
Science Science
U (Spring) U (Spring)
Can be repeated for credit. 3-0-9 units
department to learn of oerings for a particular term. Covers subject matter not oered in the regular curriculum. Consult
Consult Department department to learn of oerings for a particular term.
Consult Department
6.S051 Special Subject in Electrical Engineering and Computer
Science 6.S055 Special Subject in Electrical Engineering and Computer
Prereq: None Science
U (Spring) Prereq: None
3-0-9 units
Covers subject matter not oered in the regular curriculum. Consult Can be repeated for credit.
Consult Department Covers subject matter not oered in the regular curriculum. Consult
6.S052 Special Subject in Electrical Engineering and Computer Consult Department
Science
Prereq: None 6.S056 Special Subject in Electrical Engineering and Computer
U (Spring) Science
Can be repeated for credit. U (Spring)
Covers subject matter not oered in the regular curriculum. Consult 3-0-9 units
department to learn of oerings for a particular term. Can be repeated for credit.
Consult Department
6.S053 Special Subject in Electrical Engineering and Computer department to learn of oerings for a particular term.
Science Consult Department
Prereq: None
U (Spring) 6.S057 Special Subject in Electrical Engineering and Computer
Not oered regularly; consult department Science
Can be repeated for credit. U (Fall)
Covers subject matter not oered in the regular curriculum. Consult Units arranged
Consult Department
Consult Department

Science Science
U (Fall) U (Spring)
Not oered regularly; consult department Units arranged
Units arranged Can be repeated for credit.
Covers subject matter not oered in the regular curriculum. Consult department to learn of oerings for a particular term.
department to learn of oerings for a particular term. Consult Department
Consult Department
6.S059 Special Subject in Electrical Engineering and Computer Science
Science Prereq: Permission of instructor
Prereq: None U (Spring)
U (Fall) Units arranged
Units arranged
Consult Department
Science Prereq: Permission of instructor
Prereq: None U (Fall, Spring)
U (Fall) Not oered regularly; consult department
Units arranged Units arranged
Can be repeated for credit. Can be repeated for credit.
Basic undergraduate subjects not oered in the regular curriculum. Covers subject matter not oered in the regular curriculum. Consult
Consult Department
Prereq: None Science
U (Fall, Spring) Prereq: Permission of instructor
Not oered regularly; consult department U (Fall)
Units arranged Not oered regularly; consult department
Basic undergraduate subjects not oered in the regular curriculum.
Consult Department Covers subject matter not oered in the regular curriculum. Consult
6.S062 Special Subject in Electrical Engineering and Computer Consult Department
Science
Prereq: None
U (Fall)
Units arranged

Consult Department

Science Science
Prereq: Permission of instructor Prereq: Permission of instructor
U (Spring) U (Fall)
Covers subject matter not oered in the regular curriculum. Consult Covers subject matter not oered in the regular curriculum. Consult
department to learn of oerings for a particular term. department to learn of oerings for a particular term.
Consult Department Consult Department
Science Science
U (Fall) U (Fall)
Science Science
U (Fall) U (IAP)
Units arranged Units arranged [P/D/F]
Science Science
U (Fall) U (IAP)
Not oered regularly; consult department Units arranged [P/D/F]
Consult Department

Science Science
U (IAP) U (IAP)
Units arranged [P/D/F] Units arranged [P/D/F]
Science Science
U (IAP) U (IAP)
Units arranged [P/D/F] Not oered regularly; consult department
D. M. Freeman
Prereq: Permission of instructor Science
U (IAP) Prereq: Permission of instructor
Units arranged [P/D/F] U (IAP)
Consult Department
U (Summer) Prereq: Permission of instructor
D. M. Freeman department to learn of oerings for a particular term.
Consult Department
Science
U (IAP)
Units arranged [P/D/F]

Consult Department

6.S096 Special Subject in Electrical Engineering and Computer 6.S183 Special Laboratory Subject in Electrical Engineering and
Science Computer Science
U (IAP) U (Fall)
Covers subject matter not oered in the regular curriculum. Consult Laboratory subject that covers content not oered in the regular
department to learn of oerings for a particular term. curriculum. Consult department to learn of oerings for a particular
Consult Department term.
Consult Department
Science 6.S184 Special Laboratory Subject in Electrical Engineering and
Prereq: Permission of instructor Computer Science
Covers subject matter not oered in the regular curriculum. Consult Can be repeated for credit.
Consult Department Laboratory subject that covers content not oered in the regular
curriculum. Consult department to learn of oerings for a particular
6.S098 Special Subject in Electrical Engineering and Computer term.
U (IAP) 6.S185 Special Laboratory Subject in Electrical Engineering and
Units arranged [P/D/F] Computer Science
Can be repeated for credit. Prereq: Permission of instructor
U (IAP)
Covers subject matter not oered in the regular curriculum. Consult Not oered regularly; consult department
department to learn of oerings for a particular term. Units arranged [P/D/F]
Consult Department Can be repeated for credit.
6.S099 Special Subject in Electrical Engineering and Computer Laboratory subject that covers content not oered in the regular
Science curriculum. Consult department to learn of oerings for a particular
Prereq: Permission of instructor term.
U (IAP) D. M. Freeman
Can be repeated for credit. 6.S186 Special Laboratory Subject in Electrical Engineering and
Computer Science
Covers subject matter not oered in the regular curriculum. Consult Prereq: Permission of instructor
department to learn of oerings for a particular term. U (IAP)
Consult Department Not oered regularly; consult department
Laboratory subject that covers content not oered in the regular

curriculum. Consult department to learn of oerings for a particular
term.
Consult Department

6.S187 Special Laboratory Subject in Electrical Engineering and 6.S191 Special Laboratory Subject in Electrical Engineering and
Computer Science Computer Science
U (IAP) U (IAP)
curriculum. Consult department to learn of oerings for a particular Laboratory subject that covers content not oered in the regular
term. curriculum. Consult department to learn of oerings for a particular
Sta term.
Consult Department
6.S188 Special Laboratory Subject in Electrical Engineering and
Computer Science 6.S192 Special Laboratory Subject in Electrical Engineering and
U (Fall) Prereq: Permission of instructor
Not oered regularly; consult department U (IAP)
D. M. Freeman term.
Consult Department
Not oered regularly; consult department U (IAP)
D. M. Freeman term.
Consult Department
D. M. Freeman term.
Consult Department

6.S193-6.S198 Special Laboratory Subject in Electrical 6.S660 Special Subject in Engineering Leadership (New)
Engineering and Computer Science Prereq: None
Prereq: Permission of instructor G (Spring)
U (Fall) Units arranged
Units arranged
Can be repeated for credit. Covers subject matter not oered in the regular curriculum. Consult
the Gordon Engineering Leadership Program or Riccio Graduate
Laboratory subject that covers content not oered in the regular Engineering Leadership Program to learn of oerings for a particular
curriculum. Consult department to learn of oerings for a particular term.
term. Sta
Consult Department
6.S630 Special Subject in Engineering Leadership (New) Science (New)
G (Spring) G (Fall)
Units arranged 3-0-9 units
the Gordon Engineering Leadership Program or Riccio Graduate department to learn of oerings for a particular term.
Engineering Leadership Program to learn of oerings for a particular Consult Department
term.
Sta 6.S891 Special Subject in Electrical Engineering and Computer
Science (New)
6.S640 Special Subject in Engineering Leadership (New) Prereq: None
Prereq: None G (Fall)
G (Spring) Units arranged
the Gordon Engineering Leadership Program or Riccio Graduate Consult Department
Engineering Leadership Program to learn of oerings for a particular
term. 6.S892 Special Subject in Electrical Engineering and Computer
Sta Science (New)
Prereq: None
6.S650 Special Subject in Engineering Leadership (New) G (Fall, Spring)
G (Spring) Units arranged
the Gordon Engineering Leadership Program or Riccio Graduate Consult Department
Engineering Leadership Program to learn of oerings for a particular
term.
Sta

6.S893 Special Subject in Electrical Engineering and Computer 6.S897 Special Subject in Computer Science
Science (New) Prereq: Permission of instructor
Prereq: None G (Fall)
G (Fall) Not oered regularly; consult department
Not oered regularly; consult department Units arranged
Consult Department
6.S898 Special Subject in Computer Science
6.S894 Special Subject in Electrical Engineering and Computer Prereq: Permission of instructor
Science (New) G (Fall)
Prereq: None Units arranged
G (Fall, Spring) Can be repeated for credit.
Units arranged Covers subject matter not oered in the regular curriculum. Consult
Consult Department
department to learn of oerings for a particular term. 6.S899 Special Subject in Computer Science
Consult Department Prereq: Permission of instructor
G (Fall)
6.S895 Special Subject in Electrical Engineering and Computer Not oered regularly; consult department
Science (New) Units arranged
Prereq: None Can be repeated for credit.
G (Fall, Spring)
Units arranged department to learn of oerings for a particular term.
Covers subject matter not oered in the regular curriculum. Consult 6.S911 Special Subject in Electrical Engineering and Computer
department to learn of oerings for a particular term. Science
U (Spring)
6.S896 Special Subject in Electrical Engineering and Computer Not oered regularly; consult department
Science (New) Units arranged
Prereq: None Can be repeated for credit.
G (Fall)
3-0-9 units Covers subject matter not oered in the regular curriculum.
Covers subject matter not oered in the regular curriculum. Consult 6.S912 Special Subject in Electrical Engineering and Computer
department to learn of oerings for a particular term. Science
U (IAP)
Covers subject matter not oered in the regular curriculum.

Consult Department

Science Science
U (Fall, IAP, Spring) U (Fall, IAP, Spring)
Covers subject matter not oered in the regular curriculum. Covers subject matter not oered in the regular curriculum.
Science Science
U (Fall, IAP, Spring) U (Fall, IAP, Spring)
Covers subject matter not oered in the regular curriculum. Covers subject matter not oered in the regular curriculum.
Science Science
U (Fall, IAP, Spring) G (Fall)
Units arranged [P/D/F] Units arranged
Covers subject matter not oered in the regular curriculum. Covers subject matter not oered in the regular curriculum. Consult
Consult Department
U (Fall, IAP, Spring) Prereq: None
Not oered regularly; consult department G (Fall)
Units arranged [P/D/F] 3-0-9 units
Covers subject matter not oered in the regular curriculum. Covers subject matter not oered in the regular curriculum. Consult
Consult Department
Science
U (Fall, IAP, Spring)
Covers subject matter not oered in the regular curriculum.

Consult Department

Science Science
G (Spring) G (Spring)
6.S953 Special Subject in Electrical Engineering and Computer 6.S960 Special Studies: Electrical Engineering and Computer
Science Science (New)
G (Spring) G (Fall, Spring)
3-0-9 units Units arranged
Covers subject matter not oered in the regular curriculum. Consult Opportunity for study of graduate-level topics related to electrical
department to learn of oerings for a particular term. engineering and computer science but not included elsewhere in
Consult Department the curriculum. Registration under this subject normally used for
situations involving small study groups. Normal registration is for 12
6.S954 Special Subject in Electrical Engineering and Computer units. Registration subject to approval of professor in charge.
Science Consult Department Graduate Oce
Prereq: None
G (Fall) 6.S961 Special Studies: Electrical Engineering and Computer
3-0-9 units Science (New)
Can be repeated for credit. Prereq: None
G (Fall, Spring)
Covers subject matter not oered in the regular curriculum. Consult Not oered regularly; consult department
department to learn of oerings for a particular term. Units arranged
6.S955 Special Subject in Electrical Engineering and Computer Opportunity for study of graduate-level topics related to electrical
Science engineering and computer science but not included elsewhere in
Prereq: None the curriculum. Registration under this subject normally used for
G (Fall) situations involving small study groups. Normal registration is for 12
3-0-9 units units. Registration subject to approval of professor in charge.
Can be repeated for credit. Consult Department Graduate Oce

Consult Department

6.S962 Special Studies: Electrical Engineering and Computer 6.S976 Special Subject in Electrical Engineering and Computer
Science (New) Science
Prereq: None Prereq: Permission of instructor
G (Fall, Spring) G (Fall)
Opportunity for study of graduate-level topics related to electrical Covers subject matter not oered in the regular curriculum. Consult
engineering and computer science but not included elsewhere in department to learn of oerings for a particular term.
the curriculum. Registration under this subject normally used for Consult Department
situations involving small study groups. Normal registration is for 12
units. Registration subject to approval of professor in charge. 6.S977 Special Subject in Electrical Engineering and Computer
Consult Department Graduate Oce Science
6.S963-6.S967 Special Studies: EECS G (Spring)
Prereq: None Units arranged
G (Fall) Can be repeated for credit.
Units arranged Covers subject matter not oered in the regular curriculum. Consult
Consult Department
Opportunity for study of graduate-level topics related to electrical
engineering and computer science but not included elsewhere in 6.S978 Special Subject in Electrical Engineering and Computer
the curriculum. Registration under this subject normally used for Science
situations involving small study groups. Normal registration is for 12 Prereq: Permission of instructor
units. Registration subject to approval of professor in charge. Consult G (Spring)
the department for details. Units arranged
6.S974 Special Subject in Electrical Engineering and Computer Covers subject matter not oered in the regular curriculum. Consult
Science department to learn of oerings for a particular term.
Prereq: None Consult Department
G (Fall)
Not oered regularly; consult department 6.S979 Special Subject in Electrical Engineering and Computer
Units arranged Science
Can be repeated for credit. Prereq: Permission of instructor
G (Fall)
Covers subject matter not oered in the regular curriculum. Consult Units arranged
Consult Department
6.S975 Special Subject in Electrical Engineering and Computer department to learn of oerings for a particular term.
Prereq: None
G (Fall)

Consult Department

Science Science
G (Fall) G (Spring)
Science Science
G (Fall) G (Spring)
Science Science
G (Fall) G (Spring)
Not oered regularly; consult department 3-0-9 units
Consult Department
Science Prereq: None
Prereq: None G (Spring)
Consult Department
Science
Prereq: None
G (Spring)
3-0-9 units

Consult Department

Common Ground for Computing Education 6.C35[J] Interactive Data Visualization and Society
Same subject as 11.C35[J]
6.C01 Modeling with Machine Learning: from Algorithms to Subject meets with 6.C85[J], 11.C85[J]
Applications Prereq: None
Subject meets with 6.C51 U (Spring)
Prereq: Calculus II (GIR) and 6.100A; Coreq: 1.C01, 2.C01, 3.C01[J], or 3-1-8 units
22.C01 Credit cannot also be received for 6.8530, 11.154, 11.454
U (Spring) Covers the design, ethical, and technical skills for creating eective
3-0-3 units visualizations. Short assignments build familiarity with the data
Focuses on modeling with machine learning methods with an eye analysis and visualization design process. Weekly lab sessions
towards applications in engineering and sciences. Introduction to present coding and technical skills. A nal project provides
modern machine learning methods, from supervised to unsupervised experience working with real-world big data, provided by external
models, with an emphasis on newer neural approaches. Emphasis on partners, in order to expose and communicate insights about
the understanding of how and why the methods work from the point societal issues. Students taking graduate version complete
of view of modeling, and when they are applicable. Using concrete additional assignments. Enrollment limited. Enrollment limited.
examples, covers formulation of machine learning tasks, adapting C. D'Ignazio, A. Satyanarayan, S. Williams
and extending methods to given problems, and how the methods can
and should be evaluated. Students taking graduate version complete 6.C51 Modeling with Machine Learning: from Algorithms to
additional assignments. Students taking graduate version complete Applications
additional assignments. Students cannot receive credit without Subject meets with 6.C01
simultaneous completion of a 6-unit disciplinary module. Enrollment Prereq: Calculus II (GIR) and 6.100A; Coreq: 1.C51, 2.C51, 3.C51[J],
may be limited. 22.C51, or SCM.C51
R. Barzilay, T. Jaakkola G (Spring)
3-0-3 units
6.C06[J] Linear Algebra and Optimization (New) Focuses on modeling with machine learning methods with an eye
Same subject as 18.C06[J] towards applications in engineering and sciences. Introduction to
Prereq: Calculus II (GIR) modern machine learning methods, from supervised to unsupervised
U (Fall) models, with an emphasis on newer neural approaches. Emphasis on
5-0-7 units. REST the understanding of how and why the methods work from the point
Credit cannot also be received for 18.06, 18.700 of view of modeling, and when they are applicable. Using concrete
See description under subject 18.C06[J]. examples, covers formulation of machine learning tasks, adapting
A. Moitra, P. Parrilo and extending methods to given problems, and how the methods can
and should be evaluated. Students taking graduate version complete
6.C25[J] Real World Computation with Julia (New) additional assignments. Students cannot receive credit without
Same subject as 1.C25[J], 12.C25[J], 16.C25[J], 18.C25[J], 22.C25[J] simultaneous completion of a 6-unit disciplinary module. Enrollment
Prereq: 6.100A, 18.03, and 18.06 may be limited.
U (Fall) R. Barzilay, T. Jaakkola
3-0-9 units
6.C67[J] Computational Imaging: Physics and Algorithms (New)
See description under subject 18.C25[J]. Same subject as 2.C67[J], 3.C67[J]
A. Edelman, R. Ferrari, B. Forget, C. Leiseron,Y. Marzouk, J. Williams Subject meets with 2.C27[J], 3.C27[J], 6.C27[J]
Prereq: 18.C06[J] and (1.00, 1.000, 2.086, 3.019, or 6.100A)
6.C27[J] Computational Imaging: Physics and Algorithms (New) G (Fall)
Same subject as 2.C27[J], 3.C27[J] 3-0-9 units
Subject meets with 2.C67[J], 3.C67[J], 6.C67[J]
Prereq: 18.C06[J] and (1.00, 1.000, 2.086, 3.019, or 6.100A) See description under subject 2.C67[J].
U (Fall) G. Barbastathis, J. LeBeau, R. Ram, S. You
3-0-9 units
See description under subject 2.C27[J].

G. Barbastathis, J. LeBeau, R. Ram, S. You

6.C85[J] Interactive Data Visualization and Society

Same subject as 11.C85[J]
Subject meets with 6.C35[J], 11.C35[J]
Prereq: None
G (Spring)
3-1-8 units
Credit cannot also be received for 6.8530, 11.154, 11.454
Covers the design, ethical, and technical skills for creating eective
visualizations. Short assignments build familiarity with the data
analysis and visualization design process. Students participate
in hour-long studio reading sessions. A nal project provides
experience working with real-world big data, provided by external
partners, in order to expose and communicate insights about
societal issues. Students taking graduate version complete
C. D'Ignazio, A. Satyanarayan, S. Williams

Electrical Engineering Computer Science

Uploaded by

Document Informationclick to expand document information

Copyright:

Available Formats

Electrical Engineering Computer Science

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Electrical Engineering Computer Science

Uploaded by

Copyright:

Available Formats

DEPARTMENT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE

DEPARTMENT OF ELECTRICAL ENGINEERING

Department of Electrical Engineering and Computer Science | 3

program is for students who wish to specialize in computer science,

4 | Department of Electrical Engineering and Computer Science

6.1200[J] Mathematics for Computer Science 6.4550[J] Interactive Music Systems

Department of Electrical Engineering and Computer Science | 5

6 | Department of Electrical Engineering and Computer Science

Department of Electrical Engineering and Computer Science | 7

Master of Engineering Degree Students • Multidisciplinary aspects of computation

8 | Department of Electrical Engineering and Computer Science

Department of Electrical Engineering and Computer Science | 9

Hari Balakrishnan, PhD Isaac Chuang, PhD

Anantha P. Chandrakasan, PhD James G. Fujimoto, PhD

10 | Department of Electrical Engineering and Computer Science

Shafrira Goldwasser, PhD Patrick Jaillet, PhD

W. Eric L. Grimson, PhD David R. Karger, PhD

Department of Electrical Engineering and Computer Science | 11

Tomás Lozano-Pérez, PhD Terry Philip Orlando, PhD

Alexandre Megretski, PhD Martin C. Rinard, PhD

Robert C. Miller, PhD Daniela L. Rus, PhD

Robert T. Morris, PhD Daniel Sánchez Martín, PhD

William D. Oliver, PhD Martin A. Schmidt, PhD

12 | Department of Electrical Engineering and Computer Science

Devavrat Shah, PhD John N. Tsitsiklis, PhD

Jerey H. Shapiro, PhD Caroline Uhler, PhD

David A. Sontag, PhD Cardinal Warde, PhD

Department of Electrical Engineering and Computer Science | 13

Phillip John Isola, PhD

Jacob Andreas, PhD Tim Kraska, PhD

Adam M. Belay, PhD Laura D. Lewis, PhD

Tamara A. Broderick, PhD Stefanie Mueller, PhD

Michael J. Carbin, PhD Kevin O'Brien, PhD

14 | Department of Electrical Engineering and Computer Science

Samantha Coday, PhD Jelena Notaros, PhD

Gabriele Farina, PhD Vincent Sitzmann, PhD

Marzyeh Ghassemi, PhD Tess E. Smidt, PhD

Department of Electrical Engineering and Computer Science | 15

Butler W. Lampson, PhD Andrew Wang, PhD

Michael Stonebraker, PhD Technical Instructors

Vincent J. Monardo, PhD G. David Forney, ScD

Srinivasan Raghuraman, PhD Robert G. Gallager, ScD

Shen Shen, PhD Alan J. Grodzinsky, ScD

16 | Department of Electrical Engineering and Computer Science

Frederick C. Hennie III, PhD Gerald L. Wilson, PhD

Department of Electrical Engineering and Computer Science | 17

6.1010 Fundamentals of Programming 6.1060 Soware Performance Engineering

18 | Department of Electrical Engineering and Computer Science

6.5081 Multicore Programming 6.5110 Foundations of Program Analysis

Department of Electrical Engineering and Computer Science | 19

20 | Department of Electrical Engineering and Computer Science

6.1400[J] Computability and Complexity Theory 6.5220[J] Randomized Algorithms

Department of Electrical Engineering and Computer Science | 21

6.5250[J] Distributed Algorithms 6.5340 Topics in Algorithmic Game Theory

22 | Department of Electrical Engineering and Computer Science

6.5420 Randomness and Computation 6.5610 Applied Cryptography and Security

Security & Cryptography 6.5630 Advanced Topics in Cryptography

Department of Electrical Engineering and Computer Science | 23