The primary lecture material for 6.001 can be found on the course website.
recitation 1: scheme expressions
recitation 2: lambda & rules for application
recitation 3: substitution model
recitation 4: recursive/iterative processes
recitation 5: cons/car/cdr/list
recitation 6: higher order procedures & types
recitation 7: some practice problems
(sample solutions)
recitation 8: more review & more tree problems
(sample solutions)
recitation 9: designing/writing the prisoner's dilemma tournament
recitation 10: symbols, sentences & binary trees
recitation 11: tagged data
recitation 12: association lists & hash tables
recitation 13: mutation
recitation 14: environment diagrams
recitation 15: message passing
recitation 16: object-oriented programming
recitation 17: more object-oriented programming
recitation 18: quiz 2 review
recitation 19: interpretation
recitation 20: metacircular evaluator
recitation 21: more evaluator practice
recitation 22: lazy evaluation & streams (Manish led recitation)
recitation 23: static analysis & the halting problem
recitation 24: register machines
recitation 25: the stack, subroutines & recursion
recitation 26: eval as a register machine
(explicit control evaluator)
recitation 27: Jeopardy!
David Ziegler has posted a collection of 6.001 final exams
The exam coverage may vary slightly from term to term,
but
these are good examples of what to expect.