Exercise Solutions for How to Design Programs

Contents

• Title Page
• Acknowledgements
• I. Processing Simple Forms of Data
  • 1 Students, Teachers, and Computers
  • 2 Numbers, Expressions, Simple Programs
    • 2.1 Numbers and Arithmetic
      • 2.1.1   [problem statement]
      • 2.1.2   [problem statement]
    • 2.2 Variables and Programs
      • 2.2.1   [problem statement]
      • 2.2.2   [problem statement]
      • 2.2.3   [problem statement]
      • 2.2.4   [problem statement]
      • 2.2.5   [problem statement]
    • 2.3 Word Problems
      • 2.3.1   [problem statement]
      • 2.3.2   [problem statement]
      • 2.3.3   [problem statement]
    • 2.4 Errors
      • 2.4.1   [problem statement]
      • 2.4.2   [problem statement]
      • 2.4.3   [problem statement]
      • 2.4.4   [problem statement]
    • 2.5 Designing Programs
  • 3 Programs are Function Plus Variable Definitions
    • 3.1 Composing Functions
      • 3.1.1   [problem statement]
      • 3.1.2   [problem statement]
      • 3.1.3   [problem statement]
      • 3.1.4   [problem statement]
    • 3.2 Variable Definitions
      • 3.2.1   [problem statement]
    • 3.3 Finger Exercises on Composing Functions
      • 3.3.1   [problem statement]
      • 3.3.2   [problem statement]
      • 3.3.3   [problem statement]
      • 3.3.4   [problem statement]
      • 3.3.5   [problem statement]
      • 3.3.6   [problem statement]
  • 4 Conditional Expressions and Functions
    • 4.1 Booleans and Relations
      • 4.1.1   [problem statement]
      • 4.1.2   [problem statement]
    • 4.2 Functions that Test Conditions
      • 4.2.1   [problem statement]
      • 4.2.2   [problem statement]
      • 4.2.3   [problem statement]
      • 4.2.4   [problem statement]
    • 4.3 Conditionals and Conditional Functions
      • 4.3.1   [problem statement]
      • 4.3.2   [problem statement]
      • 4.3.3   [problem statement]
    • 4.4 Designing Conditional Functions
      • 4.4.1   [problem statement]
      • 4.4.2   [problem statement]
      • 4.4.3   [problem statement]
      • 4.4.4   [problem statement]
  • 5 Symbolic Information
    • 5.1 Finger Exercises with Symbols
      • 5.1.1   [problem statement]
      • 5.1.2   [problem statement]
      • 5.1.3   [problem statement]
      • 5.1.4   [problem statement]
      • 5.1.5   [problem statement]
  • 6 Compound Data, Part 1: Structures
    • 6.1 Structures
      • 6.1.1   [problem statement]
    • 6.2 Extended Exercise: Drawing Simple Pictures
      • 6.2.1   [problem statement]
      • 6.2.2   [problem statement]
      • 6.2.3   [problem statement]
      • 6.2.4   [problem statement]
      • 6.2.5   [problem statement]
    • 6.3 Structure Definitions
      • 6.3.1   [problem statement]
      • 6.3.2   [problem statement]
      • 6.3.3   [problem statement]
    • 6.4 Data Definitions
      • 6.4.1   [problem statement]
      • 6.4.2   [problem statement]
      • 6.4.3   [problem statement]
    • 6.5 Designing Functions for Compound Data
      • 6.5.1   [problem statement]
      • 6.5.2   [problem statement]
    • 6.6 Extended Exercise: Moving Circles and Rectangles
      • 6.6.1   [problem statement]
      • 6.6.2   [problem statement]
      • 6.6.3   [problem statement]
      • 6.6.4   [problem statement]
      • 6.6.5   [problem statement]
      • 6.6.6   [problem statement]
      • 6.6.7   [problem statement]
      • 6.6.8   [problem statement]
      • 6.6.9   [problem statement]
      • 6.6.10   [problem statement]
      • 6.6.11   [problem statement]
      • 6.6.12   [problem statement]
    • 6.7 Extended Exercise: Hangman
      • 6.7.1   [problem statement]
      • 6.7.2   [problem statement]
      • 6.7.3   [problem statement]
  • 7 The Varieties of Data
    • 7.1 Mixing and Distinguishing Data
      • 7.1.1   [problem statement]
      • 7.1.2   [problem statement]
      • 7.1.3   [problem statement]
    • 7.2 Designing Functions for Mixed Data
      • 7.2.1   [problem statement]
      • 7.2.2   [problem statement]
    • 7.3 Composing Functions, Revisited
      • 7.3.1   [problem statement]
    • 7.4 Extended Exercise: Moving Shapes
      • 7.4.1   [problem statement]
      • 7.4.2   [problem statement]
      • 7.4.3   [problem statement]
      • 7.4.4   [problem statement]
      • 7.4.5   [problem statement]
      • 7.4.6   [problem statement]
    • 7.5 Input Errors
      • 7.5.1   [problem statement]
      • 7.5.2   [problem statement]
      • 7.5.3   [problem statement]
