{"id":15487055,"url":"https://github.com/theodesp/sicp-workbook","last_synced_at":"2026-01-20T01:22:57.500Z","repository":{"id":97066606,"uuid":"86388091","full_name":"theodesp/SICP-workbook","owner":"theodesp","description":"This is my workbook and exercise solutions for the legendary SICP Book","archived":false,"fork":false,"pushed_at":"2019-05-23T19:46:32.000Z","size":126,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-12T09:39:19.765Z","etag":null,"topics":["functional-programming","lisp","programming","scheme","sicp-book"],"latest_commit_sha":null,"homepage":null,"language":"Racket","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/theodesp.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-03-27T21:59:38.000Z","updated_at":"2019-05-23T19:46:34.000Z","dependencies_parsed_at":"2023-04-25T02:35:26.403Z","dependency_job_id":null,"html_url":"https://github.com/theodesp/SICP-workbook","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theodesp%2FSICP-workbook","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theodesp%2FSICP-workbook/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theodesp%2FSICP-workbook/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theodesp%2FSICP-workbook/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/theodesp","download_url":"https://codeload.github.com/theodesp/SICP-workbook/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247429798,"owners_count":20937738,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["functional-programming","lisp","programming","scheme","sicp-book"],"created_at":"2024-10-02T06:21:01.292Z","updated_at":"2026-01-20T01:22:57.452Z","avatar_url":"https://github.com/theodesp.png","language":"Racket","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Structure and Interpretation of Computer Programs workbook\n\nThis is my workbook and exercise solutions for the legendary [SICP Book](http://sarabander.github.io/sicp/html/.) using the DrRacket Scheme interpeter\n\nAll the workbooks are divided by chapters one on each folder.\n\n### Chapters Completed\n\n- [x] **Chapter 1**: Building Abstractions with Procedures\n    - [x] : Exercise 1.1 Simple expressions\n    - [x] : Exercise 1.2 Complex expression\n    - [x] : Exercise 1.3 Sum of Squares\n    - [x] : Exercise 1.4 Evaluate behavior\n    - [x] : Exercise 1.5 Order of evaluation\n    - [x] : Exercise 1.6 If predicate\n    - [x] : Exercise 1.7 Good enough aproximation\n    - [x] : Exercise 1.8 Newtons Method Sqrt\n    - [x] : Exercise 1.9 Evaluate Substitution model\n    - [x] : Exercise 1.10 Ackermann’s function\n    - [x] : Exercise 1.11 Compute function using iteration\n    - [x] : Exercise 1.12 Pascals Triangle\n    - [x] : Exercise 1.13 Prove Fibonacci closest integer\n    - [x] : Exercise 1.14 Draw illustrative process\n    - [x] : Exercise 1.15 Find order of growth\n    - [x] : Exercise 1.16 Fast iterative exponental calc\n    - [x] : Exercise 1.17 Faster exponental calc\n    - [x] : Exercise 1.18 Doubling of integers\n    - [x] : Exercise 1.19 Faster Fibonacci\n    - [x] : Exercise 1.20 Count GCD operations\n    - [x] : Exercise 1.21 Find smallest divisor\n    - [x] : Exercise 1.22 Time functions\n    - [x] : Exercise 1.23 Time functions\n    - [x] : Exercise 1.24 Time functions\n    - [x] : Exercise 1.25 Order of growth changed\n    - [x] : Exercise 1.26 Order of growth changed\n    - [x] : Exercise 1.27 Prove Carmichael exist\n    - [x] : Exercise 1.28 Miller-Rabin test\n    - [x] : Exercise 1.29 Simpson’s Rule\n    - [x] : Exercise 1.30 Find approximations to π\n    - [x] : Exercise 1.31 Find approximations to π\n    - [x] : Exercise 1.32 Construct accumulate function\n    - [x] : Exercise 1.33 Construct filtered-accumulate function\n    - [x] : Exercise 1.34 Evaluate recursive expression\n    - [x] : Exercise 1.35 Show golden ratios fixed point\n    - [x] : Exercise 1.36 Calculate fixed point of expression\n    - [x] : Exercise 1.37 Infinite continued fraction\n    - [x] : Exercise 1.38 Eulers approximation of e\n    - [x] : Exercise 1.39 Lamberts approximation of tangent\n    - [x] : Exercise 1.40 Newton's method using cubic func\n    - [x] : Exercise 1.41 Double Double func\n    - [x] : Exercise 1.42 Compose Func\n    - [x] : Exercise 1.43 Repeated Func\n    - [x] : Exercise 1.46 Iterative improvement Func\n    \n- [ ] **Chapter 2**: Building Abstractions with Data\n    - [x] : Exercise 2.1 Better version of make-rat\n    - [x] : Exercise 2.2 Provide make-segment \n    - [x] : Exercise 2.4 Cdr alternative\n    - [x] : Exercise 2.5 Cons/Car/Cdr with exp numbers\n    - [x] : Exercise 2.6 Church Numbers\n    - [x] : Exercise 2.7 Interval Selectors\n    - [x] : Exercise 2.8 Sub-interval\n    - [x] : Exercise 2.9 Width\n    - [x] : Exercise 2.10 Safe div-interval\n    - [x] : Exercise 2.11 Mul interval fast\n    - [x] : Exercise 2.12 Percent\n    - [x] : Exercise 2.14 Invalid computations\n\t- [x] : Exercise 2.17 Last pair\n\t- [x] : Exercise 2.18 List reverse\n    - [x] : Exercise 2.19 Locale Coins\n    - [x] : Exercise 2.20 Same Parity\n\t- [x] : Exercise 2.21 Square-list\n\t- [x] : Exercise 2.22 Square-list issue\n\t- [x] : Exercise 2.23 for-each\n\t- [x] : Exercise 2.24 List tree evaluation\n\t- [x] : Exercise 2.25 Car/cdrs\n\t- [x] : Exercise 2.26 Evaluate list/append/cons\n\t- [x] : Exercise 2.28 deep-reverse\n\t- [x] : Exercise 2.29 total-weight of mobile tree\n\t- [x] : Exercise 2.30 square-map\n\t- [x] : Exercise 2.31 tree-map\n\t- [x] : Exercise 2.32 subsets\n\t- [x] : Exercise 2.33 map, length, append\n\t- [x] : Exercise 2.34 Horner\n\t- [x] : Exercise 2.35 count-leaves2\n\t- [x] : Exercise 2.36 Acuumulate-n\n\t- [x] : Exercise 2.37 Matrix ops\n\t- [x] : Exercise 2.38 Fold-left\n\t- [x] : Exercise 2.39 2 way reverse\n\t- [x] : Exercise 2.40 Unique pairs\n\t- [x] : Exercise 2.41 sum-triplets\n\t- [x] : Exercise 2.42 queens\n\t- [x] : Exercise 2.53 evaluating expressions\n\t- [x] : Exercise 2.54 Equal?\n\t- [x] : Exercise 2.55 quote\n\t- [x] : Exercise 2.56 Differential exponentiation \n\t- [x] : Exercise 2.58 Infix differential ops\n\t- [x] : Exercise 2.59 Union Set\n\t- [x] : Exercise 2.60 With duplicates Set\n\t- [x] : Exercise 2.61 Adjoin Ordered Set\n\t- [x] : Exercise 2.62 Union Ordered Set\n\t- [x] : Exercise 2.63 tree-\u003elist\n\t- [x] : Exercise 2.64 list-\u003etree\n\t- [x] : Exercise 2.65 lookup in tree\n\t- [x] : Exercise 2.67 Decode sample\n\t- [x] : Exercise 2.68 Encode-symbol huffman\n\t- [x] : Exercise 2.69 Merge leaf pairs\n\t- [x] : Exercise 2.70 Encoding examples\n\t- [x] : Exercise 2.71 Huffman tree\n\t- [x] : Exercise 2.72 Huffman complexity\n\t- [x] : Exercise 2.75 Make from Mag Ang\n\t- [x] : Exercise 2.76 Find Appopriate ways to add new types\n\t- [x] : Exercise 2.77 Trace magnitude\n\t- [x] : Exercise 2.78 Do not tag buildin numbers\n\t- [x] : Exercise 2.79 Add equ?\n\t- [x] : Exercise 2.80 Add =zero?\n    \n- [ ] **Chapter 3**: Modularity, Objects, and State\n- [ ] **Chapter 4**: Metalinguistic Abstraction\n- [ ] **Chapter 5**: Computing with Register Machines\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheodesp%2Fsicp-workbook","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftheodesp%2Fsicp-workbook","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheodesp%2Fsicp-workbook/lists"}