Code No: X0522/RO7 Set No. 1 11 B.Tech I Semester Supplementary Exauninations, May 2010 MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE (‘Common to Computer Science & Engineering and Information ‘Tecimology) Time: Max Marks: 80 Answer any FIVE Questions AIL Questions carry equal marks 1. (@) Let pa and r be the propositions. yom have the flee 4 yom mis the final examination. 1 yom pass the come, Wite the following proposition into statement form i. Pog ii por iil. gtr iv. pVaVr v (Po TA)V Gown) vi (pAg) ¥ (TaAr) (b) Define converse, contrapesitive ancl inverse of an implication. [+4] 2. Prove using rules of inference or disprove. (a) Due isa Labrador retriever All Labrador retriever like to swin ‘Therefore Duke likes to sin (b) All ever numbers that are alzo greater than ase not prime 2s an even number 2's prime ‘Therefore some ever: aunbers are prime UNIVERSE = nusubers, (c) IFit is hot today or raining today then itis no fan to snow ski today tis no fun to snow ski today ‘Therefore it is hot today UNIVERSE = DAYS. [+68] 3 (a) Consider f; 2+ + Z* define by £ (a)= a2, Check if fis one-to-one and / or into using suitable explanation (b) What isa partial order relation? Let $ = { x,y2} and consider the pawer set P{S) with relation R given by set inchusion. ISR. a partial order (c) Define a lattice, Explain its properties [ese] 1of2Code No: X0522/RO7 Set No. 1 4. A is any nomempty set $ is the set of all bijections (ousone and onto mappings) from A to A. then show that $ isa group w.r.t. composition of mappings as hinary ‘operation. po} A mother distributes 5 different apples among 8 children. (a) How many ways can this be done if each child receives at most one apple (b) How many ways can this be done if there is no restriction on the number of apples a child ean receive. jis) 6. (a) Find recurrence relation for mumber of subsots of an ue element set (0) Solve a = Ban-1 + Bag-2 = 1a, = 1 sing gow crating factions 19] 7. (a) Devive the directed spanning tree from the graph shown Figure 7a 5 ¢ Figure Ta (b) Explain the steps involved in deriving a spanning tree from the given reli rected graph using breadth first search algorithm. sss] a (a) Write a brief note about the basic rules for constructing Hamiltonian cycles, (b) Using Grinberg theorem find the Hamiltonian eyele in the following graph, Figure Sb [ie] Figure sbCode No: X0522/RO7 Set No. 2 IT B.Tech T Semester Supplementary Examinations, May 2010 MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE ( Common to Computer Science & Engineering and Information “Teclinology) Timo: 3 hours ‘Max Marks: 80 Answer any FIVE Quest All Questions carry ea 1. (a) Let pia and r be the propositions, Ps you have the lee «you mime the final exnuninaton f you pam the coune, Write the fllowing proposition into statement form i Poa ii, g— Te iw. pWaVe ¥. G>T a) vi (Pg) V Far) (b) Define converse, contrapositive and inverse of an implication [i+] 2. Prove using rules of inference or disprove (a) Duke is a Labrador retsiever All Labrador retriever like to sxin ‘Therefore Dike likes to sain, (b) All ever numbers that are also greater than 2 are not prime 2s au even mumber 2is prime: Therefore some even mambers are prime, UNIVERSE = mambers (©) Hit is hot today or raining today then itis no fan to snow ski today Its no fmm to snows ski today ‘Therefore itis hot today UNIVERSE = DAYS. (54645) 8. (a) Determine whether the following relations are injective and/or subjective fune- tion, Find universe of the functions if they exist 2,02, 942) 1,2,8,4,5} {va (e 1063) 9)} LotsCode No: X0522/RO7 Set No. 2 1,294.5} 1,2,3,4,5) R= ((12).23),8.4),(4.8).5,) (0) Tf fametion is defined as f(x,n) mod n. Determine the i. Domain of f fi. Range of f iil g(a(a(a(7)))) if x (a) = £1209, n) [ss] 4. (a) IG is the set ofall positive rational uumbers, then prove that G is au abelian ‘group under the compesition defined by o sueh that aob = (ab)/S for a, b € C ssith tstal adition as the operation (b) Let P(S) be the power set of a non empty set S. Let 1° be an operation in P(S). Prove that associate low andl commutative law are true for the operation nin POS) 244] 5. (a) Howmany out comes are obtained from rolling in distinushable dice (b) Find the number of distmet triples (x1.x2.x3)oF non-negative integers satisfy= ing vy +a-tora < 15 (c) Howmany integers between | and 1,000 have a sum of digits of integer numbers equal to 10, he] 6. (a) Solve ay = fag 1 + Gag 9 =2" + (b) Solve ay = lage, + Aga = (a+ 1)? given ay = 0, ay = 1 [ss] 7. (a) Define spanning tree, Whut are its characteristics. (b) Derive all possible spanning tuees for the graph shown in Figuze 7. [6+10] 2, Figure 7 8. A mathematies department plans to offer soven graduate courses next semester namely combinatories (C), gronp theory (G), Field theory (F), numerical analysis (N), topology (1), applied mathematics (A), and real analysis (R.). The maathemat- Jes graduate students and the courses they plan t take are as follows: [is] 2083Code No: X0522/ROT ‘Shadent | Comrses Student [| Comes Abe | GFT George | AN Bab | CGR Hermn | AG Carol | GN Tgrid |_CT Dewitt | OF Tim CRT Taine | FN Ken | AR Red | CG Tinda [ATCode No: X0522/R07 Set No. 3 II B.Tech 1 Semester Supplementary Exauninations, May 2010 MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE ommon to Computer Science d& Engineering and Tnfarmtion ‘Tecluology) c: 8 hours Max Marks: 80 Answer any FIVE Questions ANI Questions entry exis marks L. (a) Lot pa and be the propositions P: you have the flee «yom miss the final examination you pass the conse, Write the following proposition into statement form Poo i, Tor iii, Tr iv. pVaVr v. (p> Tr) V ga~r) si, (pg) V (7aAr) (b) Define converse, contrapositive and inverse of an implication [2+] 2. (a) Lot Pie) denote the statement. “x is a professional athlete” and let Q(x}denote the statement” “x plays soccer”. The domain is the let of all people. Write each of the following proposition in English i. Ye(P(#) + Q(z) fi, So(P (x) AQ() ii, Yo (P(x) VQ(x)) (b) Write the negation of each of the above propositions, both in symbols and in words, [e+19] 3. (a) Define « bijective function, Explain with reasons whether the following fane- tions are bijiective or not. Find also the inverse of each of the fimetions. i. ffx) = 4x}2, ASsot of real numbers 34 1/s, A=set of non zero real numbers (243) mod, A=Ny (b) Let Fand g be fimetions from the positive real mambers to pasitive real mmmbers fil fs) defined by fa) = [2 ox) =a Caleulate fo g and of (10+) 4. (a) Let G bea group. ‘Then prove that Z(G) is a subgroup of G. {8 €G/ xg = ex for all €G) LotsCode No: X0522/RO7 Set No. 3 (b) Let P(S) be the power set of a non -empty set $. Let ‘FY be an operation in P(S). Prove that associate law and commutative law aze true fer the operation rin P(S) [o+6] 5. (a) How many 10-digit binary numbers are dre with exactly six Vs? () There are 25 true or false questions an an examination. How many diffrent ways can a student do the exaraination if he or she ent alo choces ta leave the answer bal (6) Find the mmber of non-negative integral solutions of 21 + 22-+ +4 = (2) In how many ways the committee's of 5 oF more ean be chosen fram 9 people tel 6. (a) Let S, denote the number of u - bit strings that do not contain the pattera TLL. Dewlop recurrence relation for S; and initial eonditions that define the sequence. (b) Solve 0, +80, 1 — 10a, = 0.1 > 2, given ay = Lay = 4 using generating fumetions. [s48] (9) Derive the directed spanning tree from the graph shown Figure Ta Figure Ta (b) Explain the steps involved in deriving a spanning tree from the given uneli- rected graph using breadth frst search algoritiun, iss] S.A muthematies department plans to offer seven graduate courses uext semester, namely combinatorics (C), group theory (G), Field theory (F), numerical analysis (N), topology (1), applied mathematics (A), and real analysis (R). The mathemat- ies graduate students and the courses they plan to take are as follows: [ae] Student [ Comes Student [ Comes Abe_| ORT Geome Bob_ [CGR Henna Carol [GN Turd Dewitt [CF Tim Blaine | FN Ken Bet | CG Linds 2 of 8Code No: X0522/R07 Set No. 4 Il B.Tech I Semester Supplementary Examinations, May 2010 MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE (Common to Computer Science & Engineering and Information ‘Technology) "Time: $ hours Max Marks: 80 Answer any FIVE Questions All Questions earry equal marks 1. (a) Lot pq and r be the propositions Ps you have the fle 4: you miss the final examination you pass the course. Write the following proposition into statement for i Poa itor iil gtr iw. pVqVr v (pa tyV (goes) vis (pg) V (Ted) (b) Define converse, contrapostive and inverse of an implication, ioe) 2 Let P(x) denote the statement. “xis professional athleto" and let Qlx)denote the statement” “x plays soceee”. ‘The domain is the let of all people. Write cach of the following proposition in English i ¥(P@) O(a) & Ar(PE)AQL)) ii, ¥e(PO)VO La) Write the negation of each of the above propositions, both in symbols and in words [ev19} 0 8, («) Determino whether the following relations are injective and/or subjective fune- ‘iow, Pind univers of the functions if they exis [ese mne} B=11,2,3,4,5) {v2} 1) 8).0.5)} (1,2.9,4.5) {aa4s) R= {(1.2),28)4.8)4.9)45.1)} (b) Hs faction is defied ws fea) mod u, Determine the i, Domain of f i, Range of f LotsCode No: X0522/R07 Set No. 4 ‘i e(a(a(a(7))}) if (3) = £200, [S48] 4. (a) Prove that a non empty subset H of a group G is a subgroup of G iff abe H = abe Hy fiacHsate dl (1) The set of integers Z, san abelian group nnder the composition defined by & such that ag b =a} b+ T foe a,b € Z, Find iu the identity of (Z, @) aud ii. inverse of each clement of Z o+s) A chain lotcr is sent to 10 people in the first woek ofthe year. ‘The nest weal ‘each person who received a Tetter sends letters to LD new people and s0 on, How many people have recived the levers atthe endl of the vou? (b) How mony intogere between 10° and 10° have no digits other thau 2, § or 8? nel 6. (a) Solve ap = ant + an-a > 2, given ay = 1, a; = 1 using generating fan (b) Solve ay = Boy 1,” 2 1, using generating functions. [s+] 7. (a) Define spanning tree. What are its characteristics. (b) Derive all possible spanning trees for the graph sbossn in Figure 7. [6+10) 9. oN ~ Figure 7 8. (a) How to detormine whothor « graph contoins Hamiltonian cyclo or not using Grin berg theorem, (b) Prove or disnrove that thete is an Hamiltonian eyele in the folowing graph, Pigure sb iis) 2of3Code No: X0522/RO7 Set No. 4 Figure Sb