MCS-177 Homework assignment 6 (Fall 2000)

Homework set 6 (due Wednesday, November 29)

1. Ex 7.6(b) (count elements satisfying predicate) Recall that a predicate is a procedure that returns #t or #f.
2. Ex 7.11 (in-order?, shuffle-number)
3. Ex 7.13 (4 map procedures): You aren't allowed to use car, cdr or cons for these.
4. Ex 7.21 (count ways of making change)
5. Ex 8.31 (count elements in tree between low and high)
6. Ex 8.32 (list elements in tree between low and high efficiently using ``onto'' parameter)

Daily Prep Problems

• 11/10: Read section 7.4. Do exercise 7.5(b).
• 11/13: Read section 7.5. Do exercise 7.15
• 11/15: Read section 7.6. Project 4 is due.
• 11/17: Read section 8.1. Do exercise 8.2.
• 11/20: Read section 8.2. Do exercise 8.3.
• 11/22: Catch-up day. Daily assignment to be announced.
• 11/27: Read section 8.3. Do exercise 8.15.
• 11/29: Read section 9.1-9.2. Do exercise 9.1. Homework 6 is also due.
• 12/1: Read section 9.3. Do exercises 9.10 and 9.12
• 12/4: Read section 9.4. Come prepared with specific written questions on the reading.