Student’s name ……………………………………………..ID code ………………..

Midterm Examination Subject: CS.002 Discrete Mathematics &

Theory of Computation
Date: August 26, 2020 Time: 09.30- 11.30 A.M.

-------------------------------------------------------------------------------------------------------
Instructions:
1. Books and documents are allowed to be brought in the Examination Hall.
2. Total pages: 2 pages
Total hours: 2 Hours
Total points: 50 points.

1. Let U = {1, 2, 3, 4, 5, 6, 7}, A = {1, 2, 3, 4}, B = {4, 5, 6}, and C = {6, 7}.
Find
a.) AB, b.) ABC, c.) BC, d.) C, and
e.) A – B.
(10 points)

2. Use mathematical induction method show that 1 + 2 + 22 + … + 2n = 2n+1 – 1,

for n is the positive integers. (5 points)

3. Let A = {a, b, c, d}, B = {2, 3, 4, 5}, and R = {(a, 3), (a, 5), (c, 4), (d, 2)}.
Write
a.) Digraph of R relation, and (5 points)
b.) Matrix relation of R relation. (5 points)

4. From Fig. 4. Find

a.) Domain b.) Co-domain c.) Range d.) Is f in Fig.4 One-to-
One? e.) Is f in Fig.4 on-to? (10 points)

Fig. 4

5. How many bitstrings of length 10 start either with a bit 1 or end with 00?
(5 points)

6. Derive the Boolean expression and construct a truth table for the switching
circuit show below.
 (10 points)

%%%%%%%%%%%%%%%%%%%%