GHANA COMMUNICATION TECHNOLOGY UNIVERSITY

FACULTY OF COMPUTING AND INFORMATION SYSTEMS

BSc INFORMATION TECHNOLOGY & BSc MOBILE COMPUTING
(BIT’S)
LEVEL 100
MORNING / EVENING / REGULAR
ACCRA & SATELLITE CAMPUSES
END-OF-SEMESTER EXAMINATIONS
MAY 2022

MATH 121 / 171: DISCRETE STRUCTURES

Duration: 21/2 HOURS

THERE ARE TWO SECTIONS IN THIS PAPER:

SECTIONS A & B
ANSWER ALL QUESTIONS IN SECTION A
AND
ANY 2 QUESTIONS FROM SECTION B

Date: THURSDAY 2nd JUNE @ 2:00 PM

Examiner’s Name: SAMUEL N. N. NORTEY

–...1/4
SECTION A ANSWER ALL QUESTIONS: [40 MARKS]
1. Using the graph below:

a) Draw the adjacency list and perform DFS and BFS using m as a
source as well as the resulting BFS tree? [6 marks]
b) Determine the in – degree, out – degree and hence the degree of
each vertex, write out the degree sequence and derive the
Handshaking Principle? [4 marks]
c) A digraph G had adjacency matrix:
0 1 0 0
0 0 1 0 
M =
0 0 0 1
 
1 0 0 0
(i) Calculate M 2, M 3 and M 4. [6 marks]
(ii) Determine the reachability matrix M*? [4 marks]

2. a) Let R be the relation on the set A = {1, 2, 3, 4, 5, 6, 7} defined by

the rule (a, b)  R if the integer product of (ab) is divisible by 4.
List the elements of R and determine if it reflexive, symmetric,
antisymmetric, transitive and find closures where necessary? [4 marks]

b) For the Boolean functions F1 and F2 below, write down the corresponding
(i) Boolean expression in its disjunctive normal form;
(ii) Using the Karnaugh map method, write down the simple
Boolean expression?

–...2/4
 (iii) Draw the logic circuit corresponding to simple Boolean
expression F2 in (b) if possible [6 marks]

Inputs Outputs
x y z F1(x,y,z) F2(x,y,z)
0 0 0 0 0
0 0 1 0 1
0 1 0 1 1
0 1 1 1 0
1 0 0 1 0
1 0 1 0 0
1 1 0 0 1
1 1 1 1 1

3. a) Give an indirect proof of the theorem; “If 𝑛 is an integer and

n3 + 11 is odd, then n is even.”? [5 marks]
b) Translate the following into a predicate formula, then form the
negation of the statement:
(i) Some old dogs can learn new tricks.
(ii) No rabbit knows calculus
(iii) Every bird can fly.
(iv) There is no dog that can talk.
(v) There is no one in this class who knows Chinese and
Spanish. [5 marks]

–...3/4
SECTION B (ANSWER ANY 2): [20 MARKS]
4. In the following argument, determine the validity or otherwise
of the Statement:
a) “If I study, then I will not fail programming. If I do not play
basketball, then I will study. But I failed programming.
Therefore, I must have played basketball [5 marks]
b) Prove by induction that
1 1
P(n) : 2 + 6 + 12 + 20 + ... + n(2n + 2) = n( n + 1)( n + 2) n  1 [5 marks]
2 3

5. a) If A, B and C are three sets, complete the following De-Morgan’s laws:

(i) ( A  B)1 =

(ii) ( A  B)1 =
(iii) A − (B  C) =
(iv) A − (B  C) = [4 marks]

b) Draw the Hasse Diagram representing the partial ordering

{(a, b) | a divides b} on {1, 2, 3, 4, 5, 6, 10, 15, 20, 30, 60}? [6 marks]

1
6. a) Let f : R − {0} → R − {0} defined by f ( x) = . Show that f
x
1
is bijective and its inverse is given by f −1 ( x) = ? [6 marks]
x
b) Some applications to Graph Theory are data mining, route
finders, computer graphics, compression coding and the
internet and router networks.”

Encrypt using and additive shift of:

(i) 3
(ii) 6 [4 marks]

–...4/4