oy IRE I Lol hd. Q@ PES Institute of Technciogy, Bangalore PES (RiorGincis Inettite under VIU-Belgeun and WGC-New Deni) t2¢s201 SEMESTER END EXAMINATION (SEE) B. E. Ill SEMESTER- DECEMBER 2013 12CS201 - MATHEMATICS Ill FOR COMPUTER SCIENCE Time: 3 Hrs Answer All Questions ______Max Marks: 100 T. |) | Prove the following logical equivalence using Rules of Inferences 6 | i) pa(q>n ii) lpoq | lap qor 2 ees It oat : ) _ b) | Let p(x) , q(x) and r(x) denote the following open statements 4 p(x) =x7 -8x+15=0 . q(x)=x isodd rx)=x > 0 For the universe of integers, determine the truth or falsity of each of the following | statements. If a statement is false give a counter example | i) Vx Ep@) > q0)] | ii) Vx fq) > pOd] | iii) 3x [ r(x) > a(x] | iv) ¥xt la00 > 1p] | | ¢) | Show that the premises “If you send me an e-mail message, then [ will finish writing the program,” “If you do not send me an e-mail message, then I will go to sleep early,” and “If I go to sleep early, then I will wake up feeling refreshed” lead to the conclusion “If I do not finish writing the program, then I will wake up feeling refreshed.” d) | Give a direct proof for the following arguments 4 i) [fmisan even integer then prove m+7 is odd ii) Ik and n are odd integers then prove k +n is even 2. | a) | Define an Equivalence relation. 7 IfA ={1, 2, 3, 4} give an example of a relation ona set A which is i) Reflexive and Symmetric ,but not transitive ii) Reflexive and transitive ,but not symmetric | iii) Symmetric and transitive, but not reflexive b) | Suppose that R is the relation on the set of strings of English letters such that aRb if | 6 and only if Ka) = i(b) , where /(x) is the length of the string x. Is R an equivalence relation. c) | Define a partially ordered set. Construct a Hasse diagram for the POSET a (A= {2, 3, 6, 12, 24, 36, 72 }, |) . Is the POSET A under the relation of divisibility a Lattice? 3. | a) | Consider the equation x; + x2 + x3+ x4+ Xs =21 (PTO) 6USN Where x,s are non negative integers. How many solutions are feasible if. i) There are no additional constraints on x/'s ii) x21 iii) xj > 2 fori=1,2,3,4,5 b) | Find a recurrence relation and give initial conditions for the number of bit strings of | 7 length n that do not have two consecutive 0's. How many such bit strings are there of length five? Find the number of ways four of the letters in the word ENGINE can be arranged | 7 (with repetition) by using exponential generating function, | A five digit number is to be formed from the digits 0, 1, 2, 3, 4 without repetition. | 6 Find the probability that the number formed is divisible by 4? ) | A bag contains an assortment of blue and red balls. Two balls are drawn at random 7 The probability of drawing 2 red balls is 5 times the probability of drawing 2 blue balls . The probability of drawing one ball of each color.is 6 times the probability of drawing 2 blue balls How many red and blue balls are there in the bag? The contents of 3 bags are Iwhite, 2 red, 3 green balls; 2 white, | red, | green ball; 7 4 white, 5 red, 3 green balls. Two balls are drawn from a bag chosen at random and are found to be | white and 1 green, What is the probability that the balls so drawn came from the third bag? | ©) Determine whether the following graphs are isomorphic or not | 6 = ve | b) | Let G be a connected planar simple graph with e edges and v vertices. Let r be the 7 number of regions in a planar representation of G. Then prove the Euler’s formula r=e-v+2. Show that the complete graph Kas (viz., the Kuratowski’s second graph) is anon 7 planar graph. c M4. Ys Mg