Top Vendors Certifications Help, http://www.ocertify.com/?aid=4598&pid=567 Thanks....
105
a
certmajor7
Jun 7, 2006 8:52 pm
http://www.edegreeworld.com/?aff=desire...
106
bbuszard
Jun 8, 2006 12:28 am
; The vectors and matrix used to test the procedures (define v (list 2 4 6 8)) (define w (list 3 5 7 9)) (define m (list (list 1 2 3 4) (list 4 5 6 6) (list 6...
107
Help Support
certmajor7
Jun 8, 2006 6:14 am
http://www.edegreeworld.com/?aff=desire...
108
bbuszard
Jun 8, 2006 7:29 pm
; The names fold-right and fold-left seem unintuitive to me. They ; don't work in opposite directions as SICP claims: both peel off ; one object from the left...
109
Personal Pan
certmajor7
Jun 10, 2006 1:53 pm
http://www.ocertify.com/?aid=4598&pid=567...
110
bbuszard
Jun 12, 2006 2:04 am
; In the naive hope that the spam hasn't driven everyone away... ; The fold-left and fold-right definitions from 2.38 (define (fold-left op initial sequence) ...
111
road97es
Jun 13, 2006 2:07 pm
Hi, First I'd like to say hello as I'm new to the group. Thanks a lot for this group. I've just begun to make my trip through SICP. Currently I'm fighting with...
112
bbuszard
Jun 14, 2006 9:01 pm
... Hello Arturo, Glad to see there's someone else still checking the group. I suspect the lack of discussion of 1.14 is simply because no-one feels like ...
Hello, let me try another approach: let: n = amount k = kind of coins v[i] = denomination of the coins of kind i (i=1..k) T(n,k) = number of steps For k=1,...
115
Johan Andersson
sbvrsv
Jun 15, 2006 11:49 am
We were given this frame to fill in: (define (accumulate-n op init seqs) (if (null? (car seqs)) '() (cons (accumulate op init <???>) ; A (accumulate-n op...
116
Johan Andersson
sbvrsv
Jun 15, 2006 12:20 pm
To find unique triples, we combine unique-pairs with enumerate-interval. (define (unique-triples n) (flatmap (lambda (pair) (map (lambda (i) (append pair (list...
117
Johan Andersson
sbvrsv
Jun 15, 2006 1:01 pm
The queens procedure is given. (define (queens board-size) (define (queen-cols k) (if (= k 0) (list empty-board) (filter (lambda (positions) (safe? k...
118
bbuszard
Jun 16, 2006 1:15 am
... That's probably the most reasonable way to do it. Without using unique-pairs I produced the following: (define (generate-triples n) (flatmap (lambda (i) ...
119
bbuszard
Jun 16, 2006 2:41 am
... <ibatugow@...> wrote: 50000? That's some implementation you're using. I can only get up to n=300 or so before Dr. Scheme (on my machine) starts taking...
120
Personal Pan
certmajor7
Jun 16, 2006 3:48 am
http://www.edegreeworld.com/?aff=desire...
121
Johan Andersson
sbvrsv
Jun 16, 2006 7:47 am
... I'm using MIT Scheme, which has no native flatmap. flatmap as defined in SICP (define (flatmap proc seq) (accumulate append nil (map proc seq)) will...
122
Arturo Pina
road97es
Jun 16, 2006 1:22 pm
Hi, My understanding... ... I think it's easy to see that T(n,1) = 2n+1 at most this being the case if v[1]=1 or T(n,1) = 3 at least if v[1] = n However in the...
