Ana Bell
Lecturer · MIT · Distinguished Educator
Ana Bell is a Lecturer in Electrical Engineering and Computer Science at MIT and lead instructor for its foundational Python programming courses.
- lectures
- 25
- series
- 1
- hours
- 26
Start here
Series and courses
Introduction to Computer Science and Programming using Python
Open the course
- 1Python Class Methods: Decomposition and Abstraction
- 2Python Classes
- 3Recursion on Non-numeric Data Structures
- 4Exceptions and Assertions in Python
Show 21 moreShow fewer
- 5List Comprehension, Functions as Objects, Testing, and Debugging in Python
- 6Aliasing and Cloning in Python
- 7Lists and Mutability in Python
- 8Recursion
- 9Lambda Functions, Tuples, and Lists in Python
- 10Functions as Objects
- 11Decomposition, Abstraction, and Functions
- 12Bisection Search and Newton-Raphson
- 13Floats and Approximation Methods
- 14Loops over Strings, Guess-and-Check, and Binary
- 15Iteration and Control Flow in Python
- 16Strings, Input/Output, and Branching in Python
- 17Introduction to Computation and Python Programming
- 18Inheritance
- 19Fitness Tracker Object-Oriented Programming Example
- 20Timing Programs and Counting Operations
- 21Big Oh and Theta Notation for Algorithmic Efficiency
- 22Complexity Classes Examples
- 23Sorting Algorithms
- 24Plotting
- 25List Access, Hashing, Simulations, and Course Wrap-Up
In these lectures
- Binary search requires a sorted list and runs in time, making it faster than linear search only when amortized over multiple queries.Sorting Algorithms
- Computers execute step-by-step instructions blindly and do not infer intent.Introduction to Computation and Python Programming
- Recursion solves problems by dividing them into smaller instances of the same problem alongside a base case.Recursion
Draws on
People cited in the lectures, at the moment of the citation.
- Alan TuringCited for showing that any computation can be performed using a very basic set of six primitives.
- Sam MaddenCited for providing the OOP example slides.
- Fibonacci (Leonardo of Pisa)Circa 1202, creator of the Fibonacci sequence modeled after rabbit population growth.
About
Ana Bell is a Lecturer in Electrical Engineering and Computer Science at MIT and lead instructor for its foundational Python programming courses. Her introductory lectures assume no prior programming and run from strings and branching through bisection search, Newton-Raphson, recursion, and shallow and deep copies.
Same subject, Computer Systems & Software
Connections
28Their places, courses, books and lectures.
Institution1
Concept1
Lectures25
- Sorting Algorithms
- Introduction to Computation and Python Programming
- Recursion
- Lists and Mutability in Python
- Strings, Input/Output, and Branching in Python
- Timing Programs and Counting Operations
Show 19 moreShow fewer
- Decomposition, Abstraction, and Functions
- Functions as Objects
- Fitness Tracker Object-Oriented Programming Example
- List Comprehension, Functions as Objects, Testing, and Debugging in Python
- Aliasing and Cloning in Python
- Iteration and Control Flow in Python
- Big Oh and Theta Notation for Algorithmic Efficiency
- Python Classes
- Bisection Search and Newton-Raphson
- Exceptions and Assertions in Python
- Lambda Functions, Tuples, and Lists in Python
- Plotting
- Python Class Methods: Decomposition and Abstraction
- Loops over Strings, Guess-and-Check, and Binary
- Recursion on Non-numeric Data Structures
- Inheritance
- Complexity Classes Examples
- List Access, Hashing, Simulations, and Course Wrap-Up
- Floats and Approximation Methods


