GHANA COMMUNICATION TECHNOLOGY UNIVERSITY

FACULTY OF COMPUTING AND INFORMATION SYSTEMS

BSc INFORMATION TECHNOLOGY & BSc MOBILE COMPUTING
LEVEL 100
MORNING / EVENING
ACCRA CAMPUS
END-OF-SEMESTER EXAMINATIONS
APRIL/MAY 2021

MATH 121 / 171: DISCRETE STRUCTURES

Duration: 24 HOURS

THERE ARE THREE (3) SECTIONS IN THIS PAPER:

SECTIONS A, B & C
ANSWER ANY 2 QUESTIONS FOR EACH SECTION
AND
UPLOAD AS A SINGLE DOCUMENT WITHIN 24 HOURS

Start Date: 26th APRIL @ 12:00 AM

End Date: 26TH APRIL @ 11:59 PM

Examiner’s Name: EDWIN MIREKU / SAMUEL N. N. NORTEY

–...1/5
SECTION A (ANSWER ANY 2): [20 MARKS]
1. Using the graph below:

a) Draw the adjacency list and perform DFS and BFS using S as a
source as well as the resulting BFS tree? [5 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? [5 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 its inverse? [2 marks]

b) Check whether the relation R on the set S = {1, 2, 3} is an equivalent

relation where:
𝑅 = {(1,1), (2,2), (3,3), (2,1), (1,2), (2,3), (1,3), (3,1)}. Which of the
following properties R has: reflexive, symmetric, anti-symmetric,
transitive? Justify your answer in each case? [4 marks]

c) Let 𝑆 = {𝑎, 𝑏, 𝑐} and 𝑅 = {(𝑎, 𝑎), (𝑏, 𝑏), (𝑐, 𝑐), (𝑏, 𝑐), (𝑐, 𝑏)}, find [𝑎], [𝑏]
and [𝑐] (that is the equivalent class of a, b, and c). Hence or otherwise
find the set of equivalent class of 𝑎, 𝑏 and 𝑐? [2 marks]

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

n3 + 13 is odd, then n is even.”? [5 marks]
b) For the following Boolean functions, give a tabular representation
of their Boolean expressions:

–...2/5
 (i) F ( x, y , z ) = [ x  y ] z
(ii) F ( x, y, z ) = [ x  z ] [y z ]
(iii) What can you say about (i) and (ii) above? [5 marks]

SECTION B (ANSWER ANY 2): [20 MARKS]

1. In the following argument, determine the validity or otherwise of the

Statement:
a) “If you aren’t polite, you won’t be treated with respect. You aren’t
treated with respect. Therefore, you aren’t polite. [2 marks]
b) “If you play football during a thunderstorm, you’ll get hit by lightning.
You didn’t get hit by lightning. Therefore, you didn’t play football in a
thunderstorm”
Therefore, taxes are lowered.”
(i) Write out the propositional statements in the above argument?
(ii) State the premise(s) and conclusion in the argument?
(iii) Using a truth table, determine the validity of the argument? [2 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. [2 marks]

(ii) Determine the reachability matrix M*? [4 marks]

2. 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) = [2 marks]

–...3/5
 b) If 𝐴 and B are finite sets which are subsets of 𝑈. Establish a formula for
𝑛(𝐴 ∪ 𝐵) in terms of 𝑛(𝐴), 𝑛(𝐵) and 𝑛(𝐴 ∩ 𝐵). Hence or otherwise
deduce a formula for a particular case where A and B are disjoint?
[2 marks]
c) Express the following using language of Predicate Calculus, where
it is understood that the people being discussed are in the courtroom.
If any sentence is ambiguous, give all symbolic versions.
(i) All judges are sober
(ii) There is a dishonest lawyer.
(iii) All defendants are innocent.
(iv) Some plaintiffs are lawyers
(v) Anybody who is honest and a defendant is innocent
(vi) All defendants who are not sober are dishonest. [6 marks]

3. a) 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
x
b) Let f : R → (−1,1) be defined by f ( x) = , x  R . Find the
x −1
inverse of the above function if it exists, where R is the set of
real numbers? [5 marks]

SECTION C (ANSWER ANY 2): [20 MARKS]

1. a) 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}? [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?
(iii) Draw the logic circuit corresponding to simple Boolean expression
F2 in (b) if possible [6 marks]

–...4/5
 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

2. a) “Theory and techniques in discrete mathematics are well coupled

with applications and implementations. For example, coding theory
goes hand in hand with data compression, protocols and communication
security. For example, spectral methods are increasingly used in graph
algorithms for dealing with massive data sets. With this knowledge
I feel I have chosen a program with great prospects.”

Consider the text above and provide an encryption to it using

Caesar’s Cipher with a shift of:
(i) 3
(ii) 6 [6 marks]

b) Define the following terms:

(i) Encryption
(ii) Decryption
(iii) Ciphertext
(iv) Plain text [4 marks]

3. a) Derive the Boolean expression and construct a truth table for the switching
circuit below. [6 marks]

1 2
B A

5 6 7 8
Input 𝐴ҧ 𝐵ത
Output

𝐵ത
3 4

b) Convert ABC16 to a denary (decimal) number? [2 marks]

c) Convert the binary numbers 1110011110101001 to it hexadecimal

equivalent? [2 marks]

–...5/5