From jacobson@math-cs.cns.uni.edu Fri Jan 16 19:49:59 2004
Date: Fri, 16 Jan 2004 19:49:33 -0600 (CST)
From: Mark Jacobson <jacobson@math-cs.cns.uni.edu>
To: 810-151-04@uni.edu
Subject: [810-151-04] Scheme programming Assignment one - set intersection


First assignment - due on Friday, January 23rd by 5 p.m.

Write a scheme procedure to find the intersection of two sets.

I named my Scheme procedure insersection.
Here is an example of its use:

Welcome to DrScheme, version 204.
Language: Textual (MzScheme, includes R5RS).

> (intersection '(1 2 3 4 5 6 7 8 9 10) '(0 2 4 6 8 12 14))
(2 4 6 8)

> (intersection '(4 5 6 7 8) '(0 12 14))
()

> (define myList '(11 22 33 44))

> (intersection myList myList)
(11 22 33 44)

> (define myList2 '(U N I 2004 22))

> (intersection myList myList2)
(22)

     My solution used the following Scheme operations:

         member, null?, if, car, cdr, cons
         ------  -----  --  ---  ---  ----

     Have fun!

     Mark