learning-sicp

《Structure and Interpretation of Computer Programs》学习笔记

学习资源

1 Building Abstractions with Procedures

1.1 The Elements of Programming
- 1.1.6 Conditional Expressions and Predicates (ex1.1, ex1.2, ex1.3, ex1.4, ex1.5)
- 1.1.7 Example: Square Roots by Newton's Method (ex1.6, ex1.7, ex1.8)
1.2 Procedures and the Processes They Generate
- 1.2.1 Liner Recursion and Iteration (ex1.9, ex1.10)
- 1.2.2 Tree Recursion (ex1.11, ex1.12)
- 1.2.3 Orders of Growth (ex1.14, ex1.15)
- 1.2.4 Exponentiation (ex1.16, ex1.17, ex1.18)
- 1.2.5 Greatest Common Divisors (ex1.20)
- 1.2.6 Example: Testing for Primality (ex1.21, ex1.22, ex1.23, ex1.25, ex1.26, ex1.27, ex1.28)
1.3 Formulating Abstractions with Higher-Order Procedures
- 1.3.1 Procedures as Arguments (ex1.29, ex1.30, ex1.31, ex1.32, ex1.33)
- 1.3.2 Constructing Procedures Using Lambda (ex1.34)
- 1.3.3 Procedures as General Methods (ex1.35, ex1.36, ex1.37, ex1.38, ex1.39)
- 1.3.4 Procedures as Returned Values (ex1.40, ex1.41, ex1.42, ex1.43, ex1.44, ex1.45, ex1.46)

2 Building Abstractions with Data

2.1 Introduction to Data Abstraction
- 2.1.1 Example: Arithmetic Operations for Rational Numbers (ex2.1)
- 2.1.2 Abstraction Barriers (ex2.2, ex2.3)
- 2.1.3 What Is Meant by Data? (ex2.4, ex2.5, ex2.6)
- 2.1.4 Extended Exercise: Interval Arithmetic (ex2.7, ex2.8, ex2.9, ex2.10, ex2.11, ex2.12)
2.2 Hierarchical Data and the Closure Property
- 2.2.1 Representing Sequences (ex2.17, ex2.18, ex2.19, ex2.20, ex2.21, ex2.22, ex2.23)
- 2.2.2 Hierarchical Structures (ex2.24, ex2.25, ex2.26, ex2.27, ex2.28, ex2.29, ex2.30, ex2.31, ex2.32)
- 2.2.3 Sequences as Conventional Interfaces (ex2.33, ex2.34, ex2.35, ex2.36, ex2.37, ex2.38, ex2.39, ex2.40, ex2.41, ex2.42, ex2.43)
- 2.2.4 Example: A Picture Language (ex2.44, ex2.45, ex2.46, ex2.47, ex2.48, ex2.50, ex2.51)
2.3 Symbolic Data
- 2.3.1 Quotation(ex2.53, ex2.54, ex2.55)