sicp-exercises

This repository is dedicated to solving exercises from the book "Structure and Interpretation of Computer Programs" (SICP) by Harold Abelson and Gerald Jay Sussman with Julie Sussman.

I've also written some blog posts detailing how I solved them.

• 1. Building Abstractions with Procedures
  • 1.1 The Elements of Programming
    • 1.1.6 Conditional Expressions and Predicates
    • 1.1.7 Square Roots by Newton’s Method
  • 1.2 Procedures and the Processes They Generate
    • 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 Testing for Primality
  • 1.3 Formulating Abstractions with Higher-Order Procedures
    • 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
• 2. Building Abstractions with Data
  • 2.1 Introduction to Data Abstraction
    • 2.1.1 Arithmetic Operations for Rational Numbers
    • 2.1.2 Abstraction Barriers
    • 2.1.3 What Is Meant by Data
  • 2.2 Hierarchical Data and the Closure Property
    • 2.2.1 Representing Sequences
    • 2.2.2 Hierarchical Structures
    • 2.2.3 Sequences as Conventional Interfaces
    • 2.2.4 A Picture Language
  • 2.3 Symbolic Data
    • 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.4.1 Representations for Complex Numbers
    • 2.4.2 Tagged data
    • 2.4.2 Data-Directed Programming and Additivity
  • 2.5 Systems with Generic Operations
    • 2.5.1 Generic Arithmetic Operations
    • 2.5.2 Combining Data of Different Types