UNIVERSITY OF MAURITIUS
FACULTY OF ENGINEERING
SECOND SEMESTER EXAMINATIONS
MAY 2014
PROGRAMME
BSc (Hons) Computer Science
MODULE NAME
Discrete Mathematics (Self-Study)
DATE
Tuesday
MODULE CODE
CSE 1255(1)
06 May 2014
TIME
NO. OF
QUESTIONS SET
13:30 15:30 Hrs
DURATION
NO. OF QUESTIONS
TO BE ATTEMPTED
INSTRUCTIONS TO CANDIDATES
Answer Any Four (4) questions.
2 hours
DISCRETE MATHEMATICS CSE 1255(1)
Question 1
(a)
A = { a,b,c,d,f}
B={b,d,r,s}
Find (i) A B (ii) A + B (iii) A B using arrays.
[3 marks]
(b)
Show that if a divides b and a divides c then a2 divides bc.
(c)
Using the Euclidean algorithm find
[4 marks]
GCD (190, 34).
[5 marks]
(d)
Express
GCD( 190,34) in the form = s(190) + t ( 34).
[5 marks]
(e)
(f)
Convert (10.375)10 to base 2
[3 marks]
By expressing the two numbers in terms of multiple of prime numbers find the
GCD and LCM of 105 and 240.
[5 marks]
Question 2
(a)
Let the symbols , , o be define for the set (0,1) by the following tables.
xo
Show that
(i) is commutative.
(ii) , is associative.
(iii) De Morgans law hold or not.
[2+ 4 + 3 marks]
(b)
The structure R represented by ( M, + ,* , T ) where M is the set of 3 by 3 Matrices.
+ : addition
* : multiplication
T: Transpose
Show that R is closed with respect to addition and multiplication.
[4 marks]
/Contd next page
Page 1 of 4
DISCRETE MATHEMATICS CSE 1255(1)
Question 2 [Contd]
(c)
Write down the addition identity for M.
[4 marks]
(d)
For M to have an identity matrix under transpose operation; what property or
what type of matrix should M be.
[4 marks]
(e)
Compute 312 216 mod 7. Show all your workings.
[4 marks]
Question 3
(a)
(b)
(c)
Show that (p r) V (q r) and (p q) r are logically equivalent. Use truth
table for that purpose.
[6 marks]
2
Prove that if n is odd then n is odd. n is an integer.
[6 marks]
Prove the following using mathematical induction.
3*50 + 3*5 1 + 3*52 + + 3*5 n = [3(5n+1 1)]/4
[5 marks]
(d)
Using back tracking find an explicit formula for
an =2 a n-1 - an-2
a1= 1.5, a 2= 3
[5 marks]
(e)
A = { a,b,c}
B = { 1,2}
C= { #, * }
List all elements of the product set AX B X C.
[3 marks]
Page 2 of 4
DISCRETE MATHEMATICS CSE 1255(1)
Question 4
A = { a,b,c}
R = {(1,1),(1,2),(2,1), (2,2),(2,3) (2,4) ,(3,4),(4,1)}}
(a)
Show that R is a subset of A X A.
[3 marks]
(b)
Draw the digraph of R.
[3 marks]
(c)
Write down the in-degree and out-degree of each vertex of R.
[4 marks]
(d)
Find MR
(e)
Find MR2
(f)
Find M R
[3 marks]
[3 marks]
[3 marks]
(g)
A = { 1,2,3,4}
B = { a,b,c }
R={(1,a), (1,b),(2,b,),(2,c), (3,b), (4,a)}
S={(1,b), (2,c),(3,b,),(4,b)}
Compute
(i)
R complement
(ii)
R S.
(iii)
R U S.
(iv)
R -1
[3 * 2 marks]
Page 3 of 4
DISCRETE MATHEMATICS CSE 1255(1)
Question 5
(a)
The plan of a museum is shown below. Is it possible to visit the site by passing
through each door exactly once. Explain your working.
[6 marks]
(b)
Apply FLEURY algorithm to the graph in (c) to find a EULER circuit. Draw it on
the graph.
[4 marks]
(c)
State whether a Hamilton path exist for the graph in (c).
[2 marks]
(d)
Using the Labeling algorithm find the maximal flow for the network whose
capacity are shown
3
4
1
2
5
3
2
3
[13 marks]
END OF QUESTION PAPER
/ph
Page 4 of 4
