This preview shows pages 1–2. Sign up to view the full content.
Homework 5
CSC 4101, Fall 2011
Due: 1 December 2011
1. (10 pts)
Write set membership test and set intersection programs in each of the languages Scheme and ML.
Each function will only be about two or three lines long.
As data structure for sets, we will use unordered lists. E.g., the Scheme list
’(11 15 3)
represents
the set
{
3
,
11
,
15
}
. Each element should appear only once in the set.
Write Scheme functions
memv?
and
intersection
of the following types. The boolean function
memv?
takes an element and a list and returns true if and only if the element is in the list. Use the
comparison
eqv?
for comparing individual elements. The function
intersection
takes two lists
and returns a list representing the set intersection of the arguments. I.e., the result list contains all the
elements that are in both argument lists.
Similarly, write two ML functions
member
and
intersection
. For comparing individual ele
ments, you can use
=
.
You can test these programs, but for submitting the homework, it’s good enough to have them on
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Fall '08
 Kraft,D

Click to edit the document details