Computer Science 61A - Fall 1997 - Harvey - Midterm 3

Computer Science 61A - Fall 1997 - Harvey - Midterm 3 - CS...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 61A, Midterm #3, Fall, 1997 CS 61A, Fall 1997 Midterm 3 Professor Harvey Problem #1 What will the Scheme interpreter print in response to each of the following expressions? Also, draw a "box and pointer" diagram for the result of each expression. Hint: It'll be a lot easier if you draw the box and pointer diagram first! (let ((x (list 1 2 3 4))) (set-cdr! x (cdr x)) x) (let ((x (list 1 2 3 4))) (set-car! (cddr x) (cdr x)) x) (let ((x (list 1 2 3 4))) (set-cdr! (cdr x) (cadr x)) x) Problem #2 An improper list is a data structure made of pairs, in which the cdr of some pair is anything other than a pair or the empty list. Write the procedure deep-fix! that takes a pair as its argument, examines the data structure headed by that pair, and replaces any improper cdr with the empty list. For example: > (deep-fix! '(1 2 (3 4 .5) (6 (7 . 8) 9) 10 . 11)) (1 2 (3 4) (6 (7) 9) 10) (In the example I've broken the rule about not mutating quoted data, in order to make the example easier for you to read.) NOTE: Do not allocate any new pairs in your solution. Modify the existing pairs.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/17/2009 for the course CS 61A taught by Professor Harvey during the Spring '08 term at University of California, Berkeley.

Page1 / 3

Computer Science 61A - Fall 1997 - Harvey - Midterm 3 - CS...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online