이번엔 거의 코딩이 없습니다 -_-;;;
책만 잘 보고 칠판에 그림만 잘 그릴 수 있으면 되네요.
진도는 337쪽까지 나가겠습니다.
; 성태
3.1. define accumulator
3.2. define make-monitored
3.3. define locked account
3.4. (3.3 dependent) define call-the-cops
; 원근
;; pros. of overwrite
3.5. Monte Carlo integration
3.6. reset random generator
;; cons. of overwrite
3.7. (3.3 dependent) define make-joint
3.8. execution order of arguments
; 석신
3.9. explain factorial
3.10. explain make-withdraw
3.11. explain make-account
; 정우
3.12. explain cons structure
3.13. explain make-cycle z
3.14. what is mystery?
; 봉열
3.15. explain after set-to-wow!
3.16. explain count-pairs
3.17. (3.16 dependent) define right count-pairs
3.18. how to find cycle?
3.19. finite space (xeraph's hint: Tortoise and Hare)
책만 잘 보고 칠판에 그림만 잘 그릴 수 있으면 되네요.
진도는 337쪽까지 나가겠습니다.
; 성태
3.1. define accumulator
3.2. define make-monitored
3.3. define locked account
3.4. (3.3 dependent) define call-the-cops
; 원근
;; pros. of overwrite
3.5. Monte Carlo integration
3.6. reset random generator
;; cons. of overwrite
3.7. (3.3 dependent) define make-joint
3.8. execution order of arguments
; 석신
3.9. explain factorial
3.10. explain make-withdraw
3.11. explain make-account
; 정우
3.12. explain cons structure
3.13. explain make-cycle z
3.14. what is mystery?
; 봉열
3.15. explain after set-to-wow!
3.16. explain count-pairs
3.17. (3.16 dependent) define right count-pairs
3.18. how to find cycle?
3.19. finite space (xeraph's hint: Tortoise and Hare)




덧글