• Intermezzo 1: Syntax and Semantics
  • 8.2.1   [problem statement]
  • 8.2.2   [problem statement]
  • 8.2.3   [problem statement]
  • 8.2.4   [problem statement]
  • 8.3.1   [problem statement]
  • 8.3.2   [problem statement]
  • 8.6.1   [problem statement]
  • 8.6.2   [problem statement]
  • 8.6.3   [problem statement]
  • 8.7.1   [problem statement]
  • 8.7.2   [problem statement]
  • 8.7.3   [problem statement]
• II. Processing Arbitrarily Large Data
  • 9 Compound Data, Part 2: Lists
    • 9.1 Lists
      • 9.1.1   [problem statement]
      • 9.1.2   [problem statement]
      • 9.1.3   [problem statement]
      • 9.1.4   [problem statement]
    • 9.2 Data Definitions for Lists of Arbitrary Length
      • 9.2.1   [problem statement]
      • 9.2.2   [problem statement]
      • 9.2.3   [problem statement]
    • 9.3 Processing Lists of Arbitrary Length
      • 9.3.1   [problem statement]
      • 9.3.2   [problem statement]
      • 9.3.3   [problem statement]
    • 9.4 Designing Functions for Self-Referential Data Definitions
    • 9.5 More on Processing Simple Lists
      • 9.5.1   [problem statement]
      • 9.5.2   [problem statement]
      • 9.5.3   [problem statement]
      • 9.5.4   [problem statement]
      • 9.5.5   [problem statement]
      • 9.5.6   [problem statement]
      • 9.5.7   [problem statement]
      • 9.5.8   [problem statement]
  • 10 More on Processing Lists
    • 10.1 Functions that Produce Lists
      • 10.1.1   [problem statement]
      • 10.1.2   [problem statement]
      • 10.1.3   [problem statement]
      • 10.1.4   [problem statement]
      • 10.1.5   [problem statement]
      • 10.1.6   [problem statement]
      • 10.1.7   [problem statement]
      • 10.1.8   [problem statement]
      • 10.1.9   [problem statement]
    • 10.2 Lists that Contain Structures
      • 10.2.1   [problem statement]
      • 10.2.2   [problem statement]
      • 10.2.3   [problem statement]
      • 10.2.4   [problem statement]
      • 10.2.5   [problem statement]
      • 10.2.6   [problem statement]
      • 10.2.7   [problem statement]
      • 10.2.8   [problem statement]
      • 10.2.9   [problem statement]
    • 10.3 Extended Exercise: Moving Pictures
      • 10.3.1   [problem statement]
      • 10.3.2   [problem statement]
      • 10.3.3   [problem statement]
      • 10.3.4   [problem statement]
      • 10.3.5   [problem statement]
      • 10.3.6   [problem statement]
  • 11 Natural Numbers
    • 11.1 Defining Natural Numbers
    • 11.2 Processing Natural Numbers of Arbitrary Size
      • 11.2.1   [problem statement]
      • 11.2.2   [problem statement]
      • 11.2.3   [problem statement]
      • 11.2.4   [problem statement]
    • 11.3 Extended Exercise: Creating Lists, Testing Functions
      • 11.3.1   [problem statement]
      • 11.3.2   [problem statement]
      • 11.3.3   [problem statement]
      • 11.3.4   [problem statement]
      • 11.3.5   [problem statement]
    • 11.4 Alternative Data Definitions for Natural Numbers
      • 11.4.1   [problem statement]
      • 11.4.2   [problem statement]
      • 11.4.3   [problem statement]
      • 11.4.4   [problem statement]
      • 11.4.5   [problem statement]
      • 11.4.6   [problem statement]
      • 11.4.7   [problem statement]
    • 11.5 More on the Nature of Natural Numbers
      • 11.5.1   [problem statement]
      • 11.5.2   [problem statement]
      • 11.5.3   [problem statement]
      • 11.5.4   [problem statement]
  • 12 Composing Functions, Revisited Again
    • 12.1 Designing Complex Programs
    • 12.2 Recursive Auxiliary Functions
      • 12.2.1   [problem statement]
      • 12.2.2   [problem statement]
    • 12.3 Generalizing Problems, Generalizing Functions
      • 12.3.1   [problem statement]
      • 12.3.2   [problem statement]
    • 12.4 Extended Exercise: Rearranging Words
      • 12.4.1   [problem statement]
      • 12.4.2   [problem statement]
