GATE CS 2026 (Afternoon) — Question 11

Discrete MathematicsPropositional and First-Order Quantifier LogicMCQ1 mark · −1/3 if wrongMedium

For two different persons \( x \) and \( y \), the predicate \( M(x, y) \) denotes that \( x \) knows \( y \). Consider the following statement. There is a person who does not know anyone else, but that person is known by everyone else. Which one of the following expressions represents the above statement?
  1. A
    \( (\exists y) (\forall x) ((x \neq y) \rightarrow (M(x, y) \land \neg M(y, x))) \)
  2. B
    \( (\forall y) (\exists x) ((x \neq y) \rightarrow (M(x, y) \land \neg M(y, x))) \)
  3. C
    \( (\exists y) (\exists x) ((x \neq y) \rightarrow (M(x, y) \land \neg M(y, x))) \)
  4. D
    \( (\forall y) (\forall x) ((x \neq y) \rightarrow (M(x, y) \land \neg M(y, x))) \)
Practise the full 2026-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Propositional and First-Order Quantifier LogicTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group