CONFIDENTIAL MAY 2013/SET A/TDM1023 = FINAL EXAMINATION COURSE s COMPUTING MATHEMATICS COURSE CODE : TDM1023 DURATION B 3 HOURS INSTRUCTIONS TO CANDIDATES: 1. This question paper consists of SIX (6) 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 hall unless permission is given by the invigilator. 4. Please write your answer using a ball-point pen. 5. The use of calculator is allowed. 6. Please check to make sure that this examination pack consists of i. the Question paper ii. an Answer Booklet 7. Attached : Appendix A : Algebraic Laws for Propositional Calculus Appendix B : Rules of Inference ic NO ‘ — ID. NO. : LECTURER : SECTION : DO NOT OPEN THIS QUESTION PAPER UNTIL YOU ARE TOLD TO DO so The question paper consists of & printed pages CONFIDENTIAL,CONFIDENTIAL MAY 2013/SET A/TDM1023 QUESTION 1 a Let A= (1,2,{3,4,5, (6),(7}} ‘State whether each of the following statements is TRUE or FALSE. i. {6} EA (1 mark) ii BA}CA (1 mark) ji, Number of subset of 4 = 26 (1 mark) wv. lala? (1 mark) b. A group of children were asked whether they had been to Aquaria KLCC or Petrosains. The result showed that 90 children had been to Aquaria KLCC 70 children had not been to Aquaria KLCC 65 children had been to Petrosains and 15 had neither been to Aquaria KLCC nor Petrosains. i Draw a Venn Diagram to represent the above information, (4 marks) ji, Find the number of children in the group. (2 marks) ili, Find the number of children that had been to Aquaria KLCC. only, (1 mark) © Giventhat 4 = {c,a,t) i. Find the number of subsets for set A (2 marks) ii, List all the subsets of set A. (2 marks) (Total: 15 marks) 2 CONFIDENTIALCONFIDENTIAL QUESTION 2 a MAY 2013/SET A/TDM1023 Find the number of different arrangements that can be formed using all the letters in the word " LEADERSHIP *, (2 marks) How many SIX difference letter words can be formed (the words Need not be meaningful) using the letters of word "DURIAN’ if the first letter is D and the last letter is N. (repetition is not allowed) A class consists of 15 boys of whom 5 are prefect. How many committee of 8 can be formed if each consist of i. Any boys of the class li, Exactly two prefect must be in the committee. iii, Two prefect cannot be in the committee iv. Atleast three prefects are chosen. Use the binomial theorem to find the first four term of the expansion (x + 3)" (2 marks) (1 mark) (2 marks) (2 marks) (2 marks) (4 marks) (Total :15 marks) CONFIDENTIALCONFIDENTIAL MAY 2013/SET A/TDM1023 QUESTION 3 a Given a function f:Z* > Z*where f(x)=3x+6 i ‘Sketch the graph of the function (3 marks) il. State the domain and range of f (1 mark) ii, Is fa one-to-one function? Give reason(s) for your answer. (2 marks) iv. Is fan onto function? Give reason(s) for your answer. (2 marks) b. Given A= {a,b,c,d}, B={p,q,r} andC ={y, 2}. Find i AXB (2 marks) ii, (4x B)U(Bxc) (2 marks) ©. Evaluate trune(Yf4.7].9]+12.3+421]) [-2.2][5.14*0.88] (3 marks) (Total : 15 marks) 4 CONFIDENTIAL,‘CONFIDENTIAL MAY 2013/SET A/TDM1023 QUESTION 4 a. Consider the algebraic expression ((7-a)/5)+((a+6)? 3) i Draw a binary tree for the following algebraic expression (4 marks) ii. Determine the root of the tree (1 mark) i List all the ascendants of node 3 (1 mark) iv. List all the siblings of node 6 (1. mark) v. List all nodes at level 2 (1 mark) vi. State the height of the rooted tree (1 mark) b. Find the bit string for code "TREE" (1 mark) ii, Decode the bit string 01110001111111011110100000 (2 marks) 5 CONFIDENTIALCONFIDENTIAL MAY 2013/SET A/TDM1023 ©. Consider the following graph i Find the size and length of the graph (2 marks) ii, Find an Hamilton path. If it does not exist, give your reason(s) (2 marks) il, Find a Hamilton circuit. If it does not exist, give your reason(s) (2 marks) iv. Eulerian circuit. If there is none, give your reason(s) (2 marks) (Total: 20 marks) 6 CONFIDENTIALCONFIDENTIAL MAY 2013/SET A/TDM1023 QUESTION 5 @. Construct a truth table to determine whether the following statement is a tautology, contingency or contradiction. (p>a)aq>r) (8 marks) b. Use the rules of logic to simplify the expression (pv (p44) (6 marks) ©. Consider the compound argument “if an object is a triangle then itis a polygon” i Write the two primary propositions using the variables p and q, (2 marks) ii, Write all the premises using the variables in () (1 mark) ili, Express in words the contrapositive and the inverse of the ‘statement. (4 marks) (Total : 20 marks) 7 CONFIDENTIALCONFIDENTIAL MAY 2013/SET A/TDM1023 QUESTION 6 a. The Fibonacci numbers are the sequence of numbers defined recursively by List the first 5 sequence (5 marks) b. Use the Principle of Mathematical Induction to prove that the statement below is true for all n positive integers 143454..+(2n-1=n? (10 marks) (Total : 15 marks) (TOTAL: 100 MARKS) END OF PAPER 8 CONFIDENTIALCONFIDENTIAL MAY 2013/SET A/TDM1023 APPENDIX A. Algebraic Laws for Propositional Calculus 1. Double Negation —P © P 2. Identity per e ; 3. Domination ; vr e y 4. idempotent ; O e , PYg © qvp 5. Commutative PAG © gap Pog 2 gop bvavr @& pv@vr) 6. Associative agar @ paar) 7. Distributive Pvgar) @ (pvg)a(pvr) Palaver) & (pagv(par) “eng) & pvag 8. De Morgan's (v9) © pang 9. Inverse ape prpo F 10. Implication pg @ -pvg 14, Contrapositive p92 ~9>-p CONFIDENTIALCONFIDENTIAL MAY 2013/SET A/TDM1023 APPENDIX B Rules of Inference P 1 Modus Ponens: P>Q Q 3Q 2. Modus Tollens: P>Q =P PQ 3. Hypothetical Syllogism QR PoR CONFIDENTIAL,