KABARAK UNIVERSITY

UNIVERSITY EXAMINATIONS
MAIN CAMPUS
FIRST SEMESTER,2022 ACADEMIC YEAR
EXAMINATION FOR THE BACHELOR OF SCIENCE IN COMPUTER
SCIENCE, COMPUTER SECURITY & FORENSIC AND INFORMATION
TECHNOLOGY

COMP 122 / COMP 121/COSF 122: DISCRETE STRUCTURES

STREAM: Y1/S2 - REGULAR TIME: 11:30-1:30PM

EXAMINATION SESSION: JAN. - APRIL DATE: 5/04/2022
VENUE: DOME TENT COPIES:430

INSTRUCTIONS TO CANDIDATES
1. Answer Question 1 and any other two questions in the answer booklet provided.
2. Do not write on your question papers. All rough work should be done in your
answer booklet.
3. Clearly indicate which question you are answering.
4. Write neatly and legibly.
5. Edit your work for language and grammar errors.
6. Follow all the instructions in the answer booklet
7.
As members of Kabarak University family, we purpose at all times and in all places, to set apart in one’s heart,
Jesus as Lord. (1 Peter 3:15)

Kabarak University is ISO 9001:2015 Certified

Page 1 of 5
SECTION A: (COMPULSORY) TOTAL MARKS FOR THIS SECTION IS 30.

1.
a) Using examples explain the following connectives in propositional logic
i. Negation/ NOT (¬), (2 Marks)
ii. Implication / if-then (→), (2 Marks)
iii. If and only if (⇔). (2 Marks)

b) Define what is a set and describe the two ways set can be represented (3 Marks)
c) Draw a graphG for the givenadjacency matrix. (3 Marks)

d) Discuss the application of breath first search in the area of computing (3 Marks )
e) Describe the different application areas of discrete structures in computing (3 Marks)
f) Given the following set X = {1, 2, 3, 4, 5, 6} and Y = {1, 2}. Giving reason to determine
if the given sets are Proper subset Subset, or Equal set (3 Marks)

g) Simplify the following equation using the theorems and postulates of Boolean Algebra:

ii. A( A+B ) + B Ā (3 Marks)

iii. F = (A B + B’ C) + B ( C’ + A’ ) (3 Marks)

As members of Kabarak University family, we purpose at all times and in all places, to set apart in one’s heart,
Jesus as Lord. (1 Peter 3:15)

Kabarak University is ISO 9001:2015 Certified

Page 2 of 5
 iv. A+ B + Ā∗B (3 Marks)

SECTION B. TOTAL MARKS FOR THIS SECTION IS 40.

ANSWER ANY TWO QUESTIONS FROM THIS SECTION. EACH QUESTION IN
THIS SECTION CARRIES 20 MARKS.

2.

a) Explain the following terms as used in discrete structures

i. Combination (2 Marks)
ii. Propositional equivalence (2 Marks)
iii. Seminoid (2 Marks)

b) Considering the given Graph is G = (V, E) where V = {a, b, c, d} and E = {{a, b}, {a,
c}, {b, c},{c, d}}

As members of Kabarak University family, we purpose at all times and in all places, to set apart in one’s heart,
Jesus as Lord. (1 Peter 3:15)

Kabarak University is ISO 9001:2015 Certified

Page 3 of 5
 Define and determine
i. Degree of a Vertex (2 Marks)
ii. Degree of a Graph (2 Marks)

c) Consider the following conditional statement:

If the flood destroy my house or the fires destroy my house, then my insurance
company will pay me.
Write the converse, inverse and contrapositive of the statement. (4 Marks)

d) Discuss reasoning rules used to prove if an argument form is valid (6 Marks)

3.
a) Write the following statement in symbolic form using quantifiers: (4 Marks)
i. All students have taken a course in mathematics.
ii. Some students are intelligent, but not hardworking.
b) A professor writes 40 discrete mathematics true/false questions. Of the statements in
these questions, 17 are true. If the questions can be positioned in any order, how
many different answer keys are possible? (6 Marks)

c) Graph traversal is the problem of visiting all the vertices of a graph in some
systematic order. Describe ways one can traverse a graph. (4 Marks)
d) Given the following logic circuit Determine the output expression and Simplify it
(6
Marks )

As members of Kabarak University family, we purpose at all times and in all places, to set apart in one’s heart,
Jesus as Lord. (1 Peter 3:15)

Kabarak University is ISO 9001:2015 Certified

Page 4 of 5
4.
a) Minimize the following Boolean expression using Boolean identities:
F= ∑A,B,C(1,3,6,7) (6 Marks)

b) What do you mean by graph isomorphism, show it by example? (4 Marks)

c) Prove if the following three propositions are tautologies:
i. p↔p (2 Marks)
ii. p → (p Ṿ q) (2 Marks)
iii. (p Ʌ q) → (q Ʌ p) (2 Marks)
d) Describe the different application areas of Breath First Search (4 Marks)
5.

a) Differentiate between Eulerian graph & Hamiltonian graph (6 Marks)

b) Differentiate between predicate logic and proposition logic (4 Marks)
c) Find the minimum number of persons selected so that at least eight of them will have
birthdays on the same day of week. (4 Marks)
d) Discuss the different Representation of Relations used in graphs (6 Marks)

As members of Kabarak University family, we purpose at all times and in all places, to set apart in one’s heart,
Jesus as Lord. (1 Peter 3:15)

Kabarak University is ISO 9001:2015 Certified

Page 5 of 5