Composing Programs
This deck is based on the textbook for the UC Berkeley CS 61A course, and is based on the classic computer science book Structure and Interpretation of Computer Programs by Harold Abelson and Gerald Jay Sussman.
This version of the text has been updated from the original to use Python, instead of Scheme.
Composing Programs by John DeNero, based on the textbook Structure and Interpretation of Computer Programs by Harold Abelson and Gerald Jay Sussman, is licensed under a Creative Commons Attribution-ShareAlike 3.0 Unported License.
Choose how to study
Flash Cards
Flip between question and answer, in both languages, at your own pace.
Rapid Repetition
Short sessions that resurface exactly what you forget, until it sticks.
Practice Test
Exam-style questions with a score at the end. Find your weak spots.
Quiz Game
Beat the clock: answer before time runs out and raise your high score.
Explore the topics
Read it all?
Rapid repetition replays exactly what you forget — the fastest way to lock it in before the exam.