211 S '05
 
Assignments
Set 1
Set 2
Set 3
Set 4
Set 5
Set 6
Set 7
Set 8
Set 9
Set 10
Set 11
Set 12
Set 13
Set 14

Problem Set 7

Due date: 2/23 @ 4:30 pm

The purpose of this problem set is to revisit self-referential data definitions and to understand some functions that consume several complex arguments (multiplexing).

HtDP Problems:

recursion: 14.1.3, 14.1.5, 14.3.3, 14.4.1, 14.4.2, 14.4.3, 14.4.4

multiplexing: 17.1.2, 17.2.2

Additional Problem 1:

Design the function find-sublist. It consumes two lists of symbols, big and pat, and returns the number of times the latter occurs somewhere in the former.

How can you use this function to discover the number of times one picture is a part of another?

Optional:

Please explain any problems you had completing this assignment in no more than 30 words.


last updated on Wednesday, April 13th, 2005 3:57:37pmgenerated with PLT Scheme -- (Source)