• Intermezzo 2: List Abbreviations
  • 13.0.3   [problem statement]
  • 13.0.4   [problem statement]
  • 13.0.5   [problem statement]
  • 13.0.6   [problem statement]
  • 13.0.7   [problem statement]
  • 13.0.8   [problem statement]
• III. More on Processing Arbitrarily Large Data
  • 14 More Self-referential Data Definitions
    • 14.1 Structures in Structures
      • 14.1.1   [problem statement]
      • 14.1.2   [problem statement]
      • 14.1.3   [problem statement]
      • 14.1.4   [problem statement]
      • 14.1.5   [problem statement]
      • 14.1.6   [problem statement]
    • 14.2 Extended Exercise: Binary Search Trees
      • 14.2.1   [problem statement]
      • 14.2.2   [problem statement]
      • 14.2.3   [problem statement]
      • 14.2.4   [problem statement]
      • 14.2.5   [problem statement]
      • 14.2.6   [problem statement]
    • 14.3 Lists in Lists
      • 14.3.1   [problem statement]
      • 14.3.2   [problem statement]
      • 14.3.3   [problem statement]
      • 14.3.4   [problem statement]
    • 14.4 Extended Exercise: Evaluating Scheme
      • 14.4.1   [problem statement]
      • 14.4.2   [problem statement]
      • 14.4.3   [problem statement]
      • 14.4.4   [problem statement]
  • 15 Mutually Referential Data Definitions
    • 15.1 Lists of Structures, Lists in Structures
      • 15.1.1   [problem statement]
      • 15.1.2   [problem statement]
      • 15.1.3   [problem statement]
      • 15.1.4   [problem statement]
    • 15.2 Designing Functions for Mutually Referential Definitions
    • 15.3 Extended Exercise: More on Web Pages
      • 15.3.1   [problem statement]
      • 15.3.2   [problem statement]
      • 15.3.3   [problem statement]
      • 15.3.4   [problem statement]
  • 16 Development through Iterative Refinement
    • 16.1 Data Analysis
      • 16.1.1   [problem statement]
    • 16.2 Defining Data Classes and Refining Them
      • 16.2.1   [problem statement]
      • 16.2.2   [problem statement]
      • 16.2.3   [problem statement]
      • 16.2.4   [problem statement]
      • 16.2.5   [problem statement]
    • 16.3 Refining Functions and Programs
      • 16.3.1   [problem statement]
      • 16.3.2   [problem statement]
      • 16.3.3   [problem statement]
      • 16.3.4   [problem statement]
  • 17 Processing Two Complex Pieces of Data
    • 17.1 Processing Two Lists Simultaneously: Case 1
      • 17.1.1   [problem statement]
      • 17.1.2   [problem statement]
    • 17.2 Processing Two Lists Simultaneously: Case 2
      • 17.2.1   [problem statement]
      • 17.2.2   [problem statement]
    • 17.3 Processing Two Lists Simultaneously: Case 3
      • 17.3.1   [problem statement]
    • 17.4 Function Simplification
      • 17.4.1   [problem statement]
      • 17.4.2   [problem statement]
    • 17.5 Designing Functions that Consume Two Complex Inputs
    • 17.6 Exercises on Processing Two Complex Inputs
      • 17.6.1   [problem statement]
      • 17.6.2   [problem statement]
      • 17.6.3   [problem statement]
      • 17.6.4   [problem statement]
      • 17.6.5   [problem statement]
      • 17.6.6   [problem statement]
    • 17.7 Extended Exercise: Evaluating Scheme, Part 2
      • 17.7.1   [problem statement]
      • 17.7.2   [problem statement]
      • 17.7.3   [problem statement]
      • 17.7.4   [problem statement]
    • 17.8 Equality and Testing
      • 17.8.1   [problem statement]
      • 17.8.2   [problem statement]
      • 17.8.3   [problem statement]
      • 17.8.4   [problem statement]
      • 17.8.5   [problem statement]
      • 17.8.6   [problem statement]
      • 17.8.7   [problem statement]
      • 17.8.8   [problem statement]
      • 17.8.9   [problem statement]
      • 17.8.10   [problem statement]
      • 17.8.11   [problem statement]
      • 17.8.12   [problem statement]
