Engineering Computation and Data Science
Presents engineering problems in a computational setting with emphasis on data science and problem abstraction. Covers exploratory data analysis and visualization, filtering, regression. Building basic machine learning models (classifiers, decision trees, clustering) for smart city applications. Labs and programming projects focused on analytics problems faced by cities, infrastructure, and environment. Students taking graduate version complete additional assignments and project work.
Spring 2012 · Introduction to Computers and Engineering Problem Solving
This course presents the fundamentals of object-oriented software design and development, computational methods and sensing for engineering, and scientific and managerial applications. It cover topics, including design of classes, inheritance, graphical user interfaces, numerical methods, streams, threads, sensors, and data structures. Students use Java{{< sup "®" >}} programming language to complete weekly software assignments. **How is 1.00 different from other intro programming courses offered at MIT?** 1.00 is a first course in programming. It assumes no prior experience, and it focuses on the use of computation to solve problems in engineering, science and management. The audience for 1.00 is non-computer science majors. 1.00 does not focus on writing compilers or parsers or computing tools where the computer is the system; it focuses on engineering problems where the computer is part of the system, or is used to model a physical or logical system. 1.00 teaches the Java programming language, and it focuses on the design and development of object-oriented software for technical problems. 1.00 is taught in an active learning style. Lecture segments alternating with laboratory exercises are used in every class to allow students to put concepts into practice immediately; this teaching style generates questions and feedback, and allows the teaching staff and students to interact when concepts are first introduced to ensure that core ideas are understood. Like many MIT classes, 1.00 has weekly assignments, which are programs based on actual engineering, science or management applications. The weekly assignments build on the class material from the previous week, and require students to put the concepts taught in the small in-class labs into a larger program that uses multiple elements of Java together.
Readings
- LEC #: L 1 · TOPICS: Course Overview, Introduction to Java · READINGS (3D ED.): — · READINGS (4TH ED.): —
- LEC #: L 2 · TOPICS: Interactive Development Environment: Eclipse · READINGS (3D ED.): Text: 1.1–1.8 · READINGS (4TH ED.): Text: 1.1–1.7
- LEC #: L 3 · TOPICS: Operators, Control Structures · READINGS (3D ED.): Text: 4.1–4.5 · READINGS (4TH ED.): Text: 4.1–4.4
- LEC #: L 4 · TOPICS: Data Types, More Operators · READINGS (3D ED.): Text: 5.1–5.4 · READINGS (4TH ED.): Text: 5.1–5.4
- LEC #: L 5 · TOPICS: More Data Types, Control Structures, Intro to Methods · READINGS (3D ED.): Text: 6.1–6.4 · READINGS (4TH ED.): Text: 6.1–6.4
- LEC #: L 6 · TOPICS: Methods and Scope · READINGS (3D ED.): Text: 2.1–2.4, 8.8 · READINGS (4TH ED.): Text: 2.1–2.5, 8.8
- LEC #: L 7 · TOPICS: Classes and Objects · READINGS (3D ED.): Text: 2.5–2.10, 3.1–3.8 · READINGS (4TH ED.): Text: 2.6–2.10, 3.1–3.8
- LEC #: L 8 · TOPICS: Classes II · READINGS (3D ED.): Text: 8.1–8.5 · READINGS (4TH ED.): Text: 8.1–8.5
- LEC #: L 9 · TOPICS: Methods and Objects, Access · READINGS (3D ED.): Text: 8.9 · READINGS (4TH ED.): Text: 8.9
- LEC #: L 10 · TOPICS: Static Methods and Data · READINGS (3D ED.): Text: 8.6–8.7 · READINGS (4TH ED.): Text: 8.6–8.7
- LEC #: L 11 · TOPICS: Arrays, Arraylists · READINGS (3D ED.): Text: 7.1–7.7 · READINGS (4TH ED.): Text: 7.1–7.4, 7.6, 7.8
- LEC #: L 12 · TOPICS: Recursion · READINGS (3D ED.): Text: 13.1–13.4 · READINGS (4TH ED.): Text: 13.1–13.4
- LEC #: L 13 · TOPICS: Inheritance: Subclasses · READINGS (3D ED.): Text: 10.1–10.4 · READINGS (4TH ED.): Text: 10.1–10.4
- LEC #: L 14 · TOPICS: Inheritance II: Abstract classes, methods · READINGS (3D ED.): Text: 10.5–10.7 · READINGS (4TH ED.): Text: 10.5–10.6
- LEC #: L 15 · TOPICS: Inheritance III: Interfaces · READINGS (3D ED.): Text: 9.1–9.4 · READINGS (4TH ED.): Text: 9.1–9.4
- LEC #: L 16 · TOPICS: Design Lab I - Inheritance · READINGS (3D ED.): Text: 12.1–12.5 · READINGS (4TH ED.): Text: 12.1–12.5
- LEC #: L 17 · TOPICS: Introduction to Swing · READINGS (3D ED.): Text: 2.11–2.13, 3.9 · READINGS (4TH ED.): Text: 2.11–2.13, 3.9
- LEC #: L 18 · TOPICS: Swing Event Model · READINGS (3D ED.): Text: 9.6–9.10 · READINGS (4TH ED.): Text: 9.7–9.11
- LEC #: L 19 · TOPICS: Inner Classes, Layout Managers · READINGS (3D ED.): Text: 9.5, 18.3 · READINGS (4TH ED.): Text: 9.5, 18.3
- LEC #: L 20 · TOPICS: Model-View-Controller, Timers · READINGS (3D ED.): Text: 18.1 · READINGS (4TH ED.): Text: 18.3
- LEC #: L 21 · TOPICS: 2D API, 2D Transformations · READINGS (3D ED.): — · READINGS (4TH ED.): —
- LEC #: L 22 · TOPICS: Design Lab II- Swing · READINGS (3D ED.): — · READINGS (4TH ED.): —
- LEC #: L 23 · TOPICS: Streams I, Exceptions · READINGS (3D ED.): Text: 11.1, 19.1–19.2 · READINGS (4TH ED.): Text: 11.1, 19.1–19.2
- LEC #: L 24 · TOPICS: Streams II · READINGS (3D ED.): Text: 19.3–19.4 · READINGS (4TH ED.): Text: 19.3–19.4
- LEC #: L 25 · TOPICS: Sensors I · READINGS (3D ED.): Phidgets documentation · READINGS (4TH ED.): Phidgets documentation
- LEC #: L 26 · TOPICS: Sensors II · READINGS (3D ED.): Phidgets documentation · READINGS (4TH ED.): Phidgets documentation
- LEC #: L 27 · TOPICS: Design Lab III - Sensors · READINGS (3D ED.): — · READINGS (4TH ED.): —
- LEC #: L 28 · TOPICS: Threads · READINGS (3D ED.): Text 21.1–21.3 · READINGS (4TH ED.): Text 20.1–20.3
- LEC #: L 29 · TOPICS: Threads and Sensors · READINGS (3D ED.): Text 21.4 · READINGS (4TH ED.): Text 20.4
- LEC #: L 30 · TOPICS: Matrices · READINGS (3D ED.): Numerical Recipes (NR) 32–36 · READINGS (4TH ED.): NR 32–36
- LEC #: L 31 · TOPICS: Linear Systems · READINGS (3D ED.): NR 37–42 · READINGS (4TH ED.): NR 37–42
- LEC #: L 32 · TOPICS: Integration · READINGS (3D ED.): NR 129–139 · READINGS (4TH ED.): NR 129–139
- LEC #: L 33 · TOPICS: Root Finding · READINGS (3D ED.): NR 347–368 · READINGS (4TH ED.): NR 347–368
- LEC #: L 34 · TOPICS: Sorting · READINGS (3D ED.): Text: 14.1–14.3 · READINGS (4TH ED.): Text: 14.1–14.3
- LEC #: L 35 · TOPICS: Stacks, Queues · READINGS (3D ED.): Text: 15.4 · READINGS (4TH ED.): Text: 15.4
- LEC #: L 36 · TOPICS: Lists · READINGS (3D ED.): Text: 15.1–15.3 · READINGS (4TH ED.): Text: 15.1–15.3
- LEC #: L 37 · TOPICS: Storing Data: Trees, Hash Tables · READINGS (3D ED.): Text: 16.5–16.7 · READINGS (4TH ED.): Text: 16.5–16.6
Prerequisites & course information
Subject meets with 1.001 Prereq: Calculus I (GIR) and (( 6.100A and 6.100B ) or ( 6.100L and 16.C20[J] )) U (Spring) 3-2-7 units. REST
Sources
- Course catalogue ↗2026–2027
- MIT OpenCourseWare ↗Spring 2012
- MIT OCW syllabus ↗
- MIT OCW readings ↗
- Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.