Lecture slides are available as either the original PowerPoint slides (download the PPT link) or PDF for printing (6 slides per page).
What is Computer Science?
Computer Science and the Liberal Arts
The Apollo Guidance Computer
Course Expectations, Drinking from the Firehose
Recursive Definitions and hippopotomonstrosesquipedaliophobia
History of Computer Programming
Describing Languages
Backus-Naur Form
Scheme
Questions
Rules of Evaluation
Using the Evaluation Rules
Defining Procedures
Problem Set 1
Constructing Procedures
Pairs
Lists
Defining recursive list procedures
list-trues, list-sum
List procedures: is-list?, deep-list-sum
Generalizing list procedures
find-closest
GEB Chapter 5:
Fibonacci
Recursive Transition Networks
Stacks in Music
Problem Set 2
list-map
Using list-map
PS3
Generalizing list procedures: list-cruncher

Class 12: Costs and Sneezewort (Westley Weimer) [PDF full size, PDF for printing]

Sneezewort and Fibonacci
Cost of Fibonacci
Cost of Sorting

Class 13: Asymptotic Growth (Westley Weimer) [PDF full size, PDF for printing]

Analyzing Sorting
Asymptotic Notation: O, Ω, Θ

Class 14: Sort Procedures and Quicker Sorting (Westley Weimer) [PDF full size, PDF for printing]

Asymptotic Operator Review
Logic Machines
Insertion Sort
Analyzing Recursive Procedures
Finishing flatten-lcommands
power

Nobel Prize: CCD
Story so Far
Mutation

Stateful Evaluation Rules
Exam 1

append vs. append!
Aliasing

Class 22: No Slides

PS6, PS7, Project
Objects
Real Databases

Python
Programming with Objects
Inheritance

Python Dictionaries
History of Object-Oriented Programming

"Trick or Treat" Protocols
Interpreters

Completing the Charme Interpreter
History of Object-Oriented Programming

Class 32: Web Applications (Kinga Dobolyi) [PPTX, PDF]

Class 35: No Slides

Non-Computability of Virus Detection
Turing's Model

Universal Turing Machines
Church-Turing Thesis