Starter logbook · Course

MIT 6.100L: Introduction to CS and Programming Using Python

MIT OpenCourseWare · online · 26 lectures with problem sets

A first course in computer science, in Python, for people with little or no programming: the parts of a program, simple algorithms, functions, lists and dictionaries, recursion and classes, then how fast programs run, searching and sorting. It is the full-semester version of MIT’s 6.100A, formerly 6.0001.

One session a lecture: park a question at the minute it came up in the video, answer it in the problem set, and it becomes a recall card.

Take 6.100L at MIT OpenCourseWare

What the logbook holds

26 sessions · 9 topics · 26 questions

  1. Lecture 1 · Getting started: what a program is made of
  2. Lecture 2 · Text, input and making a choice
  3. Lecture 3 · Loops: repeating steps
  4. Lecture 4 · First small programs: trying answers in turn
  5. Lecture 5 · Getting close enough: approximations and floats
  6. Lecture 6 · Halving the search: bisection and Newton’s method
  7. Lecture 7 · Functions: splitting a problem into parts
  8. Lecture 8 · Functions: where names live, and functions as values
  9. Lecture 9 · Tuples and lists: values in order
  10. Lecture 10 · Changing lists in place
  11. Lecture 11 · Two names for one list, copies, and list comprehensions
  12. Lecture 12 · More about arguments, and first steps in testing
  13. Lecture 13 · Exceptions and assertions
  14. Lecture 14 · Dictionaries: looking things up by key
  15. Lecture 15 · Recursion: a function that calls itself
  16. Lecture 16 · Recursion in practice, and remembering past answers
  17. Lecture 17 · Classes: making my own kinds of objects
  18. Lecture 18 · Classes: special methods that make objects act like built-ins
  19. Lecture 19 · Inheritance: building one class on another
  20. Lecture 20 · Inheritance: more worked examples
  21. Lecture 21 · Efficiency: timing programs and counting steps
  22. Lecture 22 · Efficiency: describing growth with Big O
  23. Lecture 23 · Searching, and working out how long it takes
  24. Lecture 24 · Sorting: from slow ideas to merge sort
  25. Lecture 25 · Drawing charts from data
  26. Lecture 26 · Extras and wrap-up: lists in memory, hashing and simulations

6.100L is from MIT OpenCourseWare, shared under CC BY-NC-SA 4.0. This logbook is Soundings’ own: session names and questions written for it, nothing copied from the course.

All starter logbooks