SCHOOL OF ENGINEERING AND TECHNOLOGY

FINAL EXAMINATION FOR THE BSC (HONS) COMPUTER SCIENCE

BSC (HONS) SOFTWARE ENGINEERING
BSC (HONS) INFORMATION TECHNOLOGY
BSC (HONS) COMPUTER & NETWORKING
SYSTEMS

ACADEMIC SESSION : SEPTEMBER 2023 SEMESTER

SUBJECT : MTH1114 COMPUTER MATHEMATICS

EXAMINATION : JANUARY 2024

TIME ALLOWED : 2 HOURS + 10 MINUTES READING TIME

INSTRUCTIONS TO CANDIDATES

This question booklet contains THREE Questions.

Answer ALL Questions

All answers must be written in the answer booklets provided using blue or
black INK.

IMPORTANT NOTES TO CANDIDATES

Materials Allowed
Standard Items : Pen, Pencil, Eraser or Correction Fluid,
Ruler Special Items : Non Programmable
Calculators

It is your responsibility to ensure that you do NOT have in your possession

any unauthorised notes or any other means that would improperly help you
in your work. If you have any unauthorised materials with you, hand it to the
invigilator BEFORE reading any further.

DO NOT REMOVE THIS QUESTION PAPER FROM THE EXAMINATION HALL

[This paper contains THREE questions printed on EIGHT pages, including
cover page]
School of Engineering and MTH1114/ January 2024
Technology Examination

Question 1 (Total 60 marks)

a) An entertainment service provider, surveyed 1000

women to identify the type of movie genres they
preferred. It was found that 52% liked watching
comedies, 45% liked watching fantasy movies and 60%
liked watching romantic movies. In addition, 25% liked
watching both comedy and fantasy, 28% liked watching
both romantic and fantasy and 30% liked watching both
comedy and romantic movies . 6% liked watching none
of these movie genres.
i) Draw a Venn diagram based on the information (4 marks)
given above.( note: answer in Venn diagram can
be represented in percentage or the actual value
out of 1000)

Let C = percentage of women who liked watching

comedy F = percentage of women who liked
watching fantasy R = percentage of women
who liked watching romantic
movies
ii) How many women liked watching all three movie (2 marks)
genres?
iii) Find the number of women who like watching only (2 marks)
one of the three genres.

iv Find the number of women who liked watching at (2 marks)

least two of the given genres.

b) Given the weighted graph below, use Prim’s Algorithm (5

to find and draw the minimal spanning tree. You can marks)
start from vertex V1.

Page 1 of 7
School of Engineering and MTH1114/ January 2024
Technology Examination
c) Given the word COMPUTER;
i) How many ways can the letters in the word (2 marks)
COMPUTER be arranged in a row?

ii) How many ways can the letters in the word (2 marks)
COMPUTER be arranged if the letters CO must
remain next to each other?

iii) If letters of the word COMPUTER are randomly (2 marks)

arranged in a row, what is the probability that the
letters CO remain next to each other?

d) What is the value of x after each of these

statements is encountered in a computer program, if x =
1 before the statement
is reached?
i) If x + 2 =3 then x:= x+1 (2 marks)

ii) If (x + 1 =3) OR (2x+2 =3) then x:= x+1 (2 marks)

iii) If (2x + 3 =5) AND (3x+4 =7) then x:= x+1 (2 marks)

iv) If (x + 1 = 2) XOR (x+2 =3) then x:= x+1 (2 marks)

v) If x < 2 then x:= x+1 (2 marks)

e) Using the laws of logic show that ~ (p ˅ (~p ˄ q)) ≡ ~p ˄ (5

~q marks)

f) Let U = {1,2,3,4,5,6,7,8,9}, A = {1,3,5}, B = {1} and

C = {3,6}.
Write down the following sets:
i) ~(A ∩ B) (2 marks)

ii) C–A (2 marks)

iii) P(C) (2 marks)

iv) BXC (2 marks)

v) ~A U ~C (2 marks)

Page 2 of 7
School of Engineering and MTH1114/ January 2024
Technology Examination
g) Given the argument;
It is not sunny this afternoon and it is colder than
yesterday. We will go swimming only if it is sunny. If we
do not go swimming, then we will take a canoe trip.If we
take a canoe trip, then we will be home by sunset.
Conclusion;
We will be home by sunset.

