Question

Which one of the following is NOT equivalent to p↔qp \leftrightarrow q?

Choose one option
Official answer and solution
Official answer
C
From
Official GATE 2015 answer key

Solution

Compare the truth table and algebraic forms of each candidate proposition with the biconditional p↔qp \leftrightarrow q.

The biconditional p↔qp \leftrightarrow q is true when pp and qq have identical truth values (T,TT, T or F,FF, F), and false when they differ.

Analyzing each option:

  • Option A: (¬p∨q)∧(p∨¬q)≡(p→q)∧(q→p)≡p↔q(\neg p \lor q) \land (p \lor \neg q) \equiv (p \to q) \land (q \to p) \equiv p \leftrightarrow q. (Equivalent)
  • Option B: (¬p∨q)∧(q→p)≡(p→q)∧(q→p)≡p↔q(\neg p \lor q) \land (q \to p) \equiv (p \to q) \land (q \to p) \equiv p \leftrightarrow q. (Equivalent)
  • Option D: (¬p∧¬q)∨(p∧q)(\neg p \land \neg q) \lor (p \land q). This is the disjunctive normal form of p↔qp \leftrightarrow q. (Equivalent)
  • Option C: (¬p∧q)∨(p∧¬q)(\neg p \land q) \lor (p \land \neg q). This proposition is true precisely when pp and qq have opposite truth values. It represents the exclusive-OR (XOR) operation p⊕q≡¬(p↔q)p \oplus q \equiv \neg(p \leftrightarrow q).

Therefore, option C is NOT equivalent to p↔qp \leftrightarrow q.

Final answer

C

Common trap

Confusing the biconditional (XNOR) with the exclusive-OR (XOR) formula in option C.

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2015 Computer Science and Information Technology (CS) Session 1
Question
24 of 65, printed as CS Q.14
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.