Solving GATE Previous Year’s Questions (PYQs) not only clears the concepts but also helps to gain flexibility, speed, accuracy, and understanding of the level of questions generally asked in the GATE exam, and that eventually helps you to gain good marks in the examination. Previous Year Questions help a candidate practice and revise for GATE, which helps crack GATE with a good score.
Discrete Mathematics Previous Year GATE Questions help in analyzing the question pattern of a subject and marking scheme as well as helps in time management which overall increases the score in the GATE exam. With regular practice of PYQs, candidates can easily crack GATE with a good GATE Score.
Before 2006, questions asked in GATE were mainly theoretical, but in recent years, the questions asked were multiple-choice questions with a single correct option or multiple correct options. We are looking to provide the multiple-choice questions that are asked in GATE.
Discrete Mathematics GATE Previous Year Questions
In this article, we are mainly focusing on the Discrete Mathematics GATE Questions that are asked in Previous Years with their solutions, and where an explanation is required, we have also provided the reason.
In Discrete Mathematics, we will deal with the following concepts. We have also provided GATE Previous Year’s Questions on these topics. Here is the list of those topics along with their links.
Also, here we are going to discuss some basic PYQs related to Discrete Mathematics.
1. Which of the properties hold for the adjacency matrix A of a simple undirected unweighted graph having n vertices? [GATE CSE 2022]
(A) The diagonal entries of A2 are the degrees of the vertices of the graph
(B) If the graph is connected, none of the entries of An-1 + In can be zero
(C) If the sum of all the elements of A is at most 2(n – 1), then the graph must be acyclic
(D) If there is at least a 1 in each of A’s rows and columns, then the graph must be connected
Solution: Correct answer is (A)
For more, refer to GATE | CS 2022 | Question 52.
2. Consider the following statements:
P: Good mobile phones are not cheap
Q: Cheap mobile phones are not good
L: P implies Q
M: Q implies P
N: P is equivalent to Q
Which of the following about L, M, and N is Correct? [GATE CSE 2014]
(A) Only L is TRUE
(B) Only M is TRUE
(C) Only N is TRUE
(D) L, M, and N are TRUE
Solution: Correct answer is (D)
For more, refer to GATE | GATE-CS-2014-(Set-3) | Question 65.
3. Which one of the following is NOT necessarily a property of a Group? [GATE CSE 2009]
(C) Existence of inverse for every element
(D) Existence of identity
Solution: Correct answer is (A)
For more, refer to GATE | GATE-CS-2009 | Question 1.
4. What is the size of the smallest MIS (Maximal Independent Set) of a chain of nine nodes? [GATE CSE 2008]
Solution: Correct answer is (C)
For more, refer to GATE | Gate IT 2008 | Question 4.
5. Let S be a set6 of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S is [GATE CSE 2007]
(A) n and n
(B) n2 and n
(C) n2 and 0
(D) n and 1
Solution: Correct answer is (B)
For more, refer to GATE | GATE-CS-2007 | Question 2.
GATE CSE Previous Year Question Papers
These previous year’s questions help you in understanding the question patterns followed by GATE that directly help a candidate in scoring good marks in GATE. Below are the mentioned links of year-wise GATE Previous Question Papers.
Level Up Your GATE Prep!
Embark on a transformative journey towards GATE success by choosing Data Science & AI
as your second paper choice with our specialized course. If you find yourself lost in the vast landscape of the GATE syllabus, our program is the compass you need.