• Intermezzo 3: Local Definitions and Lexical Scope
  • 18.1.1   [problem statement]
  • 18.1.2   [problem statement]
  • 18.1.3   [problem statement]
  • 18.1.4   [problem statement]
  • 18.1.5   [problem statement]
  • 18.1.6   [problem statement]
  • 18.1.7   [problem statement]
  • 18.1.8   [problem statement]
  • 18.1.9   [problem statement]
  • 18.1.10   [problem statement]
  • 18.1.11   [problem statement]
  • 18.1.12   [problem statement]
  • 18.1.13   [problem statement]
  • 18.1.14   [problem statement]
  • 18.1.15   [problem statement]
  • 18.2.1   [problem statement]
  • 18.2.2   [problem statement]
  • 18.2.3   [problem statement]
• IV. Abstracting Designs
  • 19 Similarities in Definitions
    • 19.1 Similarities in Functions
      • 19.1.1   [problem statement]
      • 19.1.2   [problem statement]
      • 19.1.3   [problem statement]
      • 19.1.4   [problem statement]
      • 19.1.5   [problem statement]
      • 19.1.6   [problem statement]
    • 19.2 Similarities in Data Definitions
      • 19.2.1   [problem statement]
      • 19.2.2   [problem statement]
      • 19.2.3   [problem statement]
      • 19.2.4   [problem statement]
  • 20 Functions are Values
    • 20.1 Syntax and Semantics
      • 20.1.1   [problem statement]
      • 20.1.2   [problem statement]
      • 20.1.3   [problem statement]
    • 20.2 Contracts for Abstract and Polymorphic Functions
      • 20.2.1   [problem statement]
      • 20.2.2   [problem statement]
      • 20.2.3   [problem statement]
      • 20.2.4   [problem statement]
  • 21 Designing Abstractions from Examples
    • 21.1 Abstracting from Examples
      • 21.1.1   [problem statement]
      • 21.1.2   [problem statement]
      • 21.1.3   [problem statement]
    • 21.2 Finger Exercises with Abstract List Functions
      • 21.2.1   [problem statement]
      • 21.2.2   [problem statement]
      • 21.2.3   [problem statement]
    • 21.3 Abstraction and a Single Point of Control
    • 21.4 Extended Exercise: Moving Pictures, Again
      • 21.4.1   [problem statement]
      • 21.4.2   [problem statement]
      • 21.4.3   [problem statement]
      • 21.4.4   [problem statement]
      • 21.4.5   [problem statement]
    • 21.5 Note: Designing Abstractions from Templates
  • 22 Designing Abstractions with First-Class Functions
    • 22.1 Functions that Produce Functions
    • 22.2 Designing Abstractions with Functions-as-Values
      • 22.2.1   [problem statement]
      • 22.2.2   [problem statement]
      • 22.2.3   [problem statement]
    • 22.3 A First Look at Graphical User Interfaces
      • 22.3.1   [problem statement]
      • 22.3.2   [problem statement]
      • 22.3.3   [problem statement]
  • 23 Mathematical Examples
    • 23.1 Sequences and Series
      • 23.1.1   [problem statement]
    • 23.2 Arithmetic Sequences and Series
      • 23.2.1   [problem statement]
      • 23.2.2   [problem statement]
      • 23.2.3   [problem statement]
      • 23.2.4   [problem statement]
      • 23.2.5   [problem statement]
    • 23.3 Geometric Sequences and Series
      • 23.3.1   [problem statement]
      • 23.3.2   [problem statement]
      • 23.3.3   [problem statement]
      • 23.3.4   [problem statement]
      • 23.3.5   [problem statement]
      • 23.3.6   [problem statement]
      • 23.3.7   [problem statement]
      • 23.3.8   [problem statement]
      • 23.3.9   [problem statement]
    • 23.4 The Area Under a Function
      • 23.4.1   [problem statement]
      • 23.4.2   [problem statement]
    • 23.5 The Slope of a Function
      • 23.5.1   [problem statement]
      • 23.5.2   [problem statement]
      • 23.5.3   [problem statement]
      • 23.5.4   [problem statement]
      • 23.5.5   [problem statement]
      • 23.5.6   [problem statement]
• Intermezzo 4: Defining Functions on the Fly
  • 24.0.7   [problem statement]
  • 24.0.8   [problem statement]
  • 24.0.9   [problem statement]
• V. Generative Recursion
  • 25 A New Form of Recursion
    • 25.1 Modeling a Ball on a Table
      • 25.1.1   [problem statement]
      • 25.1.2   [problem statement]
    • 25.2 Sorting Quickly
      • 25.2.1   [problem statement]
      • 25.2.2   [problem statement]
      • 25.2.3   [problem statement]
      • 25.2.4   [problem statement]
      • 25.2.5   [problem statement]
      • 25.2.6   [problem statement]
  • 26 Designing Algorithms
    • 26.0
      • 26.0.7   [problem statement]
      • 26.0.8   [problem statement]
    • 26.1 Termination
      • 26.1.1   [problem statement]
      • 26.1.2   [problem statement]
    • 26.2 Structural versus Generative Recursion
      • 26.2.1   [problem statement]
    • 26.3 Making Choices
      • 26.3.1   [problem statement]
      • 26.3.2   [problem statement]
      • 26.3.3   [problem statement]
      • 26.3.4   [problem statement]
      • 26.3.5   [problem statement]
      • 26.3.6   [problem statement]
  • 27 Variations on a Theme
    • 27.1 Fractals
      • 27.1.1   [problem statement]
      • 27.1.2   [problem statement]
      • 27.1.3   [problem statement]
      • 27.1.4   [problem statement]
      • 27.1.5   [problem statement]
    • 27.2 From Files to Lines, from Lists to Lists of Lists
      • 27.2.1   [problem statement]
      • 27.2.2   [problem statement]
      • 27.2.3   [problem statement]
      • 27.2.4   [problem statement]
    • 27.3 Binary Search
      • 27.3.1   [problem statement]
      • 27.3.2   [problem statement]
      • 27.3.3   [problem statement]
      • 27.3.4   [problem statement]
      • 27.3.5   [problem statement]
      • 27.3.6   [problem statement]
    • 27.4 Newton's Method
      • 27.4.1   [problem statement]
    • 27.5 Extended Exercise: Gaussian Elimination
      • 27.5.1   [problem statement]
      • 27.5.2   [problem statement]
      • 27.5.3   [problem statement]
      • 27.5.4   [problem statement]
      • 27.5.5   [problem statement]
      • 27.5.6   [problem statement]
      • 27.5.7   [problem statement]
  • 28 Algorithms that Backtrack
    • 28.1 Traversing Graphs
      • 28.1.1   [problem statement]
      • 28.1.2   [problem statement]
      • 28.1.3   [problem statement]
      • 28.1.4   [problem statement]
      • 28.1.5   [problem statement]
      • 28.1.6   [problem statement]
    • 28.2 Extended Exercise: Checking (on) Queens
      • 28.2.1   [problem statement]
      • 28.2.2   [problem statement]
      • 28.2.3   [problem statement]
      • 28.2.4   [problem statement]
• Intermezzo 5: The Cost of Computing and Vectors
  • 29.1.1   [problem statement]
  • 29.1.2   [problem statement]
  • 29.2.1   [problem statement]
  • 29.2.2   [problem statement]
  • 29.2.3   [problem statement]
  • 29.3.1   [problem statement]
  • 29.3.2   [problem statement]
  • 29.3.3   [problem statement]
  • 29.3.4   [problem statement]
  • 29.3.5   [problem statement]
  • 29.3.6   [problem statement]
  • 29.3.7   [problem statement]
  • 29.3.8   [problem statement]
  • 29.3.9   [problem statement]
  • 29.3.10   [problem statement]
  • 29.3.11   [problem statement]
  • 29.3.12   [problem statement]
  • 29.3.13   [problem statement]
  • 29.3.14   [problem statement]
  • 29.3.15   [problem statement]
• VI. Accumulating Knowledge
  • 30 The Loss of Knowledge
    • 30.1 A Problem with Structural Processing
      • 30.1.1   [problem statement]
      • 30.1.2   [problem statement]
    • 30.2 A Problem with Generative Recursion
      • 30.2.1   [problem statement]
      • 30.2.2   [problem statement]
      • 30.2.3   [problem statement]
      • 30.2.4   [problem statement]
  • 31 Designing Accumulator-Style Functions
    • 31.1 Recognizing the Need for an Accumulator
    • 31.2 Accumulator-Style Functions
    • 31.3 Transforming Functions into Accumulator-Style
      • 31.3.1   [problem statement]
      • 31.3.2   [problem statement]
      • 31.3.3   [problem statement]
      • 31.3.4   [problem statement]
      • 31.3.5   [problem statement]
      • 31.3.6   [problem statement]
      • 31.3.7   [problem statement]
      • 31.3.8   [problem statement]
  • 32 More Uses of Accumulation
    • 32.1 Extended Exercise: Accumulators on Trees
      • 32.1.1   [problem statement]
      • 32.1.2   [problem statement]
      • 32.1.3   [problem statement]
    • 32.2 Extended Exercise: Missionaries and Cannibals
      • 32.2.1   [problem statement]
      • 32.2.2   [problem statement]
      • 32.2.3   [problem statement]
      • 32.2.4   [problem statement]
      • 32.2.5   [problem statement]
      • 32.2.6   [problem statement]
      • 32.2.7   [problem statement]
      • 32.2.8   [problem statement]
    • 32.3 Extended Exercise: Board Solitaire
      • 32.3.1   [problem statement]
      • 32.3.2   [problem statement]
      • 32.3.3   [problem statement]
• Intermezzo 6: The Nature of Inexact Numbers
  • 33.1.1   [problem statement]
  • 33.1.2   [problem statement]
  • 33.1.3   [problem statement]
  • 33.2.1   [problem statement]
  • 33.3.1   [problem statement]
  • 33.4.1   [problem statement]
  • 33.4.2   [problem statement]
  • 33.4.3   [problem statement]
• VII. Changing the State of Variables
  • 34 Memory for Functions
  • 35 Assignment to Variables
    • 35.1 Simple Assignments at Work
      • 35.1.1   [problem statement]
      • 35.1.2   [problem statement]
    • 35.2 Sequencing Expression Evaluations
      • 35.2.1   [problem statement]
      • 35.2.2   [problem statement]
      • 35.2.3   [problem statement]
    • 35.3 Assignments and Functions
      • 35.3.1   [problem statement]
      • 35.3.2   [problem statement]
      • 35.3.3   [problem statement]
      • 35.3.4   [problem statement]
    • 35.4 A First Useful Example
      • 35.4.1   [problem statement]
      • 35.4.2   [problem statement]
  • 36 Designing Functions with Memory
    • 36.1 The Need for Memory
    • 36.2 Memory and State Variables
    • 36.3 Functions that Initialize Memory
    • 36.4 Functions that Change Memory
      • 36.4.1   [problem statement]
      • 36.4.2   [problem statement]
  • 37 Examples of Memory Usage
    • 37.1 Initializing State
      • 37.1.1   [problem statement]
      • 37.1.2   [problem statement]
      • 37.1.3   [problem statement]
      • 37.1.4   [problem statement]
      • 37.1.5   [problem statement]
    • 37.2 State Changes from User Interactions
      • 37.2.1   [problem statement]
      • 37.2.2   [problem statement]
      • 37.2.3   [problem statement]
      • 37.2.4   [problem statement]
      • 37.2.5   [problem statement]
      • 37.2.6   [problem statement]
      • 37.2.7   [problem statement]
    • 37.3 State Changes from Recursion
      • 37.3.1   [problem statement]
      • 37.3.2   [problem statement]
      • 37.3.3   [problem statement]
      • 37.3.4   [problem statement]
      • 37.3.5   [problem statement]
      • 37.3.6   [problem statement]
    • 37.4 Finger Exercises on State Changes
      • 37.4.1   [problem statement]
      • 37.4.2   [problem statement]
      • 37.4.3   [problem statement]
      • 37.4.4   [problem statement]
      • 37.4.5   [problem statement]
    • 37.5 Extended Exercise: Exploring Places
      • 37.5.1   [problem statement]
      • 37.5.2   [problem statement]
      • 37.5.3   [problem statement]
• Intermezzo 7: The Final Syntax and Semantics
  • 38.2.1   [problem statement]
  • 38.3.1   [problem statement]
  • 38.3.2   [problem statement]
  • 38.3.3   [problem statement]
  • 38.3.4   [problem statement]
