Opening Storage Allocation and Garbage Collection
Storage Allocation and Garbage Collection
- Length
- 59 min
- Level
- Undergraduate
- Recorded
- MIT2009
Chapter 1 of 7: Representation of data structures
Demonstrates mark-sweep and copying garbage collection algorithms, then proves the halting theorem by diagonal argument.
MIT 6.001 session 20 covers free-list allocation and garbage collection in the undergraduate course Structure and Interpretation of Computer Programs. Abelson and Sussman contrast mark-and-sweep with copying collection and prove the halting theorem by diagonalization.
MIT 6.001 session 20 covers free-list allocation and garbage collection in the undergraduate course Structure and Interpretation of Computer Programs. Abelson and Sussman contrast mark-and-sweep with copying collection and prove the halting theorem by diagonalization.

This lecture
Lecture 20 of 21 of Structure and Interpretation of Computer Programs (SICP).
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above.
Press a chosen node again to open it.
Your comment is kept while you sign up.Sign in