sicp Questions
2
Solved
in SICP Section 1.2.1 The author giving such a code example below to show how to using iterative process to solve the factorial problem:
(define (factorial n)
(fact-iter 1 1 n))
(define (fact-ite...
4
Solved
I have read chapter 4 of SICP, and just found that the first section lists the most important functions for implementing a evaluator, eval and apply, I understand that eval is very important, but w...
7
Solved
I'm just beginning to work through SICP (on my own; this isn't for a class), and I've been struggling with Exercise 1.6 for a couple of days and I just can't seem to figure it out. This is the one ...
Diastasis asked 23/7, 2009 at 11:53
5
Solved
According to SICP section 1.2.6, exercise 1.22:
Most Lisp implementations include a primitive called runtime that returns an integer that specifies the amount of time the system has been running...
5
In the classic text by Abelson/Sussman, Structure and Interpretation of Computer Programs, in Section 1.2.2 on tree recursion and the Fibonacci sequence, they show this image:
The tree-recursive p...
5
Solved
I am going through SICP as a self-study and am on the picture language section in Chapter 2. I have been using DrRacket for the earlier exercises, but I get compilation errors when trying to do an ...
2
Solved
This isn't a homework question, I'm just left unsatisfied with my understanding of interval arithmetic and the implications of exercise 2.16.
The interval arithmetic defined by section 2.14 does n...
6
Solved
Exercise 1.11:
A function f is defined by the rule that f(n) = n if n < 3 and f(n) = f(n - 1) + 2f(n - 2) + 3f(n - 3) if n > 3. Write a procedure that computes f by means of a recursive proc...
3
Solved
As far as I know, eager evaluation/applicative order evaluates all arguments to a function before applying it, on the other hand, lazy evaluation/normal order evaluates the arguments only when need...
Girardi asked 8/1, 2011 at 15:22
7
I'm reading the book Structure and Interpretation
of Computer Programs, and I'd like to code a scheme interpreter gradually.
Do you knows the implementation of the scheme most easy to read (and s...
Siclari asked 23/9, 2011 at 8:49
1
SICP Exercise 3.57: How many additions are performed when we compute the nth Fibonacci number using the definition of fibs based on the add-streams procedure? Show that the number of additions wou...
Embitter asked 23/9, 2019 at 17:55
2
Solved
I'm reading the "Structure and interpretation of computer programs" 2nd edition in the exercise 1.5, I found a combination that I didn't understand what it does exactly (define (p) (p)).
When I ca...
12
Solved
SICP - "Structure and Interpretation of Computer Programs"
Explanation for the same would be nice
Can some one explain about Metalinguistic Abstraction
Trish asked 10/12, 2008 at 8:21
2
Solved
I'm basically stuck at excercise 3.56 in SICP. The problem goes like this:
Exercise 3.56. A famous problem, first raised by R. Hamming, is to enumerate, in ascending order with no repetitions, a...
Impart asked 11/4, 2019 at 15:21
2
Solved
I'm trying to get Scheme going so I can work through "Structure and Interpretation of Computer Programs" but I keep running into the above-mentioned issue. I know sort of how to solve the problem b...
Streptokinase asked 22/4, 2018 at 18:21
1
Solved
Have I uncovered an actual error in the SICP book? It says:
Exercise 3.27: Memoization (also called tabulation) is a technique
that enables a procedure to record, in a local table, values that ...
Yahweh asked 19/10, 2018 at 18:7
1
Solved
Reading through SICP Distilled and trying to wrap my head around iterative vs recursive processes. The example given is:
(defn + [a b]
(if (= a 0) b (inc (+ (dec a) b))))
(defn + [a b]
(if (= a...
Listless asked 5/9, 2018 at 9:43
17
Solved
I'm trying to learn scheme via SICP. Exercise 1.3 reads as follow: Define a procedure that takes three numbers as arguments and returns the sum of the squares of the two larger numbers. Please comm...
5
Solved
So; I'm a hobbyist who's trying to work through SICP (it's free!) and there is an example procedure in the first chapter that is meant to count the possible ways to make change with American coins;...
Associative asked 28/9, 2009 at 1:28
8
Solved
I have been using PLT Scheme, but it has some issues. Does anyone know of a better implementation for working through SICP?
3
Solved
I am a beginner following SICP course on MIT OpenCourseWare using both the video lectures and the book available online. Yesterday I came across an example, which ask if we can write a procedure to...
Septuor asked 6/1, 2015 at 16:41
1
Solved
I am using the famous book SICP. On the exercise 1.18 a strange thing happens.
I wrote this code:
(define (double n) (* 2 n))
(define (halve n) (/ n 2))
(define (fast-mult a b)
(fast-mult-iter ...
Nichy asked 25/8, 2016 at 20:47
5
Solved
I want to try out SICP with Python.
Can any one point to materials (video.article...) that teaches Structure and Interpretation of Computer Programs in python.
Currently learning from SICP videos...
2
Solved
I've been working through the last few exercises ch 1 of SICP, where several of the exercises uses higher-order functions. Currently I'm trying to debug a problem in my solution to 1.45, which is r...
4
In SICP section 3.4 (serializers in scheme) on Currency there is a procedure called parallel-execute that is described but not implemented in MIT scheme. I wonder if anyone has actually implemented...
Myoglobin asked 20/11, 2012 at 6:33
1 Next >
© 2022 - 2025 — McMap. All rights reserved.