Discrete Mathematics Exam 3

6/8/2011
1. (10) Explain each of the following terms :
(a) Bipartite graph
(b) Greedy algorithm
(c) At most , , where
(d) Random variable
(e) Central limit theorem
2. (4) Let be a finite nonempty alphabet and let be a set of natural numbers including
0. Then the function, , is defined such that where denotes the length
of a string .
(a) Show that is a homomorphism from the algebra, , to the algebra,

, where is the concatenation and is the addtion operation.

(b) Under what condition of does become an isomorphism? (Your answer should be
justified.)
3. (4) Let be a lattice. Prove that for every and in , if and only if

where and .
4. (4) Let

be a distributive and complemented lattice. Prove that the

complement of every element in is unique.

5. (4) Describe the Stones representation theorem and illustrate it using one Boolean algebra
having eight elements.
6. (4) Answer each of the following :
(a) Let and be two events in a sample space . Show that if and are mutually
exclusive and also independent, than either of and is .
(b) Let and be two random variables defined on the same sample space. Show that if
and are independent, then where is the multiplication.