sicp

Structure and Interpretation of Computer Programs by Abelson and Sussman

exercises

ch 1 building abstractions with procedures

• 1.1 the elements of programming
• 1.2.1 linear recursion and iteration
• 1.2.2 tree recursion
• 1.2.3 orders of growth
• 1.2.4 exponentiation
• 1.2.5 greatest common divisors
• 1.2.6 primality testing
• 1.3.1 procedures as arguments
• 1.3.2 constructing procedures using lambda
• 1.3.3 procedures as general methods
• 1.3.4 procedures as returned values

ch 2 building abstractions with data

• 2.1.1 arithmetic operations for rational numbers
• 2.1.2 abstraction barriers
• 2.1.3 what is meant by data
• 2.1.4 extended exercise interval arithmetic
• 2.2.1 representing sequences
• 2.2.2 hierarchical structures
• 2.2.3 sequences as conventional interfaces
• 2.2.4 a picture language
• 2.2.4 the drawing program
• 2.2.4 test images
• 2.3.1 quotation
• 2.3.2 symbolic differentiation
• 2.3.3 representing sets
• 2.3.4 huffman encoding trees
• 2.4 multiple representations for abstract data
• 2.5.1 generic arithmetic operations
• 2.5.2 combining data of different types
• 2.5.2 the generic arithmetic program
• 2.5.3 the symbolic algebra program

ch 3 modularity, objects, and state

• 3.1 assignment and local state
• 3.2 the environment model of evaluation
• 3.3.1 mutable list structure
• 3.3.2 representing queues
• 3.3.3 representing tables
• 3.3.4 a simulator for digital circuits
• 3.3.4 the digital circuits simulator program
• 3.3.4 test cases
• 3.3.5 propagation of constraints
• 3.4.1 the nature of time in concurrent systems
• 3.4.2 mechanisms for controlling concurrency
• 3.5 streams
• 3.5.1 streams are delayed lists
• 3.5.2 infinite streams
• 3.5.3 exploiting the stream paradigm
• 3.5.4 streams and delayed evaluation
• 3.5.5 modularity of functional programs and modularity of objects

ch 4 metalinguistic abstraction

• 4.1.1 the core of the evaluator
• 4.1.2 representing expressions
• 4.1.3 evaluator data structures
• 4.1.4 running the evaluator as a program
• 4.1.4 repl program
• 4.1.4 repl test
• 4.1.5 data as programs
• 4.1.6 internal defintions
• 4.1.7 separating syntactic analysis from execution
• 4.1.7 repl program
• 4.1.7 repl test
• 4.2.1 normal order and applicative order
• 4.2.2 an interpreter with lazy evaluation
• 4.2.2 lazy repl program
• 4.2.2 lazy repl test
• 4.2.2 optionally lazy repl program
• 4.2.3 streams as lazy lists
• 4.2.3 lazy lists repl program
• 4.2.3 lazy lists repl test
• 4.3.1 amb and search
• 4.3.2 examples of nondeterministic programs
• 4.3.3 implementing the amb evaluator
• 4.3.3 amb repl program
• 4.3.3 amb repl test
• 4.3.3 exercises amb repl program
• 4.3.3 exercises amb repl test
• 4.4.1 deductive information retrieval
• 4.4.2 how the query system works - no exercises
• 4.4.3 is logic programming mathematical logic
• 4.4.4 implementing the query system

ch 5 computing with register machines