(logo)
(navigation image)
Home

Search: Advanced Search

Anonymous User (login or join us)Upload

Related Subjects

ars digita
computer science
programming
abstraction

[item image]

Readings

Exam #01
Exam #01 - Solutions
Exam #02
Exam #02 - Solutions
Exam #03
Exam #03 - Solutions
Exam #04
Exam #04 - Solutions
Handout - Jeopardy Board
Handout - Jeopardy Game
Handout - Jeopardy Solutions
Problem Set #01
Problem Set #02
Problem Set #03
Problem Set #05
Problem Set #06
Problem Set #07
Problem Set #08
Problem Set #09
Problem Set #10

Video Files

Lecture 1: Introduction to Scheme, substitution model
Lecture 2: Orders of growth, recursion/iteration
Lecture 3: Higher-order procedures
Lecture 4: Compound data
Lecture 5: Aggregate data
Lecture 6: Henderson picture language
Lecture 7: Symbolic data
Lecture 8: Data structures
Lecture 9: Multiple representations of data
Lecture 10: Generic operators
Lecture 11: Topics: State
Lecture 12: Metacircular evaluator
Lecture 13: Recitation - Metacircular Evaluator
Lecture 14: More on the metacircular evaluator
Lecture 15: Recitation Recitation -- Streams, Tables, Memoization
Lecture 16: Register Machines I
Lecture 17: Register Machines II
Lecture 18: EC evaluation
Lecture 19: Compilation

Other Files

Handout - Higher Order Procedure (Scheme file)
Handout - Lists (Scheme file)
Handout - Orders of Growth (Scheme file)
Handout - Recitation (Scheme file)
Handout - Streams (Scheme file)
Handout - Symbolic Differentiation (Scheme file)
Handout - Tagged Data (Scheme file)
Handout - Trees (Scheme file)
Problem Set #01 (Scheme file)
Problem Set #01 - Code (Scheme file)
Problem Set #01 - Solutions (Scheme file)
Problem Set #02 - Solutions (Scheme file)
Problem Set #03 (Scheme file)
Problem Set #03 - Solutions (Scheme file)
Problem Set #04 - Additional Set (Scheme file)
Problem Set #04 - Go (Scheme file)
Problem Set #04 - Henderson (Scheme file)
Problem Set #04 - Henderson Utilities (Scheme file)
Problem Set #04 - Primitive Painters (Scheme file)
Problem Set #04 - Solutions (Scheme file)
Problem Set #05 - Advisor (Scheme file)
Problem Set #05 - Match (Scheme file)
Problem Set #05 - Solutions (Scheme file)
Problem Set #06 - Generic (Scheme file)
Problem Set #06 - Put/Get (Scheme file)
Problem Set #06 - Solutions (Scheme file)
Problem Set #06 - Types (Scheme File)
Problem Set #07 - Game (Scheme file)
Problem Set #07 - Solutions (Scheme file)
Problem Set #07 - World (Scheme file)
Problem Set #08 - Code (Scheme file)
Problem Set #08 - Solutions (Scheme file)
Problem Set #09 - MC Evaluation (Scheme file)
Problem Set #09 - Solutions (Scheme file)
Problem Set #10 - Analyze (Scheme file)
Problem Set #10 - MC Evaluation (Scheme file)
Problem Set #10 - Solutions (Scheme file)
Problem Set Code Zipped Files (Scheme files)
Problem Sets (Scheme file)

All Files: HTTP

Resources

Bookmark

Course 01: The Structure and Interpretation of Computer Programs (ArsDigita University) (2000)

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.

19 lectures (RealMedia format).

Instructors: Holly Yanco and John Pezaris

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

Reference: Simply Scheme, Harvey and Wright.

Requirements: Four exams and ten problem sets.


This educational material is part of the collection: ArsDigita Computer Science University

About this Item

Date: 2000
Audio/Visual: sound, color


Write a review
Downloaded 20,889 times
Reviews
Average Rating: [4.0 out of 5 stars]

Reviewer: wolfgangsoke - [4.0 out of 5 stars] - February 7, 2006
Subject: Useful for trainers & teachers
The series is very useful in teaching basics

Segments

Lecture 1: October 2, 2000 - Topics: Introduction to Scheme, substitution model
Lecture 2: October 3, 2000 - Topics: Orders of growth, recursion/iteration
Lecture 3: October 4, 2000 - Topics: Higher-order procedures
Lecture 4: October 5, 2000 - Topics: Compound data
Lecture 5: October 6, 2000 - Topics: Aggregate data
Lecture 6: October 10, 2000 - Topics: Henderson picture language
Lecture 7: October 11, 2000 - Topics: Symbolic data
Lecture 8: October 12, 2000 - Topics: Data structures
Lecture 9: October 13, 2000 - Topics: Multiple representations of data
Lecture 10: October 16, 2000 - Topics: Generic operators
Lecture 11: October 17, 2000 - Topics: State
Lecture 12: October 23, 2000 - Topics: Metacircular evaluator
Lecture 13: October 23, 2000 - Topics: Recitation -- Metacircular evaluator
Lecture 14: October 24, 2000 - Topics: More on the metacircular evaluator
Lecture 15: October 24, 2000 - Topics: Recitation -- Streams, tables, memoization
Lecture 16: October 25, 2000 - Topics: Register Machines I
Lecture 17: October 25, 2000 - Topics: Register Machines II
Lecture 18: October 26, 2000 - Topics: EC evaluation
Lecture 19: October 27, 2000 - Topics: Compilation


Terms of Use (10 Mar 2001)