Structure and Interpretation of Computer Programs
1. Building Abstractions with Procedures
1.1 The Elements of Programming
1.1.7 Square Roots by Newton’s Method
1.2 Procedures and the Processes They Generate
- Exercise 1.9
- Exercise 1.10
- Exercise 1.11
- Exercise 1.12
- Exercise 1.13
- Exercise 1.14
- Exercise 1.15
- Exercise 1.16
- Exercise 1.17
- Exercise 1.18
- Exercise 1.19
- Exercise 1.20
- Exercise 1.21
- Exercise 1.22
My picks, from now on in CL 😉
1.3 Formulating Abstractions with Higher-Order Procedure
last time i skipped this part because I hadn’t learnt how to funcall/apply, but now that “i’m finally back”,
it’s simply amazing how it could “go up in abstraction”, from SUM to ACCUMULATE and to FILTERED-ACCUMULATE.
and yet another piece of awesomeness, FIXED-POINT. I’ve never thought about solving equations through recursions; and average dumping, how could it be so much faster? curious.
2. Building Abstractions with Data
2.1 Introduction to Data Abstraction
//this part was written last time:
- Exercise 2.2
- Exercise 2.3
- Exercise 2.27
- Exercise 2.28
- Exercise 2.29
- Exercise 2.30-32
- Exercise 2.33-34
- Exercise 2.35
- Exercise 2.36-37
- Exercise 2.38-39
- Exercise 2.40-41
- Exercise 2.42-43
- Exercise 2.44-45
- Exercise 2.46-47
- Exercise 2.48-49
- Exercise 2.50-51
- Exercise 2.53, 2.54, 2.55
- Exercise 2.56, 2.57
- Exercise 2.58