CONFIDENTIAL / SULIT Universiti TUN ABDUL RAZAK FINAL EXAMINATION JUNE 2011 COURSETITLE =: DISCRETE MATHEMATICS COURSECODE: CNB 2103 DATE/DAY ‘ 6 AUG 2011 / SATURDAY TIME/DURATION — : 4.00 PM — 7.00 PM /3 HOURS. INSTRUCTIONS TO CANDIDATES: 1. Please read the instruction under each section caretuly 2. Candidates are reminded not to bring into the examination hallfoom any form of written aterials or electronic gadget except for stationery that is permitted by the Invigilator. 3. Students who are caught breaching the Examination Rules and Regulation wil be charged with {n academic dishonesty, and if found guilty of the offence, the maximum penalty is expulsion from the University. (This Question Paper consisis of 5 Printed Pages including front page) ™* DO NOT OPEN THE QUESTION PAPER UNTIL YOU ARE TOLD TO DO so “*Discrete Mathematics (CNB2103) CONFIDENTIAL ‘June 2017 Final Examination There are TEN (10) questions in this section. Answer all questions in the answer booklet. (400 Marks) 1. a) Convert these octal and hexadecimal numbers to binary and decimal numbers. 1) 7725 (6 Marks) ii) 19E.Cie (6 Marks) b) Convert the decimat number 465i to octal and hexadecimal. (6 Marks) 2. a) Find truth tables for the following expressions. ) Cea Cap) (3 Marks) i) po(aenag—n (4 Marks) b) Prove this de Morgan's law: 7(>pa7qar)=pvqv7r (6 Marks) 3. Construct circults to produce the following outputs. a) KF eZ VK FY) HZ) b)y (2) +xy+ yz o) bytyez)ylyezy) (12 Marks) 4. LotA={1,2,3,4) R={(1,1), (1,2), (2,3), (2,4), (3.4), (4,1), (4.2) S= 3.1), (4.4), (2,3), (24), (1.1), (1,4) a) Compute R+R b) Compute S*R ©) I (1,3) © RoR? 4d) 18(4.3) ¢ S+R? (6 Marks) 5. Suppose V=(S, A, a,b}, T={@,b} and S is the start symbol. Find a set of productions that Includes S-» Aa, and A ~» a and generates each of these languages: a) {2,aa) (3 Marks) d) {a,b ba, baa} (4 Marks)Discrete Mathematics (CNB2103) ‘CONFIDENTIAL June 2011 Final Examination 6. a) Draw the state diagrams for the finite-state machines with the following state tables. State Table | State | Taput o 3 5 se Ss (4 Marks) ») Find the set recognized by the following deterministic finite-state machine. (3 Marks) c) What Is the output produced by the following finite-state automaton when the input string is 111017 0,0 i Hee nst 1,0 0,1 (4 Marks)Diserate Mathematics (CNB2103) CONFIDENTIAL Jana 2011 Fins! Examination 7. Use the Euclidean Algorithm to find the greatest common divisor (god) of each pairs of integers, ‘Show the steps of calculation. a) (440, 924) b) (315, 91) (4 Marks) 8. a) Based on the graph below:- Find the number of vertices. (1 Mark) Find the number of edges. (1 Mark) i) Find the degree of each vertex. (6 Marks) iv) Represent the graph with an adjacency matrix. (5 Merks) b} Draw the graph represented by the given incident matrices. 100001 111010 000100 010100 oo0010 (6 Marks)Discrete Mathematics (CNB2103) CONFIDENTIAL, -June-2011 Final Examination 9. a) Suppose that a full 4-ary tree has 27 internal vertices. How many leaves does it have? (2 Marks) b) How many leaves does a full 3-ary tree with 100 vertices have? (2 Marks) ©) Perform an preorder and postorder traversal of the rooted tree T. (4 Marks) d P 10. Prove using mathematical induction that 1.23 +23.4+..4m(n + tin +2) = noet}(n + 2\in)4 (4 Marks) *** END OF QUESTIONS ***