Tyee cme st alas fa for GATE 2021 PET COMPUTER MADE EASY SCIENCE & IT India’s Best Institute for IES, GATE & PSUs Day 5 of 8 Q.101 - Q.125 (Out of 200 Questions) Discrete Mathematics SUBJECT-WISE WEIGHTAGE ANALYSIS OF GATE SYLLABUS subject rare 5 st ys) Reasoning, Aptitude &Engsh 100% Dire nope eee 120% —s Comper Newer tam tg ne ‘Theory of Computation 8.70% rat Operating Systems Gnesi goths Eneincering Mathematics Peet Diol Lgl Sennen ee Compiler Design TotalImportant Questions famane Easy for cs ram Ede lela Q.101 The number of one-one functions possible from a set having m elements to a set having m elements is (a) "C,, mt (b) © "C, (a) "Cnt Q.102 Following is a table of an incomplete binary operation “. x w Consider the following ways of filling the entries in place of X, Y, Z, W: IL X58 Y¥onZopWop I X35,YonZ>pWq IL X 5, YorZ3qWop W.X 95 YorZ3nWop The correct way of filling the entries so that in the table obtained, *” is found to be commutative will be (for example if II is correct then answer should be filled as 2) Q.103 Let G be a directed graph whose vertex set contains numbers from 1 to 1024. There is an edge from a vertex i to a vertex j iff either j = i + 1 or j = 3i. The minimum number of edges in the path from vertex 1 to vertex 100 is @) 3 (b)4 6 (a7 Q.104 Let R be a relation on the set A = {1, 2, 3}, such that R = {(1,1), (2,2), (3,3), (1,2)}. Now consider the following relations. 1. (A), 22), 83) ML {(1,1), (2,2)} ML (1,1), (2.2), (3.3), (1,2)) Which of the above correctly represent(s) the reflexive closure of R? (@) Both I and IIL (b) Only 1 (©) Only II (a) None of these Q.105 Let (G, *) be a group such that O(G) = 8, where O(G) denotes the order of the group G. Which of the following is true? (a) There exists no element a in G whose order is 6, (b) There exists an element a in G whose order is 4 (©) There exists more than one element a in G such that O(@ (d) None of these ae Day5 : Q.101t0Q.125 © Copyright:Maneeasy Page 7 ee aa Eee nefamane Easy for cs Q.106 A binary operation © on a set of integers is defined as x @ y = .2+y?+ 2xy. Which one of the following statements is true about ©? (a) Commutative but not associative (b) Both commutative and associative (©) Associative but not commutative (a) Neither commutative nor associative Q.107 Consider the following partial order relations: 1 @.s) I. (5) MIL. (2*, >) IV. (2,2) Note that Z* and Z- denote the set of positive integers and the set of negative integers respectively. How many of the above POSETs are well ordered? Q.108 The number of perfect matchings in Kjp.2, where K,, denotes the complete graph with 1 vertices is equal to. Q.109 Let S, and S, be two algebraic structures as described below: S501, 23,4 oy = Ty ty) S51, 2, 3,4 sane ME Zhe Fy a) Where +, is a binary operation defined as (a +,, 6) = (a+b) mod m. Which of the above two are groups? (a) Both S, and S, (b) Only 5, (©) Only s, (d) None of these Q.110 The number of unlabelled binary trees with 3 nodes is equal to Q.111 Let X and Y be two sets, Then (X - Y) U (X 9 Y) U (XN) is equal to (a) x (b) XUY OY (d)Xn¥ Q.112 Let f: A — Band g : B — C denote two functions. If the function gof : A C is a surjection and gis an injection, then function fis (a) Injection (b) Surjection (©) Bijection (d) None of these Q.113 Consider the following first order formulae: 1. A¥x(P(x) HL. 3x (P(x)) IIL, 3x (P(x) IV. 3x(4P(x)) Which of the above formulae are equivalent? (a) Land IIT only (b) Tand IV only (©) Hand Ill only (d) Wand IV only Q.114 The maximum number of possible edges in an undirected graph with 10 vertices and 5 components is, ae Day5 : Q.101t0Q.125 © Copyright:maneeasy Page 2 ee aa Eee neImportant Questions famane Easy for cs Q.115 Consider the following graph G: The total number of minimum cost spanning trees possible for G is equal to Q.116 Consider the following first order logic statements, where P(x) and Q(x) are predicates. 1. Vx(P(x) 4 Q(x) = VxPQX) A VxQQX) TL, VxP(x) 4 VxQ(x) = Wx(P(X) 4 Q(x) TIL, 3e(P(x) v Q(3)) = BxP(x) v 3xQ(x) IV, 3xP(x) v IxQ(x) = 3x(P(2) VQ) ‘The number of correct statements are Q.117 Given that, A(x) means “x is an alligator”, H(x) means “x is a human”, and E(x, y) means “x eats y", Which of the given choices is the best English translation for the following first order logic statement? Wx(H(x) > vylE(y.x) > A(y)))? (a) All humans eat alligators (b) Alligators eat only humans (©) Every Alligators eats humans (4) Only alligators eat humans Q.118 Consider the following statements: 1. Ifa finite group G has prime order, then G is guaranteed to be Abelian. II. A group with infinite order can never be cyclic. Which of the above statements are correct? (a) Both I and It (b) Tonly (©) only (d) None of these Q.119 In how many ways, 6 letters can be placed in 6 envelopes such that at least 4 letters go into their corresponding envelopes? (a) 16 (b) 24 (©) 32 (d) 120 ae Day5 : Q.101t0Q.125 © Copyright:Maneeasy Page3 ee aa Eee neImportant Questions famane Easy for cs Q.120 A graph G is called self complementary iff G is isomorphic to its complement. Let X be a self complementary graph. Which of the following is a viable possibility with regards to the connectivity of X and X', where X’ denotes the complement of X? (a) Both X and X’ are disconnected (b) X is connected, X’ is disconnected (©) X is disconnected, X’ is connected (d) Both X and X’ are connected Q.121 Which of the following is not a subgroup of (Z, +)? Note that the sets O and F denote the set of odd integers and even integers respectively. @ E+) (b) ©, 4) (©) (Bklke Z}, 4) (a) 4k] ke Z), 4) Q.122 Consider the following POSETs: 1. ({1, 2, 5,7, 10, 14, 35, 70}, <) Tl. ({1, 2,3, 6, 14, 21, 42}, /) MIL ((1, 2, 3, 6, 11, 22, 33, 66}, /) Which of the above POSETs are isomorphic to (P (5), c), where 5 = (a, b, cJ? (a) Land 1t (b) Mand It (QL Wand (4) Ill only Q.123 Consider the following graphs G,, G, and Gy, S & G ‘The number of graphs which are planar Q.124 The number of ways in which we can place 3 white pawns and 3 black pawns on a3 x 3 Chessboard is equal to roa er sit Q.125 You have discovered an old paper on graph theory that discusses the viscosity of a graph (which for all you know, is something completely made up by the author). A theorem in the paper claims that “if a graph satisfies condition (V), then the graph is viscous.” Which of the following are equivalent ways of stating this claim? (a) A graph is viscous only if it satisfies condition (V). (b) A graph is viscous if it satisfies condition (V).. (0) For a graph to be viscous, it is necessary that it satisfies condition (V). (d) For a graph to be viscous, it is sufficient for it to satisfy condition (V). 9000 rere near Day5 : Q.101toQ.125 © Copright-aveeasy Page ee aa Eee neImportant Questions faMANE EBSY for (ENTETPA | Cs 101. (4) ‘The number of one-one functions from 1 element set to m element set = "P, which is same as™C, 10 > 11 + 33 + 99 + 100 And the number of edges in this path = 7 Hence the answer is option (4). 104. (0) ‘The common mistake here is to pick both I and III as the answer, which is wrong. Why? Because first of all in order for a relation T (say) to be reflexive closure of a relation R, then firstly T must be a superset of R, and only then we think about reflexivity. So T is actually a subset of R and thus cannot be the reflexive closure of R. II does not contain (3,3) and therefore is not reflexive. So the correct answer is choice (¢) 105. (a) ‘Theorem: If a is an element of G, then O(a) must divide O(G). Therefore (a) is true, as O(@) = 6 and 6 doesn’t divide 8. However the converse of the above theorem need not be true, therefore (b) is false. (©) says there are at least two elements in G with order 1, however this violates the fact that every group can have only one identity element. So () is also wrong. So the appropriate choice is (a). 106. (a) 1, Check for commutative: on = vox 2+ Pt dry = Pte + yx Since LHS = RHS So © is commutative. 2. Check for associative: oy) ve. (8+ y+ 2y) Oz = xo (y+ 2+ 2y2) abe ye aie Dey? + dey + iy + 22+ Date + Dues + dye abt yt att dy2els 2yPeP + y's + hyd + Dey? + Dea? + dye So © is not associative. ae Day5 : Q.101t0Q.125 © Copyright:maneeasy Pages ee aa Eee neImportant Questions famane Easy for cs 107. (2) Land IV are well ordered, as both are not only discrete, but also have a least element as well I and III don't have least element, therefore are not well ordered. 108. (0) When 1 is odd, K, does not have any perfect matching. So the number of perfect matchings will be equal to 0. 109. (0) S, is a well known standard group. However S, is not a monoid. This is because of this - the only candidate to be an identity element is 0, but if 0 was to be an identity element, then (0+,,_ 1 m~1) should be equal to m ~ 1, but here it is equal to 0. Therefore S, is not a group. 110. 6) amc, (1) Number of unlabelled binary trees with n nodes is equal to Putting » 111. (b) First let's simplify the expression a bit &-YuMKayu Kay) (X-Y) U(XAY)u (¥AX) is same as, (X- Y) U(X AY) U(Y-X) , we get 5 as the answer. Therefore, according to Venn diagram, we can see that K-YNUKAYyuU-xX) = xXvY Hence option (b) is correct. 112. (b) f:A>B g:B— Cis injection: Vbe B, g(b)=c distinct images in C. gof: A Cis surjection 8 F(a) = sf) Baca fab So, f: A > B is surjection. ¢ 8) ae Day5 : Q.101t0Q.125 © Copyriht:waneeasy Page 6 ee aa Eee nefamane Easy for cs 113. (b) Land IV are equivalent. If P(x) is not true for all x, it means that, then there's at least one x such that P(2) is false. 114. (5) . ; (n=R)n—k+1) Max number of edges in a graph with m vertices, k components = "5" (10-5)(10-5+1) _ 45 10 vertices, 5 components = 2 115. (16) If seen carefully, G is actually K,, Since every edge has same cost, G can be thought of as an unweighted graph. Therefore number of spanning trees (K,) = n"-* Therefore number of spanning trees (K,) = 4*-? = 16 116. (4) Since Vis fully distributive over 4, I and Il are true. Similarly 3 is fully distributive over v, which makes III and IV true as well. ‘Therefore all are true and 4 is the answer. 17. (a) Option (A) is the most appropriate translation for the above predicate logic statement. 118. (b) Only Tis true. IT is false, because it uses the phrase ‘never’ ~ and we can easily disprove it, as (Z, +) is a well known cyclic group with generators 1 and ~1 respectively. Lis true because every prime order group is cyclic and we also know that every cyclic group is Abelian and so the statement | is also correct. 119. (a) At least 4 should go to their respective envelopes = (Exactly 4 letters are placed in their correct envelopes and 2 are misplaced) + (Exactly 5 letters are placed in their correct envelopes and 1 is misplaced) + (All 6 are placed in correct envelopes) = 8,1 +0 (exactly 5 is not possible) + 1 (all letters go to their respective envelope) = 16 120. (d) Firstly we know that if two graphs G, and G, are isomorphic, then either both of them will be connected, or both will be disconnected, and it’s easy to argue that a situation like option (b) and (c) can never happen as they are isomorphic. Now the option (a) violates the theorem “at least one of G and G’ must be connected” so (a) is also ruled out. So the only viable possibility is option (4). Note that a question based on this concept can probably come in GATE, and they can frame it as “Every self complementary graph is connected” or “Some self complementary graphs are disconnected”. So be prepared to answer such questions. So the conclusion is “Every self complementary graph is connected”. So option (d) is the correct answer. ae Day5 : Q.101t0Q.125 © Copyrigt:waneeasy Page 7 ee aa Eee nefamane Easy for cs 121. (b) O is not a subgroup of Z, as odd + odd = even, which does not belong to the set O. ‘Therefore it is not closed. So (b) is the answer. 12. (a) Although I and II represent Dyy and Dy Il is not Dj», because the divisor 7 is missing. So there's no way for II to be isomorphic to [P((a,b, cl), <], as it needs to have 8 divisors but right now it has only 7 Now I won't be isomorphic, as even though I looks like Dp, it is actually on the $ relation, resulting in a chain, which won't be a Boolean algebra, TI is Dgy a well known Boolean algebra and has 8 vertices is its Hasse diagram and will be isomorphic to [P({a, b, cl), Cl. 123. (1) Only G, is planar. G, is the well known ‘n cube’, now let's see why G, and G, are nonplanar. G, is nonplanar because it is homomorphic to K,, 5 Apply FES (fuse edges in series) ‘on circled edges = ‘Therefore G, is nonplanar. i _AE-BF_ Similarly we can apply FES on G, as well (fuse (sor ABy’” (io get BO) B B A = © pA ~ E D z D ‘Therefore G; is also nonplanar, as it is homeomorphic to K, as shown above. Gy is planar (n-cube) here n = 3, for which we have a planar embedding. ae Day5 : Q.101t0Q.125 © Copyright:maneeasy PageS ee aa Eee neImportant Questions Eee Jor CENELFA | CS Therefore only G, is planar. Number of planar graph = 1 124. (1680) ‘The required number of ways = °C,*5C, * °C, Solving this, we get 1680 as the answer. 125. (b, d) (a) Equivalent to the converse. (b) Equivalent to the original theorem. (©) Equivalent to the converse. (d) Equivalent to the original theorem. 9000 ae Day5 : Q.101t0Q.125 © Copyright:maneeasy Page oe aon