All Questions
9 questions
1
vote
1
answer
2k
views
Scheme function to duplicate every element of a list a specified number of times
This code takes a list and a integer and duplicates every element in the list the specified number of times.
...
- 33
1
vote
2
answers
2k
views
Pascal's triangle in mit-scheme
As suggested by the name of source file (ex1.12.scm), I just started learning mit-scheme by reading SICP. In Exercise 1.12, I'm asked to "compute elements of Pascal'...
- 503
2
votes
1
answer
449
views
SICP - exercise 1.11 - tree recursion
From SICP
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 ...
- 2,726
2
votes
1
answer
131
views
lexical scope v let in scheme functions
I've been chewing through a bit of The Little Schemer and the Peano examples got me thinking about operation size and time.
I got some help on making Peano Multiplication linear -- however ...
- 265
1
vote
1
answer
241
views
Linear Peano multiplication in Scheme?
I've been running through The Little Schemer, and have hit the example of Peano multiplication. The solution is given in TLS (reproduced below) -- however what interests me is the order of the ...
- 265
1
vote
1
answer
441
views
Square-tree using maps and recursion
Define a procedure square-tree analogous to the
square-list procedure of exercise
2.21. That is, square-list should behave as follows:
...
- 2,253
2
votes
2
answers
10k
views
Design a procedure to reverse a list
SICP exercise 2.18 asks the following:
Exercise 2.18. Define a procedure
reverse that takes a list as argument
and returns a list of the same
elements in reverse order:
...
- 2,253
0
votes
1
answer
2k
views
Iterative sum using recursion
Given the following recursive definition of sum:
(define (sum term a next b)
(if (> a b)
0
(+ (term a)
(sum term (next a) next b))))
And ...
- 2,253
1
vote
1
answer
990
views
Both an Iterative and a Recursive f(x)
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 recursive and an
iterative process for computing f(n).
I wrote the ...
- 2,253