• VIII. Changing Compound Values
  • 39 Encapsulation
    • 39.1 Abstracting with State Variables
      • 39.1.1   [problem statement]
      • 39.1.2   [problem statement]
      • 39.1.3   [problem statement]
      • 39.1.4   [problem statement]
      • 39.1.5   [problem statement]
      • 39.1.6   [problem statement]
      • 39.1.7   [problem statement]
      • 39.1.8   [problem statement]
    • 39.2 Practice with Encapsulation
      • 39.2.1   [problem statement]
      • 39.2.2   [problem statement]
      • 39.2.3   [problem statement]
      • 39.2.4   [problem statement]
      • 39.2.5   [problem statement]
  • 40 Mutable Structures
    • 40.1 Structures from Functions
      • 40.1.1   [problem statement]
      • 40.1.2   [problem statement]
      • 40.1.3   [problem statement]
    • 40.2 Mutable Functional Structures
      • 40.2.1   [problem statement]
      • 40.2.2   [problem statement]
    • 40.3 Mutable Structures
      • 40.3.1   [problem statement]
      • 40.3.2   [problem statement]
      • 40.3.3   [problem statement]
      • 40.3.4   [problem statement]
      • 40.3.5   [problem statement]
    • 40.4 Mutable Vectors
      • 40.4.1   [problem statement]
      • 40.4.2   [problem statement]
      • 40.4.3   [problem statement]
      • 40.4.4   [problem statement]
    • 40.5 Changing Variables, Changing Structures
  • 41 Designing Functions that Change Structures
    • 41.1 Why Mutate Structures
    • 41.2 Structural Design Recipes and Mutation, Part 1
      • 41.2.1   [problem statement]
      • 41.2.2   [problem statement]
      • 41.2.3   [problem statement]
      • 41.2.4   [problem statement]
      • 41.2.5   [problem statement]
      • 41.2.6   [problem statement]
      • 41.2.7   [problem statement]
      • 41.2.8   [problem statement]
      • 41.2.9   [problem statement]
      • 41.2.10   [problem statement]
      • 41.2.11   [problem statement]
      • 41.2.12   [problem statement]
      • 41.2.13   [problem statement]
      • 41.2.14   [problem statement]
      • 41.2.15   [problem statement]
      • 41.2.16   [problem statement]
      • 41.2.17   [problem statement]
      • 41.2.18   [problem statement]
      • 41.2.19   [problem statement]
      • 41.2.20   [problem statement]
      • 41.2.21   [problem statement]
    • 41.3 Structural Design Recipes and Mutation, Part 2
      • 41.3.1   [problem statement]
      • 41.3.2   [problem statement]
      • 41.3.3   [problem statement]
      • 41.3.4   [problem statement]
      • 41.3.5   [problem statement]
      • 41.3.6   [problem statement]
      • 41.3.7   [problem statement]
      • 41.3.8   [problem statement]
    • 41.4 Extended Exercise: Moving Pictures, a Last Time
      • 41.4.1   [problem statement]
      • 41.4.2   [problem statement]
      • 41.4.3   [problem statement]
  • 42 Equality
    • 42.1 Extensional Equality
      • 42.1.1   [problem statement]
      • 42.1.2   [problem statement]
    • 42.2 Intensional Equality
      • 42.2.1   [problem statement]
      • 42.2.2   [problem statement]
      • 42.2.3   [problem statement]
  • 43 Changing Structures, Vectors, and Objects
    • 43.1 More Practice with Vectors
      • 43.1.1   [problem statement]
      • 43.1.2   [problem statement]
      • 43.1.3   [problem statement]
      • 43.1.4   [problem statement]
      • 43.1.5   [problem statement]
      • 43.1.6   [problem statement]
      • 43.1.7   [problem statement]
    • 43.2 Collections of Structures with Cycles
      • 43.2.1   [problem statement]
      • 43.2.2   [problem statement]
      • 43.2.3   [problem statement]
      • 43.2.4   [problem statement]
      • 43.2.5   [problem statement]
      • 43.2.6   [problem statement]
      • 43.2.7   [problem statement]
      • 43.2.8   [problem statement]
      • 43.2.9   [problem statement]
      • 43.2.10   [problem statement]
    • 43.3 Backtracking with State
      • 43.3.1   [problem statement]
      • 43.3.2   [problem statement]
      • 43.3.3   [problem statement]
      • 43.3.4   [problem statement]
      • 43.3.5   [problem statement]
      • 43.3.6   [problem statement]
      • 43.3.7   [problem statement]
      • 43.3.8   [problem statement]
• Epilogue
• Index