Assume;
p: it is sunny this
afternoon q: it is colder
than yesterday r: we will
go swimming
s: we will take a canoe trip
t: we will be home by sunset
i) Write the above argument in symbolic form. (3 marks)

ii) Using the laws of inference prove the conclusion. (8 marks)

h) Let X = {1,2,3,4} and let R1= {(1,1),(1,3),(2,4),

(3,4)}
i) Write down the domain and range of R1 (2 marks)

ii) Write down R1-1 (1 mark)

Page 3 of 7
School of Engineering and MTH1114/ January 2024
Technology Examination

Question 2 (Total 20 marks)

a) Given the gcd (429,1092) = d.

i) Use the Euclidean algorithm to find the value of d. (3 marks)

ii) Find the values of m and n ꜫz such that 429m (8 marks)

+1092n = d

b) Using a Truth Table, prove that the following is a valid

argument: If it’s raining then the streets will be
flooded. If the streets are flooded then the final
examination will be cancelled. If the streets are not
flooded or it did not rain then the final examination will
not be cancelled. Therefore if it did rain then the final
examination will be cancelled.
Assume that:
p: it’s raining
q: The streets are flooded
r: final examination will be cancelled
i) Write the argument in symbolic form. (2 marks)

ii) Using a Truth Table test if the argument is valid (7 marks)

Question 3 (Total 20 marks)

5𝑛(𝑛+1)
a) Using Proof by Induction: (12
marks)
Show that 5 + 10+15+…….+ 5n = is true for all
2
positive
integers.

b) Given A = {1,2,3,4,5,6}. Consider the following relation (8

on A. marks)
R = {(1,1), (1,2), (2,1), (2,2), (3,2), (3,3), (4,3), (5,5), (5,6),
(6,6)}
Determine whether R is reflexive, symmetric, transitive
and antisymmetric. Your answer must include the
definition of reflexive, symmetric, transitive and
antisymmetric followed by
reasons why or why not.

~ END OF PAPER ~

Page 4 of 7
School of Engineering and MTH1114/ January 2024
Technology
APPENDICES Examination

The Laws of Logic

For any primitive statements p, q, r, any tautology T0, and any

contradiction F0,

1) p  p Law of Double Negation

2) (p  q)  p  q DeMorgan’s Laws

(p  q)  p  q

3) p  q  q  p Commutative Laws
pqqp

4) p  (q  r)  (p  q)  r p Associative Laws
 (q  r)  (p  q)  r

5) p  (q  r)  (p  q)  (p  r) Distributive Laws
p  (q  r)  (p  q)  (p  r)

6) p  p  p Idempotent Laws
ppp

7) p  F0  p Identity Laws
p  T0  p

8) p  p  T0 Inverse Laws
p  p  F0

9) p  T0  T0 Domination Laws
p  F0  F0

10) p  (p  q)  p Absorption Laws

p  (p  q)  p

Page 5 of 7
School of Engineering and MTH1114/ January 2024
Technology Examination
Rule of Inference Name of Rule
1) p Rule of Detachment
pq (Modus Ponens)
q

2) p  q Law of the Syllogism

qr
pr

3) p  q Modus Tollens
q
 p

4) p Rule of Conjunction
q
pq

5) p  q Rule of Disjunctive
p Syllogism
q

6) p  F0 Rule of Contradiction
p

7) p  q Rule of Conjunctive
p Simplification

8) p Rule of Disjunctive
pq Amplification

9) p  q Rule of Conditional
p  (q  r) Proof
r

10) p  r Rule for Proof

qr by Cases
 (p  q)  r

11) pq Rule of the

rs Constructive
pr Dilemma
qs

12) p  q Rule of the

rs Destructive
q  s Dilemma
 p  r

Page 6 of 7
School of Engineering and MTH1114/ January 2024
Technology Examination

∈ Z ), the number of onto functions is given as:

For finite sets A, B with A = m and B = n (i.e. m, n

nΣk=0 (−1)k nCn−k (n−k)m

Page 7 of 7