GATE DM PYQ [2010-2025]

Last Updated :
Discuss
Comments

Question 1

Suppose the predicate F(x, y, t) is used to represent the statement that person x can fool person y at time t. Which one of the statements below expresses best the

meaning of the formula ∀x∃y∃t(¬F(x, y,t))?[ MCQ || GATE 2010 || 2 Marks ]

  • Everyone can fool some person at some time


  • No one can fool everyone all the time

  • Everyone cannot fool some person all the time

  • No one can fool some person at some time

Question 2

What is the possible number of reflexive relations on a set of 5 elements? [ MCQ || GATE 2010 || 1 Marks ]

  • 210

  • 215

  • 220

  • 225

Question 3

Consider the set S = {1, ω, ω 2 }, where ω and ω 2  are cube roots of unity. If * denotes the multiplication operation, the structure (S, *) forms. [ MCQ || GATE 2010 || 1 Marks ]


  • A group

  • A ring

  • An integral domain

  • A field

Question 4

K4 and Q3 are graphs with the following structures.

Screenshot-2025-10-13-195101
.

Which one of the following statements is TRUE in relation to these graphs? [ MCQ || GATE 2011 || 1 Marks ]

  • K4 is planar while Q3 is not

  • Both K4 and Q3 are planar

  • Q3 is planar while K4 is not

  • Neither K4 nor Q3 is planar

Question 5

Which one of the following options is CORRECT given three positive integers x,y and z, and a predicate

P(x) = ¬(x=1) ∧ ∀y(∃z(x=y*z) ⇒ (y=x) ∨ (y=1) [ MCQ || GATE 2011 || 2 Marks ]

  • P(x) being true means that x is a prime number

  • P(x) being true means that x is a number other than 1

  • P(x) is always true irrespective of the value of x

  • P(x) being true means that x has exactly two factors other than 1 and x

Question 6

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to ____. [ MCQ || GATE 2012 || 1 Marks ]


  • 3

  • 4

  • 5

  • 6

Question 7

Which of the following graphs is isomorphic

Screenshot-2025-04-22-170748

to [ MCQ || GATE 2012 || 2 Marks ]

  • Screenshot-2025-04-22-170836


  • Screenshot-2025-04-22-170920


  • Screenshot-2025-04-22-170956


  • Screenshot-2025-04-22-171031


Question 8

Consider the following logical inferences.

I1 : If it rains then the cricket match will not be played. The cricket match was played.

Inference: There was no rain.

I2 : If it rains then the cricket match will not be played. It did not rain.

Inference: The cricket match was played.

Which of the following is TRUE? [ MCQ || GATE 2012 || 1 Marks ]

  • Both I1 and I2 are correct inferences

  • I1 is correct but I2 is not a correct inference

  • I1 is not correct but I2 is a correct inference

  • Both I1 and I2 are not correct inferences.

Question 9

What is the correct translation of the following statement into mathematical logic?

“Some real numbers are rational” [ MCQ || GATE 2012 || 1 Marks ]


  • ∃x (real(x) ∨ rational(x))

  • ∀x (real(x) → rational(x))

  • ∃x (real(x) ∧ rational(x))

  • ∃x (rational(x) → real(x))

Question 10

How many onto (or surjective) functions are there from an n-element (n ≥ 2) set to a 2-element set? [ MCQ || GATE 2012 || 2 Marks ]

  • 2n

  • 2n -1

  • 2n -2

  • 2(2n -2)

There are 119 questions to complete.

Take a part in the ongoing discussion