GateAI
Propositional and First-Order Logic

GATE CSE 2014 Set 1 · Q53

MCQ2 marksEasy

Time

Which one of the following propositional logic formulas is TRUE when exactly two of pp, qq, and rr are TRUE\text{TRUE}?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: B) ( (p ↔ q) ∧ r) ∨ (p ∧ q ∧ r)

Propositional and First-Order Logic

There are three truth assignments where exactly two of p,q,rp, q, r are TRUE:

  1. p=T,q=T,r=Fp = T, q = T, r = F

  2. p=T,q=F,r=Tp = T, q = F, r = T

  3. p=F,q=T,r=Tp = F, q = T, r = T

Let us evaluate each component of Option B: (∼(p↔q)∧r)∨(p∧q∧∼r)(\sim(p \leftrightarrow q) \land r) \lor (p \land q \land \sim r):

  • Case 1 (p=T,q=T,r=Fp=T, q=T, r=F): p∧q∧∼r=T∧T∧T=Tp \land q \land \sim r = T \land T \land T = T. Thus, the formula evaluates to TT.

  • Case 2 (p=T,q=F,r=Tp=T, q=F, r=T): p↔qp \leftrightarrow q is FF, so ∼(p↔q)\sim(p \leftrightarrow q) is TT. Then ∼(p↔q)∧r=T∧T=T\sim(p \leftrightarrow q) \land r = T \land T = T. Thus, the formula evaluates to TT.

  • Case 3 (p=F,q=T,r=Tp=F, q=T, r=T): p↔qp \leftrightarrow q is FF, so ∼(p↔q)\sim(p \leftrightarrow q) is TT. Then ∼(p↔q)∧r=T∧T=T\sim(p \leftrightarrow q) \land r = T \land T = T. Thus, the formula evaluates to TT.

In all cases where exactly two variables are TRUE, the expression in (B) evaluates to TRUE.

  • For (A): when p=T,q=F,r=Tp=T, q=F, r=T, (p↔q)∧r=F∧T=F(p \leftrightarrow q) \land r = F \land T = F and p∧q∧∼r=Fp \land q \land \sim r = F, so the overall formula is FALSE.

  • For (C): when p=T,q=F,r=Tp=T, q=F, r=T, (p→q)∧r=F∧T=F(p \to q) \land r = F \land T = F and p∧q∧∼r=Fp \land q \land \sim r = F, so it is FALSE.

  • For (D): the conjunction ∧\land between two mutually exclusive cases is always FALSE.

Hence, B is the correct option.

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

This Propositional and First-Order Logic previous year question is Q53 of the GATE CSE 2014 Set 1 paper. Find more GATE CSE PYQs on Propositional and First-Order Logic in Engineering Mathematics, or browse all GATE CSE PYQs.

Free diagnostic

Where do you stand for GATE?

Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Propositional and First-Order Logic PYQs now with no account.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

Propositional and First-Order Logic in GATE CSE

Propositional and First-Order Logic has 18 GATE CSE PYQs across 16 papers from 2011 to 2026. 7 of them are 2-mark MCQs like this one, and it is the only one in GATE CSE 2014 Set 1.

How GATE tests Propositional and First-Order Logic

More from GATE CSE 2014 Set 1

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2014 Set 1 · Q53 · MCQ

Which one of the following propositional logic formulas is TRUE when exactly two of p, q, and r are TRUE?

Topic-wise GATE CS PYQs with verified steps

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.