BIT110: DISCRETE MATHEMATICS CAT 1 (30 Marks)

a) Draw the truth table for a conjunction as used in proposition logic (3 Marks)
b) Construct a truth table for the compound proposition (p ∧ ¬q) → (r ∨ q) (4 Marks)
c) Use Euclidean Algorithm to find the GCD of 140 and 264. (3 Marks)
d) Use Boolean Algebra to Simplify the expression (A + C)(AD + AD) + AC + C
(4
Marks)
e) Show that if a|b and a|c then a|(b + c) (4 Marks)
f) Find how many ways a committee of 1 man and 3 women can be formed from a group of
3 men and 4 women (4 Marks)
g) Use the Principle of Mathematical Induction to verify that, for any positive integer n, 6 n
−1 is divisible by 5. (8 Marks)

BIT110: DISCRETE MATHEMATICS CAT 2 (30 Marks)

a) Transform the following English statement to predicate logic

Some person in this class has visited Mount Kenya. (4 Marks)

b) Compute (38002 · 7 201) mod 55. Show your work. (6 Marks)

c) Build a minimum spanning tree of the graph shown below using Kruskal’s algorithm

(10 Marks)
d) Suppose that 800 people are selected randomly in a town. Suppose further that 280 of
these people go to work by car only, 220 go to work by bicycle only and 140 use both
ways.
Use your knowledge on Venn diagrams to solve the following questions

i. How many people go to work by car only?

ii. How many people go to work by bicycle only?
iii. How many people go by neither car nor bicycle?
iv. How many people use at least one of both transportation types?
v. How many people use only one of car or bicycle?
(10 Marks)