CONFIDENTIAL CSIJUN 2019/MAT415 UNIVERSITI TEKNOLOGI MARA FINAL EXAMINATION COURSE : DISCRETE MATHEMATICS COURSE CODE : MAT415 EXAMINATION JUNE 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 invigitator. 4, Please check to make sure that this examination pack consists of ji) the Question Paper li) an Answer Booklet ~ provided by the Faculty 5. Answer ALL question in English DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO This examination paper consists oF 6 printed pages © Hak Cipta Universiti Teknologi MARA CONFIDENTIAL,CONFIDENTIAL p CSIJUN 2019/MAT415 QUESTION 1 a) Consider a group of students of 17 Malays, 10 Chinese and 8 Indians. Find the number of ways to choose 15 students if |) there is no condition imposed. ji) the choice must consist of 7 Malays, 5 Chinese and 3 Indians. ii) the choice must consist of at least 4 Chinese and exactly 8 Malays. (8 marks) b) Determine the number of ways so that the letters in the word TITIWANGSA can be arranged if ’) there is no restriction imposed. ii) all the vowels must be together. iil) all the vowels not be together. (7 marks) QUESTION 2 @) Use the rules of inference and laws of logic to prove the validity of the following argument. Provide the steps and reasons. [rv g)a(-s)a(ar>8)]>4 (4 marks) b) Given the following statement For alll integer <0, there exist integers x and y such that x? +y? 5} and C={ x|xis prime number } List the elements of the following sets. i) (AnB)\c ii) AUBNC (4 marks) Use the laws of set theory to simplify the following expression. State the name of the laws used. lan a) A A survey that was carried out on 750 viewers of television programs that gave the following information (3 marks) 365 viewers like to watch Entertainment 260 viewers like to watch News 180 viewers like to watch Sports 60 viewers like to watch Entertainment and News 55 viewers like to watch Entertainment and Sports 40 viewers like to watch News and Sports. ‘The number of viewers whom did not watch any of the three programs is three times the number of viewers who watch all the three programs. i) Express the information given above in a single Venn diagram. li) Find the number of viewers like to watch all the three types of programs. iil) Find the number of viewers like to watch only one type of a program. (8 marks) (© Hak Cipta Universiti Teknolog! MARA CONFIDENTIAL,CONFIDENTIAL 4 CSIJUN 2019/MAT415 QUESTION 4 a) Given the following sequence 3,9, 21,45... i) Find the recursive formula for the sequence. ii) Find the sixth term of the sequence using formula in i). ( marks) b) Prove the following proposition by using the Mathematical Induction method If ne Zand n>Othen, Siang ; (8 marks) QUESTION 5 a) Given A={2,4,6,8} and R is a binary relation on A such that R={(ab):a beA, (a+b) is divisible by 4} i) List all elements of R ji) Construct a directed graph that represents R. ili) Determine whether R is an equivalence relation and state reason(s) for your answer. iv) List all the equivalence classes for A. v) Determine the partition of A. (12 marks) | -v3-421| b) Evaluate trunc(2.5]-1.72]+[1.52]) (4 marks) QUESTION 6 a) Give definition of following terms i) Induced Subgraph, li) Degree of vertex. (4 marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIALCONFIDENTIAL, 5 CSIJUN 2019/MATA15 b) Given a graph G as shown in Figure 1 h Figure 1 i) State the size of the graph G. ii) Give an example of a Hamiltonian path and justify your answer if the path does NOT exist. ili) Give an example of a Hamiltonian circuit starts at node d. iv) Give an example of an Eulerian path and justify your answer if the path does NOT exist v) Give an example of spanning tree with node g as the root. (7 marks) QUESTION 7 4a-3b a) Given an algebraic expression + (2x+y)’ i) Construct a full binary tree for the given expression. il) Determine the root, ii) Determine the height of the tree. iv) Determine the leaves. (6 marks) b) Construct an optimal prefix code for r, a, e, b, d, s that occur with respective frequencies 25, 60, 41, 22, 27, 30. Hence, decode the following sequences i) 0111101100. ii) 0100011011. iil) 01100100. (9 marks) END OF QUESTION PAPER (© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL