KENYA METHODIST UNIVERSITY
END OF 1ST TRIMESTER 2014 (FT) EXAMINATION
FACULTY : SCIENCE & TECHNOLOGY
DEPARTMENT : PURE AND APPLIED SCIENCES
UNIT CODE : MATH 211
UNIT TITLE : DISCRETE STRUCTURES 1
TIME : 2 HOURS
INSTRUCTIONS
Attempt question one and any other two questions
Question One (30 Marks)
a. Determine the number of permutations of the word “COMPUTERSCIENCE.”
(5
Marks)
b. Provide a logic gate circuit for the Boelean expression AB+AC (5 Marks)
c. Let u={1, 2, 3, 4, 5, 6, 7, 8, 9, 10} where u represent the universe set.
Also let A={1, 2, 3} and B={4, 3, 5}. Display this information on a Venn
diagram
(5 Marks)
d. A committee consists of 20 persons in how many ways can the members
sit around a circular table so that the chairman sits between the secretary
and the treasurer? (5
Marks)
e. Use binomial theorem to expand (x-2)10 in ascending powers of x up to the
terms containing x3 (5 Marks)
Page 1 of 4
f. Define a regular graph hence determine which of the following graphs is
regular and state their degree (5 Marks)
i) • •
ii) • •
• •
Question Two (20 Marks)
a. There are 32 micro computers in a computer center. Each micro-
computer has 24 parts. How many difference parts to a micro-computer
in the computer are there? (5
Marks)
___
b. Prove the Boolean equation A+ AB = A+B using a truth table (5 marks)
___
( AB = complement of AB)
c. Provide an adjacency matrix for the graph (5 Marks)
•A
D• •B
Page 2 of 4
•C
d. Prove by induction that the sum of the first n odd positive integers is n 2
(5
marks)
Question Three (20 marks)
a. Let A={1, 2, 3, 4} and B={7, 8, 9}, find
i) The cardinality of A (2 Marks)
ii) The power set of B (3 marks)
iii) The carsian products AxB (4 marks)
iv) Verify the De-Morgan’s laws A1∪B = (A∩B)1 (5 Marks)
b. Determine method each of the functions below is a bisection (one to one
and onto) from the set of integers to the set of integers. Give a reason for
your answer
i) f(x)=2x+1 (2
marks)
ii) f(x) = x2+1 (2 Marks)
iii) f(x) = x3 (2 Marks)
Question Four
a. Distinguish between a connected graph and a complete graph (4 Marks)
b. Draw a graph C corresponding to the following adjacency matrix (6
Marks)
( )
0 1 1 1
1 0 1 1
1 1 0 1
1 1 1 0
c. Find a minimal spanning tree for the weighted graph (10 marks)
2 2
2 1 1
2
2 1 3 of 4
Page
3 1 1
2
3 3
3 3
Page 4 of 4
