= | Total No. of Pages: [3 1€8110 MCA I - Sem. (Main & Back) Exam., 2022 MCA - 101 Mathematical Foundations in Computer Science 1C€8110 Time: 3 Hours Maximum Marks: 70 Min, Passing Marks: 28 Instructions to Candidates: Attempt all ten questions from Part A. Alll five questions from Part B and three questions out of five questions from Part C. Schematic diagrams must be shown wherever necessary. Any data you feel missing may suitably be assumed and stated clearly. Units of quantities used ‘calculated must be stated clearly. Use of following supporting material is permitted during examination. (Mentioned in form No. 205) 1, NIL. 2. NIL PART-A ‘Answer should be given up to 25 words only) [10x2=20] All questions are c sory Q.1. Find the rank of the matrix — (2) -1 2 3 -2) 2-5 1 2 3-8 5 2 5 -12 -1 6 Q2_A password consists of two alphabets of English followed by 2 digits. How many Passwords exists when upper case and lower case letters are treated 2] (equivalent (ii) different [1¢81 10] Page 1 of 3 [780]@3__A bowl contains seven blue balls and three red balls, Two balls are drawn successively at random and without replacement. What is the probability that the first draw results in aed ball and second draw results in a blue ball? (2) Q4_ Find the standard deviation for the following data — 2) 3,6, 11, 12, 18 Q5_ Define Tautology with example. 21 Q6 Obtain CNF of pa(p-+q) (without truth table). [2] Q7 What is underflow and overflow conditions in floating point’s addition and subtraction? (2] Q8 Evaluate ~ (2) “ @) 0.6756B4 + 0.764456 (ii) 0.4546E-4 - 0.8524B-5 Q.9 Find the adjacency matrix A= [aj] of the followihg graph - Q] vy vs Vy vy Q.10A planar graph has 30 vertices each of degree 3: In how many regions can this graph be partitioned? i (2) PART-B (Answer should be given up to 100 words only) [8x4=20] All questions are compulsory Q.1 Show that the mapping f : A>A, defined by f(x) = 2x + | is a bijection. Find f'. {4] “Q2_ In answering a question on a multiple choice test, a student either knows the answer or guesses. Let > be the probability that he knows the answer. Assuming that she student * who guesses atthe answer willbe comrect witha probability 2 . What is the probability that he know the answer given that he answered it correctly? (4) [18110] Page 2 of 3 (780)Q3 Translate cach of these statements into logical expressions using predicates, quantifiers and logical connectives ~ (4) (a) No one is perfect (b) Not everyone is perfect (c) All your friends are perfect (d) One of your friends is perfect » _(e) Everyone of your friend and perfect (f) Not everybody is your friend or someone is not perfect Q4 Ifus se and errors in x, y, z be 0.001, compute the relative maximum error. [4] Q.5. Let G be a connected simple planar graph with ny 2 3 vertices and ne edges, then- [4] te S 3ny-6. PART-C Attempt any three questions [3x10=30] QL (a) Define closure of relation. . (2) (b) LetA=(1,2,3.4} and R={(1, 2), (2, 3), (3, 4)} be a relation in A. Find its reflexive closure, symmetric closure and transitive closure. {8} Q2. Find the mean, variance and standard deviation for the following data - (10) Classes | 0-30] 30-60 | 60-90 | 90-120 | 120-150] 150-180] 180-210. "Frequencies | 2 3 3 0 | 3 5 2 | (4 (a) Evaluate the sum § = ¥3 + V5 + V7 to 4 significant digits and find its absolute and relative errors. (5) (b) Write a short note on errors in numerical computation. {5} Q.4 Obtain the principal conjunctive normal form of P = p ~ ((p + q) A~(~q V~ p)) and hence. find the principal disjunctive normal form of P. hitps://www.rtuonline.com [10] QS Wnite short notes on - (Any two) [5+5=10] (i) Simple graph, multi graph and pseudo graph (in) Complete graph and bipartite graph (i) Eulerian and Hamiltonian graph av [1¢8110] Page 3 of 3 [780]