CS212
Structure and Interpretation
of Computer Programs

Computer Science Department
Cornell University
Spring 1998

Course Materials

Downloadable Software

• Noodlle (Dylan interpreter): you can either download it or use the on-line version
• Download the newest Java-enabled Netscape Navigator.
• Download the newest Java-enabled Microsoft Internet Explorer
  Warning: NOODLLE's operation in IE is unsupported and unreliable. It is highly recommended that you use Netscape.

Handouts

• Notes on Dylan
• Dylan Quick Reference
• Substitution model
• Induction
• Dylan Programming Tips
• Order of Growth

Optional Reading

• Comparison of Dylan to C++

Problem Sets

• Problem Set 1
  • Issued: 1/27/98, Due: 2/5/98
  • ps1.dyl
  • For the curious: What is Fractal Dimension?
  • The average grade for Problem Set 1 was 92
• Problem Set 2
  • Issued: 02/09/98, Due: 2/24/98
  • ps2.dyl
  • The average grade for Problem Set 2 was 93.1
• Problem Set 3
  • Issued: 02/26/98, Due: 3/10/98
  • ps3.dyl
  • The average grade for Problem Set 3 was 78.7
• Problem Set 4
  • Issued: 03/11/98, Due: 3/30/98
  • ps4.dyl
  • The average grade for Problem Set 4 was 90 (out of 101)
• Problem Set 5 (last updated 4/13 2:00pm)
  • Issued: 03/31/98, Due: 4/14/98
  • ps5.dyl (last updated 4/9 9:52pm)
  • The average grade for Problem Set 5 for 91.8 (out of 119)
  • Solutions
• Problem Set 6 (last updated 4/14 6:30p)
  • Issued: 04/14/98, Dueish: 5/1/98
  • ps6.dyl
  • classes.dyl
  • frames.dyl
  • brenda.dyl
  • primitives.dyl
  • special-forms.dyl
  • utilities.dyl
  • ps6-opt.dyl
  • The average grade for Problem Set 6 was 73.2 (out of 83)

Lecture Notes

• [1/20] (Professor Kozen) The Study of Computation, and an Introduction to Dylan
• [1/22] (Professor Kozen) Function Abstraction, Substitution Model
• [1/27] More on Methods, the Substitution Model
• [1/29] Iterative and Recursive Processes, Induction as a Reasoning Tool
• [2/3] Higher Order Procedures
• [2/5] Data Structures, More on Higher Order Procedures
• [2/10 and 2/12] Order of Growth (big-O) and Analysis of Algorithms
• [2/17 and 2/19] Abstraction, Implementing Rational Numbers
• [2/24] Structural Induction
• [2/26] Symbolic Differentiation
• [3/3] Generic Operations
• [3/5] Generic Operations and Coercion
• [3/10] More Structural Induction
• [3/12] Assignments: set!. Environment Model of Evaluation
• [3/24] Environment Model of Evaluation
• [3/26]
• [3/31] Stacks, Queues, and Mutable Data Structures
• [4/2] Object-Oriented Programming
• [4/7 and 4/9] Metacircular Evaluator
• [4/14 and 4/16] Compiler
• [4/21 and 4/23] Streams
• [4/28]
• [4/30] Computability

Lecture notes for each lecture will be available soon after the lecture itself.

Section Notes

• [1/26]  Functional Abstraction, Substitution Model of Evaluation
• [1/28] About Dylan, the Meaning of ()'s, Substitution Model, Special Forms, Code Generalization
• [2/2]
• [2/4] Induction
• [2/9] List Structures
• [2/11] Lists Functions and Structure Review. Append.
• [2/16] Time and Space Complexity
• [2/18] More List Functions, Analysis of their Running Times.
• [2/23] Sets; Defining a New Class in Dylan
• [2/25] Quote and Read Functions, Induction on Lists and "Trees".
• [3/2] Symbolic Differentiation, cont.
• [3/4]
• [3/9] Prelim Solutions
• [3/11]
• [3/23]
• [3/25]
• [3/30] Environment Model
• [4/1] Priority Queues
• [4/6]
• [4/8] Stack, Queue, Mutable Data Structures
• [4/13] Streams
• [4/15]
• [4/20]
• [4/22]
• [4/27]
• [4/29]

Exam Information*

* Note: If you have a conflict, and will need to take a make-up exam, please notify Professor Morrisett as soon as possible.

Some people wanted to get some exercises to get ready for the exam. Here are some. Note that this cannot be taken as any kind of indication to what will actually be on the test.

Statistics

CS212 home page

Last updated: 01/19/00 11:36 PM