b
i F3s1u%a%XhwauUUU a uzDu%at%UYDaU%haua'u%4hD
d v V q d d W e d V V q y V k q
usaachsUUxD3pt`DhDa3h'aDs%Du%h%p3jYDaDaaufhg
V q dV T W r q qk r W e ` e q ` W ` W q
i r
Ushu%aq
y y T V r k W q i r V W V V q T W q
DDDhUuDaYusaUssztfg 1DUhgUsjuD%aUauDa
§2 Functions 15
7. Given sets A, B, and C, express each of the following sets in terms of A, B,
and C, using the symbols U, H, and .
D={x|x6Aand(xBorxC)},
E={x|(xeAandxeB)orxC},
F={x|xEAand(xeB=>xC)}.
8. If a set A has two elements, show that JP(A) has
1. Using the substitution model, show the evaluation of the following Scheme expression in detail.
You should show all the evaluation steps, except that you may evaluate all the subexpressions
of a combination which are variable lookups or primitives in o
A Couple of Extra Practice Questions
CS 230, Spring 2014
We have given you a lot to study. Here are a few more practice questions. They are not
exhaustive. These are just some questions we think may be helpful. They certainly do not
span the entire space
1. Using the substitution model, show the evaluation of the following Scheme expression in detail.
You should show all the evaluation steps, except that you may evaluate all the subexpressions
of a combination which are variable lookups or primitives in o