하반기 채용공고
  • 추천글
  • 최신글
  • 검색범위
  • ( 68 건)
이전 다음 이미지있는 글만 보기
  • 3.22
  • jingjing's blog| 08.11.05 02:14
  • define make-queue let front-ptr ' rear-ptr ' define set-front-ptr! item set! front-ptr item define set-rear-ptr! item set! rear-ptr item define empty-queue? null? front-ptr define front-queue if empty-queue? error FRONT called wit.....
  • [SICP]Exercise 3.21
  • jingjing's blog| 08.11.04 23:29
  • (define q1 (make-queue)) (insert-queue! q1 a> ((a) a) (insert-queue! q1 b> ((a b) b) (delete-queue! q1> ((b) b) (delete-queue! q1() b) define print-q.....
  • [SICP]Exercise 3.20
  • jingjing's blog| 08.11.04 16:16
  • Procedure objects in the global frame. Result of evaluating (define x (cons 1 2)). Result of evaluating (define z (cons x x)). Result of evaluating (s.....
  • [SICP]Exercise 3.19
  • jingjing's blog| 08.11.03 17:26
  • define cycle? x define iter slow fast cond or null? slow null? fast #f eq? slow fast #t else if or null? cdr slow null? cddr fast #f iter cdr slow cddr fast if or null? x null? cdr x #f iter x cdr x I think the very clever idea me.....
  • [SICP]Exercise 3.18
  • jingjing's blog| 08.10.29 16:36
  • define cycle? x let nodes-checked define check item set! nodes-checked cons item nodes-checked define checked? item memq item nodes-checked define iter nodes if not pair? nodes #f if checked? nodes #t.....
  • [SICP]Exercise 3.17
  • jingjing's blog| 08.10.29 15:52
  • define count-pairs x let nodes-checked ' define check item set! nodes-checked cons item nodes-checked define checked? item memq item nodes-checked define iter x if not pair? x 0 if checked? car x + iter car x iter cdr x begin chec.....
  • [SICP]Exercise 3.16
  • jingjing's blog| 08.10.29 00:12
  • The count-pair procedure returns 3. The count-pair procedure returns 4. The count-pair procedure return 7. The count-pair procedure never returns at a.....
  • [SICP]Exercise 3.14
  • jingjing's blog| 08.10.27 22:39
  • list v: (a b c d) After evaluating (define w (mystery v)) So the mystery procedure makes list items in reverse order. v: (a) w: (d c b a) ...
  • [SICP]Exercise 3.13
  • jingjing's blog| 08.10.27 02:08
  • Effect of (define z (make-cycle (list a b c))). so if you try to compute (last-pair z), an infinite loop happens. ...
  • [SICP]Exercise 3.12
  • jingjing's blog| 08.10.27 01:14
  • Solution) Lists x: (a b) and y: (c d). Effect of (define z (append x y)) So, the first is (b). Effect of (define w (append! x y)) The second is (b c.....
  • [SICP]Exercise 3.11
  • jingjing's blog| 08.10.25 01:17
  • Result of defining make-account in the global environment. Result of evaluating (define acc (make-account 50)) Environments created by applying ((acc .....
  • [SICP]Exercise 3.11
  • jingjing's blog| 08.10.25 01:17
  • Result of defining make-account in the global environment. Result of evaluating (define acc (make-account 50)) Environments created by applying ((acc .....
  • [SICP]Exercise 3.10
  • jingjing's blog| 08.10.23 22:01
  • Solution) Result of defining make-withdraw in the global environment. Result of evaluating (define W1 (make-withdraw 100)) Environments created by app.....
  • [SICP]Exercise 3.10
  • jingjing's blog| 08.10.23 22:01
  • Result of defining make-withdraw in the global environment. Result of evaluating (define W1 (make-withdraw 100)) Environments created by applying the .....
  • [SICP]Exercise 3.9
  • jingjing's blog| 08.10.23 02:01
  • Solution) Recursive Version Procedure object in the global frame Environments created by evaluating (factorial 6) Iterative Version Procedure object .....
  • [SICP]Exercise 3.9
  • jingjing's blog| 08.10.23 02:01
  • Recursive Version Procedure object in the global frame Environments created by evaluating (factorial 6) Iterative Version Procedure object in the glo.....
  • [SICP]Exercise 3.7
  • jingjing's blog| 08.10.21 17:42
  • Solution) define make-joint account password new-password define dispatch p m if eq? p new-password account password m lambda amount Incorrect password dispatch ...
  • [SICP]Exercise 3.6
  • jingjing's blog| 08.10.21 15:49
  • Solution) define rand let x random-init define generate begin set! x rand-update x x define reset set! x random-init define dispatch m cond eq? m 'generate generate eq? m 'reset reset else error Unk.....