CONFIDENTIAL CS/DEC 2019/MAT415

UNIVERSITI TEKNOLOGI MARA

FINAL EXAMINATION

COURSE DISCRETE MATHEMATICS

COURSE CODE MAT415

EXAMINATION DECEMBER 2019

TIME 3 HOURS

INSTRUCTIONS TO CANDIDATES

1. This question paper consists of seven (7) questions.

2. Answer ALL questions in the Answer Booklet. Start each answer on a new page.

3. Do not bring any material into the examination room unless permission is given by the
invigilator.

4. Please check to make sure that this examination pack consists of:

i) the Question Paper

ii) an Answer Booklet - provided by the Faculty

5. Answer ALL questions in English.

DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO

This examination paper consists of 5 printed pages
© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
CONFIDENTIAL 2 CS/DEC 2019/MAT415

QUESTION 1

a) Consider the digits 2, 3, 4, 6, and 7. Find the number of different ways if

i) four digit numbers greater than 4000 can be formed and repetition is not allowed,
ii) five digit numbers that divisible by 2, begin with digit 7 and repetition is not allowed.
(4 marks)

b) A class consists of 6 boys and 14 girls. A committee of 5 is to be formed. Find the

number of committee that can be formed if the committee must consists of

i) 3 boys and 2 girls,

ii) more than 2 boys.
(5 marks)

c) Determine the number of arrangement of all letters in the word COMBINATION if

i) no condition is imposed,
ii) both O must be together,
iii) the first two letters are AM.
(8 marks)

QUESTION 2

a) Verify that the proposition (p v q) v ~ (p a q) is a tautology using a truth table.

(3 marks)

b) Given the following open statements by considering the universe consists of all integers.

p(x):x2+6x +8 =0, q(x):x<0, r(x): x is even number

Determine the truth values of the following statement. Hence, provide example or
counter example to your answer.

i) 3x[p(x)vr(x)->q(x)].
ii) Vx[q(x)->p(x)].
(4 marks)

c) Prove the validity of the following argument by using the rules of inference.

~pAq

r->p

~ r -> s

s->t

.-. t
(4 marks)

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL

CONFIDENTIAL CS/DEC 2019/MAT415

QUESTION 3

a) Given the universal set U={0,1,2,3,4,5,6,7,8,9} with subset A=(x|xeZ+, x<8),

B={3,7,8,9}, and C={x| x is divisible by 2}. Find
i) A\B.
ii) (A'uB)nC.
(5 marks)

b) Use the laws of set theory to simplify the following expression. State the name of laws
used.
Au (B \ A)
(3 marks)

c) In January 2019, 2100 customers came to QQMH retail shop. A record on the purchase
of goat milk powder brand from her customers was given as follow:

260 customers bought brand GM and brand LM,

340 customers bought brand GM and brand WM,
320 customers bought brand LM and brand WM,
220 customers bought brand GM only,
240 customers bought brand LM only, and
480 customers did not buy any goat milk powder.

The number of customers bought brand WM only is quadruple of customers bought all
milk powder.

i) Represent the above information in a Venn Diagram.

ii) Find the number of people buying all the three type of goat milk powder.
iii) Find the number of people who bought at least two goat milk powder.
(7 marks)

QUESTION 4

a) Given a sequence of 4,7,10,13 Find the

i) formula for the above sequence.

ii) seventh term of the sequence using formula in i).
(5 marks)

b) Prove the following proposition by using the mathematical induction method.

ifneZ+and n>0thenVi =-n(n +l)

i=1

(8 marks)

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL

 CONFIDENTIAL 4 CS/DEC 2019/MAT415

QUESTION 5

a) Given a relation R={(x,y)| x+y <9,(x,y)e A} onset A={2,4,6}.

i) List all the elements of the relation R.
ii) Determine whether R is reflexive, symmetric, antisymmetric and transitive. Give
reason(s) for your answer.
(6 marks)

b) Given a function f: R -> R defined as f(x) =1- 2x.

i) Sketch the graph of f(x).

ii) Statethe domain and range of the function f(x).
iii) Determine whether the function f(x) is onto function and justify your answer.
(5 marks)

c) Evaluate
(2.75-5.89) -((1.34)2 +4.21
trunc(4.99)
(5 marks)

QUESTION 6

a) Given the graph G as shown in Figure 1.

Figure 1
i) State the size of the graph G.
ii) Determine the degree of each node.
iii) Give an example of Eulerion path and justify your answer ifthe path does NOT exist.
iv) Give an example of Eulerion circuit and justify your answer if the circuit does NOT
exist,
v) Give an example of Hamiltonion circuit and justify your answer if the circuit does NOT
exist,
vi) Give an example of spanning tree with node a as the root.
(9 marks)

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL

CONFIDENTIAL CS/DEC 2019/MAT415

b) Give the definition of the following terms

i) Paths.
ii) Connected graph.
(4 marks)

QUESTION 7

a) Given an algebraic expression

(p-2)3+4q
(rsXt-1)
i) Construct a full binary tree for the given expression.
ii) Determine the root.
iii) Determine the height of the tree.
iv) Determine the leaves.
v) State the ascendants of q.
(7 marks)

b) Given the letters v,c,a,e,r,l that occurs with respective frequencies 3, 16, 28, 12, 21.

i) Construct the optimal binary prefix code for each letter,

iii) Encode the word "real clever" using prefix codes as in i).
(8 marks)

END OF QUESTION PAPER

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL