‘AOL rial viaional ae 1 MMA 108/MMA 6521603, anys orf > [rans < M-TECH DEGREE EXAMINATIONS, MAY/JUNE 2008 MMA 103/MMA 652/603 MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE fetit ttt ‘Time Three Hours ‘Mizimum Macks: 100 —— Part A (6x4=20 Marks) ‘Answer All Questions 4. Show that @ V(P-A7Q) V (7P A 7Q) isa tautology without using truth table. ‘Siate Pigeonhole Principle. 2. Define eubmonoid. Prove that fot any commutative meneld (Mi, e), the set of igémpotent elements of M form a submonoid 3. pBefine recursive function. Give an example. ‘Find the language generated by the grammar G = {(S, A,B), (2,b),S, P), \where P is the eet of productions S > AA, A> aB, A» ab, Bb. 8 Dole smbigunue ara. Esai whether folowing granmer i ambiguous or not G={N,T,S, Ph, where N = {S-A), T= {a,b} and P consists ofthe rules S++aAb, S—abSb, S +a, A+ bS,A-+ BAAD, Part—B (6x16=80 Marks) “Answer All Questions 8. ) Obtain Pan and Pent of P AQ) V (7P AR)V (QAR) {Using mathematical induction prove that &°— 3" s a multiple of (or) 7.) Show that SVR logically comes from the premises PVQ, P—>R, Q — S. {Solve the recurrence relation S (n)~ 8 (n-1) ~ 9 S (1-2) = O where n= 2 (0) = 1,8 (1) =O using generating function. 8.1) Prove that the intersection of any two subgroups is again a eubgroup, {i State and prove Lagrange’s theorem. (oR) 8.) Prove that every subgroup of a cyclic group is cyct. |) Prove that every cyclic group is abelian,40,9 Show that a( x.y) = yi apa 2 MA 103/MMA 652/603, inive recursive function. +} State and prove modular Inequality n 9 ation (OR). 1113) Show that every chain i ation, far care the olement ta dstbuve ac AWyand avo “42, Define Fi rogular if 43, Prove able push down 15.Lete evo, aA b= a hcthen prove that there i a Finite automation accepts ip State pumping lemma for regu lana that any regular language can be accepted by 2 fie ‘automation. (v.28. Pybm caren fee grammar, Prove that here 8 mn M20 that L(M) = & (©) (oR) FQEfa Zo, 8) be a push down automation acoeptng janguage L by ermpty stack, free grammar G with L (@)=L- 2). Then prove that there is @ contextGF 1 -MMA 103/603/652 M. TECH DEGREE EXAMINATIONS, NOV/DEC-2009 ‘MMA 103/603/652 MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE REGISTER NUMBER , TEETEITIE ‘Time: Three Hours ‘Maximum Marks: 100, art (4-20 Mat) ‘Answer All Questions i 41. Obtain the eoniunctive normal form of (PAQ) «+ (PAQ). 2, Show thatthe intersection of two normal subgroups is also a ormal subgroup, 3, Let D so = {1,2,38,6,10,15,90} and let the relation D be alvisor on Dio (iexty fx dlvies y). Find ( al lower bounds of 10 & 15, (all gb of 10 a1 {i tl upper bounds of 10 815 (Gv) all lub of 10 848, 4, The state table ofa finite state machine M is given in the table. () ldenty the nput set | the state set S; the ouipt set‘O and the inital state ‘of M (i) Draw the state diagram of M (i) Find the output ofthe string 0917017 te [0 7 & [Say] Suz & [Sax] Say & [Sav] Sz & [Sz] Sox 6. Construct the grammar for the language i =(a ba"; n 21). Part—B.(6x18=80 Marks) ‘Answer All Questions. 6. (@) Prove that RS can be derived from the premises P (Q'S), 7RVP and Q, {(b) Prove that the relation " congruence modulo m* over the set of postive Integer is en equivalence relation