Reg. Ne i B.Tech. DEGREE EXAMINATION, DECEMBER 2017 Fifth Semester MA0321 — DISCRETE MATHEMATICS (rte antes add rome cad ear 2072085 10 20122015) ‘Time: Three hours Max. Marks: 100, Answer ALL Questions PART =A (10x 2= 20 Marks) ‘Write the symbolic form of the statement “Any integer is ether positive or negative” Explain the rules US and ES. Draw the Hasse digram for the poset (P(4),<2) where P(A) is the power set of A=fade} Give an example of a relation which is both symmetric and antisymmetric. ‘Write the recurrence relation ofa Fibonacci sequence. Let the permutations of the elements of {1,2,3,4,5) be given by rsd 3) (2348 : a(S yf Sdema(l 3 3 ff) rintanant Are the following two graphs isomorphic? Give the explanation, Define an Eulerian ereuit nd give an example Show that ina Boolean algebra (s+y)(29)"= ayy 10. Show that ((,2,3,6,7.14,21,42},D) isa complemented Intic. The relation D is division, PART—B (5x 16=80 Marks) {Lal Using truth tbl, show that [(pv 4) A(p—>7)a(g—>r)]>r isa tautology i. By indirect method, prove that V=(P(2) > O(3))-3.P(2)> 3,08) (OR) ‘i Using mathematical induction, show that 8" —3" is divisible by 5 fr n21 Using rule CP, prove the following argument is valid. IA works hard, then B or C will enjoy themselves. IB enjoys himself, then A will not work hard. IPD enjoys himself, then C ‘will nol. Therefore if A work hard, D will nt enjoy himself.ai bi Find the minsets generated by the subsets A={1,7,8}, B the set U=f1,2,3,45,6,7,8,9,10} IER and S ar relations on aset A= {2,3}, where (1,2)5(2,1)5(2,2),(2,3),,0} $= {(1.2)s(2.2).(2.3). (3.1), (3.2),G,3)} Then find the matrices of RUS, RAS,RoS, SoR and ROS (oR) Using Warshall's algorithm, find the transitive closure R={(t).(21).(2,3),80),84),(43)}- Re i If. ->¥ and g:Y > Zare both bijections then prove that (ge f"= fog” Bai Solve the recurence relation a, +54,-1 =9 whore n 21 and ap = 6, ‘State and prove Lagrange’s theorem. 9,10} of of con) i Find ll the let cosets and right cosets of {0 []} inthe group (Zg,+e). 26 isthe st of Mai ‘equivalence classes generated by equivalence relation “congruence modulo 6” ‘Using generating functions solve ay ~4ay_, =32" for x1 given that ay = Find the maximum flow forthe following network 2s 30 source 1s sink 35 of ii, List the order in which the vertices of the tree given in figure are processed using rgezers () preorder Gi) inorder and (i) post order traversal. bi Isai ba Find the minimum spanning tree using Krushkal's algorithm. ‘Show thatthe number of venices of odd degree in an undirected graph is even. Ina Boolean algebra if @+5=Land a5 ~0 show that 6. If (L, 3) is a lative in which Vand» denote operations join and meet, prove that for any abel asbesavb=b sanb=a. oR) Draw the state diagram for the FSA for which state table is given in table, Final states are Sy and Ss T F s b SS |S [ss] S/S |S SS |S Find the grammar tha genres thst of words {02}.