Skip to content
/ sicp-exercises-and-examples Public

Exercises and examples from Structure and Interpretation of Computer Programs (2nd edition) book by Sussman & Abelson

mitpress.mit.edu/sicp/
9 stars 4 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

caisah/sicp-exercises-and-examples

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

29 Commits
1.1.2-naming_the_environment
1.1.2-naming_the_environment
 
 
1.1.4-compound_procedures
1.1.4-compound_procedures
 
 
1.1.6-conditional_expression_and_predicates
1.1.6-conditional_expression_and_predicates
 
 
1.1.7-example_square_roots_by_newtons_method
1.1.7-example_square_roots_by_newtons_method
 
 
1.1.8-procedures_as_black_box_abstractions
1.1.8-procedures_as_black_box_abstractions
 
 
1.2.1-linear_recursion_and_iteration
1.2.1-linear_recursion_and_iteration
 
 
1.2.2-tree_recursion
1.2.2-tree_recursion
 
 
1.2.4-exponentiation
1.2.4-exponentiation
 
 
1.2.5-greatest_common_divisors
1.2.5-greatest_common_divisors
 
 
1.2.6-testing_for_primality
1.2.6-testing_for_primality
 
 
1.3.1-procedures_as_arguments
1.3.1-procedures_as_arguments
 
 
1.3.2-constructing_procedures_using_lambda
1.3.2-constructing_procedures_using_lambda
 
 
1.3.3-procedures_as_general_methods
1.3.3-procedures_as_general_methods
 
 
1.3.4-procedures_as_returned_values
1.3.4-procedures_as_returned_values
 
 
2.1.1-example_arithmetic_operations_for_rational_numbers
2.1.1-example_arithmetic_operations_for_rational_numbers
 
 
2.1.2-abstraction_barriers
2.1.2-abstraction_barriers
 
 
2.1.3-what_is_meant_by_data
2.1.3-what_is_meant_by_data
 
 
2.1.4-extended_exercise_interval_arithmetic
2.1.4-extended_exercise_interval_arithmetic
 
 
2.2.1-representing_sequences
2.2.1-representing_sequences
 
 
2.2.2-heirarchical_structures
2.2.2-heirarchical_structures
 
 
2.2.3-sequences_as_conventional_interfaces
2.2.3-sequences_as_conventional_interfaces
 
 
2.3.1-quotation
2.3.1-quotation
 
 
2.3.2-symbolic_differentiation
2.3.2-symbolic_differentiation
 
 
2.3.3-representing_sets
2.3.3-representing_sets
 
 
2.3.4-huffman_encoding_trees
2.3.4-huffman_encoding_trees
 
 
2.4.1-representations_for_complex_numbers
2.4.1-representations_for_complex_numbers
 
 
2.4.2-tagged_data
2.4.2-tagged_data
 
 
2.4.3-data_directed_programming_and_additivity
2.4.3-data_directed_programming_and_additivity
 
 
2.5.1-generic_arithmetic_operations
2.5.1-generic_arithmetic_operations
 
 
2.5.2-combining_data_of_different_types
2.5.2-combining_data_of_different_types
 
 
2.5.3-example_symbolic_algebra
2.5.3-example_symbolic_algebra
 
 
3.1.1-local_state_variables
3.1.1-local_state_variables
 
 
3.1.2-benefits_fo_introducing_assignment
3.1.2-benefits_fo_introducing_assignment
 
 
3.1.3-the_cost_of_introducing_assignment
3.1.3-the_cost_of_introducing_assignment
 
 
3.2.2-applying_simple_procedures
3.2.2-applying_simple_procedures
 
 
3.2.3-frames_as_the_repository_of_local_state
3.2.3-frames_as_the_repository_of_local_state
 
 
3.2.4-internal_definitions
3.2.4-internal_definitions
 
 
3.3.1-mutable_list_structure
3.3.1-mutable_list_structure
 
 
3.3.2-representing_queues
3.3.2-representing_queues
 
 
3.3.3-representing_tables
3.3.3-representing_tables
 
 
3.3.4-a_simulator_for_digital_circuits
3.3.4-a_simulator_for_digital_circuits
 
 
3.3.5-propagation_of_constraints
3.3.5-propagation_of_constraints
 
 
3.4.2-mechanisms_for_controlling_concurrency
3.4.2-mechanisms_for_controlling_concurrency
 
 
3.5.1-streams_are_delayed_lists
3.5.1-streams_are_delayed_lists
 
 
3.5.2-infinite-streams
3.5.2-infinite-streams
 
 
3.5.3-exploiting_the_stream_paradigm
3.5.3-exploiting_the_stream_paradigm
 
 
3.5.5-modularity_of_functional_programs_and_modularity_of_objects
3.5.5-modularity_of_functional_programs_and_modularity_of_objects
 
 
4.1.1-the_core_of_the_evaluator
4.1.1-the_core_of_the_evaluator
 
 
.gitignore
.gitignore
 
 
README.md
README.md
 
 

Repository files navigation

SICP - Exercises & Examples

My takes on the infamous Structure and Interpretation of Computer Programs (2nd edition) book by Sussman&Abelson.

It contains code for both the examples and the exercises.

I used the MIT-Scheme interpreter for checking.

Some solutions for the exercises are inspired or copied from the Scheme community.

Some of the answers for particular exercises are missing (the ones I found no fun in doing it or I considered not being very practical).

About

Exercises and examples from Structure and Interpretation of Computer Programs (2nd edition) book by Sussman & Abelson

mitpress.mit.edu/sicp/

Resources

Readme
Activity

Stars

9 stars

Watchers

3 watching

Forks

4 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages