CS200: Computer Science, Spring 2003
Notes: Monday 24 February 2003
- Now: Exam 1 due
- Before 10 March: Read rest of GEB part I (Chapters 2-4 and 6-9, in addition to Chapters 1 and 5 you have already read).
- Friday, 14 March: Problem Set 5: Wahoo! Auctions
- (set! Name Expression) evaluate Expression and replace the value associated with Name with the value of Expression
- (set-car! Expression0 Expression1) evaluate Expression0 and Expression1 and store the value of Expression1 in the car part of the value of Expression0. Expression0 must evaluate to a cons pair.
- (set-cdr! Expression0 Expression1) evaluate Expression0 and Expression1 and store the value of Expression1 in the cdr part of the value of Expression0. Expression0 must evaluate to a cons pair.(define (adelphiaize! lst) (if (null? lst) (void) ; nothing to return (begin (if (< (car lst) 0) (set-car! lst 0)) (adelphiaize! (cdr lst)))))Why is mutation scary?
Why is mutation useful?
Why do our evaluation rules fail when we allow mutation?
Would it be possible to create a circular list without using set-cdr!?
Using these Materials