Code No: X0522 11 B.Tech I Semester. Supplementary Examinations, Nov - 201 MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE, (Como CSE, IT) ‘Time: 3 hours ‘Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. a) What is tautology? Prove thatthe following formula is a tautology CCP V = QR) = SV =((CP VQ) +R) 5), 'b) What is principal disjunctive normal form? Obtain principal d P=(P-Q)A = OV-P) (sMe8M0) mnetive normal form of| 2. a) Show that RS can be derived from the premises P+ (QS), -R V Pand Q b) Show that SY Ris tautologically implied by (P VQ) 4 (PR) » (QS) by sing atomic theorem proving (8M8M) 3. a) Explain about the following properties of binary relation in a set, Give one example for each. i) Reflexive i) Symmetric ii) Transitive iv) Teflexive _v) Anti symmettic bb) Define partial ordering principle? Give sxample. Let A be the set of factors of a particular positive intoger <= () Discuss elearly about predicates, (SM#8M) 3, a)Find the inverse ofthe following functions fis) 1015V7-38 ii) fexyad et >) Draw the Hasse diagram for the relation R on A= |, 2, 3,4, 5), whose relation matrix is given below (8M48M) boride ornid oorid ooo10 oooo4 4, a) Define semi group homomorphism, Give one example and explain how it is semi group homomorphism 'b) Define su monoid, Explain with one suitable example. (sMisM) tof?‘Coxle No: X0522 5. 8) A mother distributes 5 different apples among 8 children How many ways can this be done if ‘cach child receives almost one apple? by How many 2 digit and 3 digit even numbers can formed using digits from 0 t0 9 and have no repeated digits? (aMesMy, 66, 4) Show thatthe function f R=R defined by fi by Solve ayt3ay1- 1493, , given a0 =I, al=4 using generating functions, (8M#8M) 7.) How many vertices will the graph hav, i it contains 21 edges, 3 vertices of dogree 4, and the other vertices of degree 3 bb Write BES algorithm (o find spanning ree for a connected graph, (sM-8M 8.) What are the necessary and sufficient conditions to specify that wo graphs are isomrphic. Explain with example, List the basic rules for constructing Hamiltonian paths and eyeles, (88M), 2082Cove No: X0522 11BTech I Semester, Supplementary Examinations, Nov - 2011 THEMATICAL FOUNDATION OF COMPUTER SCIENCE (Com to CSE, IT) “Time: 3 hours Max Marks: 80 Angwer any FIVE Questions All Questions cary equal marks |, a) Explain about principal conjunctive normal forms, 'b) Obtain the principal conjunctive normal form of the formulas given by (SM#8M) PRA (QSP) 2. a)Diseuss elearly about predicates, (M+ 10M) ') Indicate the variables that are five and bound and also show the scope of the quantifiers DE) MOIA REY) +0) PIX AQ) i) (PHYA (30) VCC PEE) QED) 3, Let R be a hinary relation on the set of all positive integers such that R= {(a, by fab is an add positive integer) Is R Reflexive? Symmetric? Anti symmetric? Transitive? An equivalence relation? A partial ordering relation? ony 4, a) Let (M,") be monoid, Then prove that there exists a subset T = MM such that (m") is isomoxphie tothe monoid (T, O) >) Explain clearly about Homorphisin oMv6M 5, a) How many 3 digit no's are there which are even and have no repeated digits? ») Find the no, of distinct triples (x1, x2, x3) of non negative integers satisfying the inequality KHN2H3<6, (8Ms8M) Lof 2‘Code No: X0522 ROT ET ) 6. Write BES algorithm for the given connoted graph to find out a spanni orithm for finding a spanning tree of a connected graph and apply the same twee (aon 7. Find the recurrence relation and the initial condition for the sequence 0, 20, 30, 2, Hence find the general term of the sequence. 6m 8, a) Find the chromatic number of whee! graph, >) Find a wif complementary simple praph with 5 vertices, (3M+8M) 20f2‘Code No: X052: RO7 TB Tech I Semester, Supple MATHEMATICAL FOUNDATION OF COMPUTER St (Com t CSE, 11) ye 3 hours ‘Max Marks: 80 Answer any FIVE Que All Questions carry equal n 1.8) Obtain PDNF of p= (p— qa ~ 4 -p). by Write an equivalent formula for pA (q <=> £) V (<=> p) which does not contain the bi- ‘conditional, (sMisM) a) Show that (pla) abs) © (RGIRIRO)) => (}(phR) => ROW) by Explain about tree and bound vaci ein detail in the context of predicate logic, _(8M+8M) 3. Let R be a binary relation on the set of all positive integers such that R: positive integer) Is R reflexive? Symmetric? Anti symmetric? Transitive? An equivalence relation? A partial ordering relation? em) 4. a)IFG isa group of even oder, prove b) Prove that ina group G, if ae G, then O (a) =O") (sM#sM) 5.8) There are 30 girls and 35 boys in the junior's el while there are 25, I and 20 boys in the the senior's class, In how many w of 10 be chosen so a an a commit exactly 5 gids and 3 juniors on the committee? b) How many 5 digits mobile numbers have one oF more repeated. ? (aMisM) 6. a) Solve the recurrence relation (t-te) subject to initial condition t4=1 for n= and n=1 bb) What is an nth ofder linear homogenous recurrence relation with constant coefficients? Give coxamples (aMisM) Lor?Code No: X0522 RO7 SET. 7.8) What are the necessary and sufficient conditions to specify that 10 graphs are isomorphic: Explain with example >) Write an algorithm for breathy first search for spanning trees (eesMy) 8, a) Lis the basic rules for constructs by Prove that a has a Hamito Hamiltonian paths and eyeles nple graph with n vertices (n23) in which each vertex has degree a least n/2 an eye, (sM48M) 20f2