MITx: 6.00.1x Lecture Handouts

Lecture 1

Lecture 1.1 - Intro to CS and Programming

Lecture 1.2 - Computational Problem Solving

Lecture 1.3 - Capturing a Recipe in a Mechanical Process

Lecture 1.4 - Creating "Recipes"

Lecture 2

Lecture 2.1 - Programming Languages

Lecture 2.2 - Python Programs

Lecture 2.3 - Simple Means of Abstraction

Lecture 2.4 - Strings

Lecture 2.5 - Simple Scripts

Lecture 2.6 - Branching Programs

- Lec2.6.2.py

- Lec2.6.4.py

Lecture 3

Lecture 3.1 - Iteration

- Lec3.1.2.py

Lecture 3.2 - Guess and Check Algorithms

- Lec3.2.4.py

- Lec3.2.6.py

Lecture 3.3 - Loop Mechanisms

- Lec3.3.3.py

Lecture 3.4 - Floating Point Accuracy

- Lec3.4.3.py

- Lec3.4.4.py

Lecture 3.5 - Approximation Methods

- Lec3.5.2.py

Lecture 3.6 - Bisection Search

- Lec3.6.2.py

Lecture 3.7 - Newton-Raphson Root Finding

- Lec3.7.3.py

Lecture 4

Lecture 4.1 - Creating Functions

Lecture 4.2 - Environments

Lecture 4.3 - Computing Powers as an Example

- iterativePower.py

Lecture 4.4 - Understanding Variable Binding

Lecture 4.5 - How Environments Separate Variable Bindings

- twoPower.py

Lecture 4.6 - Understanding Root Finding

- roots.py

Lecture 4.7 - Modules

- circle.py

Lecture 5

Lecture 5.1 - Iterative Algorithms

- iterMul.py

Lecture 5.2 - Recursive Algorithms

- recMul.py

Lecture 5.3 - Using Environments to Understand Recursion

Lecture 5.4 - Inductive Reasoning

Lecture 5.5 - Factorial Time

- fact.py

Lecture 5.6 - Towers of Hanoi

- towers.py

Lecture 5.7 - Fibonacci

- fib.py

Lecture 5.8 - Recursion on Strings

- isPal.py

Lecture 5.9 - Global Variables

- fibMetered.py

Lecture 6

Lecture 6.1 - Tuples

- divisors.py

Lecture 6.2 - Lists

- Universities.py

Lecture 6.3 - Operations on Lists

- removeDups.py

Lecture 6.4 - Functions as Objects

- applyToEach.py

Lecture 6.5 - Dictionaries

Lecture 7

Lecture 7.1 - Testing and Debugging

Lecture 7.2 - Test Suites

Lecture 7.3 - Black-Box Testing

Lecture 7.4 - Glass-Box Testing

Lecture 7.5 - Test Drivers and Stubs

Lecture 7.6 - Debugging

Lecture 7.7 - Debugging as Search

- Lec7Tests.py

Lecture 8

Lecture 8.1 - Exceptions

- exceptionsCode.py

Lecture 8.2 - Error Handling

- subjectCode.py

Lecture 8.3 - Exceptions as Control Flow

Lecture 8.4 - Assertions

Lecture 9

Lecture 9.1 - Measuring Complexity

Lecture 9.2 - Asymptotic Notation

Lecture 9.3 - Complexity Classes

Lecture 9.4 - Comparing Complexity Classes

Lecture 10

Lecture 10.1 - Search Algorithms

Lecture 10.2 - Binary Search

Lecture 10.3 - Selection Sort

Lecture 10.4 - Merge Sort

Lecture 10.5 - Hashing

Lecture 11

Lecture 11.1 - User-defined Types

Lecture 11.2 - A Class Example

- coordinate.py

Lecture 11.3 - An Environment View of Classes

Lecture 11.4 - Adding Methods to a Class

- coordinate.py

Lecture 11.5 - Example Class: A Set of Integers

- intset.py

Lecture 12

Lecture 12.1 - Inheritance

- lecture12-1-code.py

Lecture 12.2 - Using Inheritance Subclasses to Extend Behavior

- lecture12-2-code.py

Lecture 12.3 - Using Inheritance: Designing a Class Hierarchy

- lecture12-3-code.py

Lecture 12.4 - Example: A Gradebook

- lecture12-4-code.py

Lecture 12.5 - Generators

Lecture 13

Lecture 13.1 - Trees Introduction

- treeSearch.py

Lecture 13.2 - Searching a Tree

- treeSearch.py

Lecture 13.3 - Decision Trees

- treeSearch.py

Lecture 13.4 - Implicit Search

- treeSearch.py

Lecture 13.5 - Overgrown Trees

- treeSearch.py

Wrap Up

Wrap Up 1 - Computational Thinking

Wrap Up 2 - Where Have You Been?

Wrap Up 3 - Where are You Headed?