woo ouruony MMA: http://www .rtuonline.com Roll No. Total N 4E4161 B, Tech, IV-Sem., (Back) Exam., Oct,-Nov. - 2020 Computer Science & Engineering 4CS2A Discrete Mathematical Structures CS, IT {| Maximum Marks: Min, Passing Mar} 0 of Pages: [3] | 454161 Time: 2 Hours Instructions to Candidates: , unit. Attempt three questions, selecting one question each from any ue rever All Questions carry equal marks. Schematic diagrams must be shown n necessary. Any data you feel missing suitably be assumed and stated clear: Units of quantities used/ calculated must be stated clearly. ‘nati Use of following supporting material is permitted during examina jon. (Mentioned in form No.205) LLNIL 2. NL ne — one onto QL (a) Define countable set. If f(x) = 3x + 4, then prove that f(x) is o [) function for N. (b) Define the following set — 8] (i) Power set Gi) Cardinality of set (iii) Composition of function (iv) Absolute value OR Qit (a) State and prove Pigeonhole principle. [8] {() Prove that (AUB) =A) + n(B)~ (ANB) (8) Se [484161] Page 1 of 3 [1680) http://www.rtuonline.com twooauljuon aMany/daywoo ouruon MMA dnt http://www .rtuonline.com NIT- I Q2 (@) Define Equivalence relation with suitable example. (b) Discuss Adjacency Matrix of Relation. OR Q2 (@) Define Transitive closure with example. (b) Define the Warshall’s Algorithm with proper example. UNIT- IT Q3_{ay Prove by principle of mathematical induction — P4243? +0 -[2aenf oe - (©) Explain Bubble and Selection sorting with suitable example, OR Q3 (a) Show that 3" > n? for any positive integer n > 1 (6) Write short notes on ~ (i) Direct proof Gi) The division Algorithm (iii) Indirect Proof (iv) Loop Invariant UNI fs Q4 (a) Write short notes on ~ (i) Degree of vertex in a Graph (ii) Cycle and Wheel in a Graph (iii) Path and Circuit (iv) Hamiltonian Graphs (b) Discuss Kruskal’s Algorithm with examples, [484161] Page 2 of 3 http://www.rtuonline.com (8) (8) (8) [8] (8) (8) {8} (8) [8] 18] {1680} woo auljuon aMay/:daywoo ouruon MMA dnt http://www .rtuonline.com OR Q.4 (a) Define Isomorphie Graphs with examples. (b) Explain the Minimal Spanning Tree with suitable example. UNIT- V Q.5 (a) Define Logical Equivalences. (b) Define Quantifiers. (c) Tautology (d) Proposition OR Q.5 (a) Find a formula in DNF and also one in CNF equivalent to: (po qgaqrn)vi~pragron (b) Show that (p aq) > (Pv q) is a Tautology. http:/www.rtuonline.com Whatsapp @ 9300930012 Send your old paper & get 10/- wae qua dag Hs ate 10 waa as, Paytm or Google Pay & http://www.rtuonline.com (8) a) a) 4) 4 {4 18} {8} woo auljuon aMay/:daywoo ouruony MMA: http://www .rtuonline.com 4 | | | 4E1213 | N | B. Tech. IV-Sem. (Back) Exam., Oct.-Nov. - 2020 | | Computer Science & Engineering | i o-* 4CS2-01 Discrete Mathematics Structure | CS, IT t = J Time: 2 Hours Maximum Marks: 82 Min, Passing Marks: 29 Instructions to Candidates: Attempt all ten questions from Part A, four questions out of seven questions from Part B and two questions out of five 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 compulsory QL What do you mean by recursive definition of a set? 2. Define Floor and Ceiling functions with example. Q3 Let A = (1, 2. 3, 4} and R be an equivalence relation on A which is defined as R= [Ch D. (1, 2) (2 1), 2. 2). B, He 4, 3) (3, 3), (4, 4)}. Find AR (Quotient set of A B by R). 101 _fo 01 Qt Leas [5 1 jjanaB= [; 0 1 Find AVB and AB {4E1213] Page 1 of 4 (2240) http://www.rtuonline.com twooauljuon aMany/daywoo ouruon MMA dnt http://www .rtuonline.com Q5 Q6 What is a Partial Correctness of a Program? Q7 Prove that if nis an integer and n + 3 is odd, hen mis EVER A graph has degree sequence 1, 1. 2,2, 2,2, 4. pind the number of edges of this graph and draw the graph. Q-8 Suppose that a connected planar graph has 30 edges and its planar representation divides the plane into 20 regions. How many vertices does this graph have? Q.9 Define Converse, Contrapositive and Inverse. Q.10 What is Disjunctive Syllogisms? PAR’ B (Analvtical/Problem solving questions} [4x8=32] Attempt any four questions Q.1 Among integers 1 to 1000, ‘ (a) How many of them are not divisible by 3 nor by 5 nor by 7? (®) How many not divisible by 5 or 7 but dit ‘ible by 3? Q2 Let A =Z, the set of integers relation R defined in A by aRb as “a is congruent to b 2 mod 2”. Prove that R is an equivalence relation. http://Avww.rtuonline.com Q3_ Prove that for all integers, 3"> n?, Q4 Find the domain and range of f(x) = ss. Q5 Prove that a simple graph with n vertices and k components can have at most Certain) edges, Q6 Determine the minimal spanning tree in the following graph by using Kruskal’s algorithm {451213} Page 2 of 4 (2240) http://www.rtuonline.com woo auljuon aMay/:daywoo ouruony MMA: http://www .rtuonline.com Q7 Obtain the principal conjunctive Normal form of P = p > ((p—sq) » ~ (-qv~p)) and hence find the principal disjunctive normal form of P. PART-C (Descriptive/AnalyticalProblem Solving/Design Questions) _[2x15=30] Attempt any two questions Q.1 (a) Explain bubble and selection sort (b) Sort the list 29, 10, 14, 37, 13, 25 using the selection sort, Q.2 (a) State and prove Principle of Inclusion and Exclusion. (b) If (n + 1) integers are selected from the set (1, 2,......, 2m}, then show that one of them divides another integer that has been selected. Q3 (a) By using Warshall’s algorithms, obtain the transitive closure of the relation R shown in the following figure: (b) Show that (Z*, divisibility) is 4 poset. Q4 (a) Let G be a connected planar graph with ny vertices, ne edges and ny faces. Then prove that ny ~ ne + r= (b) Find the number of paths of length 3 between two vertices of Ks. (981213) Page 3 of 4 {2240} http://www.rtuonline.com twooauljuon aMany/daywoo ouruon MMA dnt http://www .rtuonline.com QS (a) Write an English sentence corresponding yo each of M following: (x P(x) (i) Ax Qry iii) Vx ay Rix, y) (iv) ax Vy ROY? W) Vx QQ) (wi) FyCQy) (vil) ~ (x PEO) (ili) ~ (Vx QU) Where P(x): x is even, Q(x): x is a prime number, R(x, y): X + y is even, x,y € I (set of integers). ft) Examine the validity of the following argument. “If prices are higher then wages are high, Prices are high ot there are price controls, If there are price controls then there is not an inflation. There is an inflation therefore wages are high”. http:/‘www.rtuonline.com Whatsapp @ 9300930012 Send your old paper & get 10/- wad que wad sa atte 10 wae urd, Paytm or Google Pay & (461213) [2240] http://www.rtuonline.com woo auljuon aMay/:dayhttp://www.rtuonline.com ee Roll No, . Total No of Pages: [a 2 4E1213 nN B. Tech. IV - Sem. (Main) Exam., May - 2019 g BSC Computer Sc. & Engg. * 4CS2 - 01 Discrete Mathematics Structure cs, IT Time: 3 Hours Maximum Marks: 120 Instructions to Candidates: Attempt all ten questions from Part A, five questions out of seven questions from Part B and four questions out of five 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) 2. NIL. PART-A (Answer should be given up to 25 words only) [10x2=20] 1, NIL All questions are compulsory, Qu Prove that for any two sets A and B: A (AB) =A-B Q2 Give an example of a partially ordered set which is not a lattice. Q.3 Show that the multiplicative group G = {1, -1, i,—i} is cyclic. Find its generators. Q4 Define finite state Machines. Q.5 Find the minimum number of students in a School to be sure that 5 of them are born in the same month. i ig an even integer. .6 Prove that o2 is an even integer, then ct is an even InIEEs .7 Find the generating function for the sequenc? 11, 1,0,0,102,1, 21213) Page 1 of # ‘ [5520] http:/Awww.ttuonline.com