sharon_150.jpg

Home
About ADUni
Courses
People
Colloquia

FAQ  ||  transcripts  ||  alumni

The Structure and Interpretation of Computer Programs

Holly Yanco and John Pezaris

Lectures |  Problem Sets |  Exams |  Course Evaluation  

Course Description

An introduction to programming and the power of abstraction, using Abelson and Sussman's classic textbook of the same name. Key concepts include: building abstractions, computational processes, higher-order procedures, compound data, data abstractions, controlling interactions, generic operations, self-describing data, message passing, streams and infinite data structures, meta-linguistic abstraction, interpretation of programming languages, machine model, compilation, and embedded languages.

Text: Structure and Interpretation of Computer Programs, Abelson and Sussman

Reference: Simply Scheme, Harvey and Wright.

Requirements: Three exams and nine problem sets.


 

Lectures
[stream | download] 10-02-00: More scheme intro, substitution model
[stream | download] 10-03-00: Orders of growth, recursion/ iteration
[stream | download] 10-04-00: Higher-order procedures
[stream | download] 10-05-00: Compound data
[stream | download] 10-06-00: Aggregate data
[stream | download] 10-10-00: Henderson picture language
[stream | download] 10-11-00: Symbolic data
[stream | download] 10-12-00: Data structures
[stream | download] 10-13-00: Multiple representations of data
[stream | download] 10-16-00: Generic operators
[stream | download] 10-17-00: State
[stream | download] 10-23-00: Metacircular evaluator
[stream | download] 10-23-00: Recitation
[stream | download] 10-24-00: More on the metacircular evaluator
[stream | download] 10-24-00: Recitation
[stream | download] 10-25-00: Register Machines I
[stream | download] 10-25-00: Register Machines II
[stream | download] 10-26-00: EC eval
[stream | download] 10-27-00: Compilation
Lecture Notes
Lecture Notes 01.html
Lecture Notes 02.html
Lecture Notes 03.html
Lecture Notes 04.html
Lecture Notes 05.html
Lecture Notes 06.html
Handouts
Higher Order Procedures.scm
Jeopardy Board.txt
Jeopardy Game.txt
Jeopardy Solutions.txt
Lists.scm
Orders of Growth.scm
Recitation Handout
Streams.scm
Symbolic Differentiation.scm
Tagged Data.scm
Trees.scm
Problem Sets
Problem Set 01.pdf
Problem Set 01.scm
Problem Set 01 Solutions.scm
Problem Set 01 code.scm
Problem Set 02.pdf
Problem Set 02 Solutions.scm
Problem Set 03.pdf
Problem Set 03.scm
Problem Set 03 Solutions.scm
Problem Set 04 Solutions.scm
Problem Set 04 additional.scm
Problem Set 04 go.scm
Problem Set 04 hend.scm
Problem Set 04 hutils.scm
Problem Set 04 prmpnt.scm
Problem Set 05.pdf
Problem Set 05 Solutions.scm
Problem Set 05 adv.scm
Problem Set 05 match.scm
Problem Set 06.pdf
Problem Set 06 Solutions.scm
Problem Set 06 generic.scm
Problem Set 06 put-get.scm
Problem Set 06 types.scm
Problem Set 07.pdf
Problem Set 07 Solutions.scm
Problem Set 07 game.scm
Problem Set 07 world.scm
Problem Set 08.pdf
Problem Set 08 Solutions.scm
Problem Set 08 code.scm
Problem Set 09.pdf
Problem Set 09 Solutions.scm
Problem Set 09 mc-eval.scm
Problem Set 10.pdf
Problem Set 10 Solutions.scm
Problem Set 10 analyze.scm
Problem Set 10 mc-eval.scm
Problem Set Code.zip
Problem Sets.scm
Exams
Exam 01.pdf
Exam 01 Solutions.pdf
Exam 02.pdf
Exam 02 Solutions.pdf
Exam 03.pdf
Exam 03 Solutions.pdf
Exam 04.pdf
Exam 04 Solutions.pdf
Links
SICP full online text (arsdigita, MIT Press)
Revised (4) Report on the Algorithmic Language Scheme
The Internet Scheme Repository
schemers.org
Holly's recitation for 6.001, the MIT SICP course
6.001 course page
6.001 archive
another 6.001 archive


Site last updated: 10 August 2001
Comments: webmaster@aduni.org