GateAI
Propositional and First-Order Logic

GATE CSE 2021 Set 1 · Q7

MCQ1 markEasy

Time

Let pp and qq be two propositions. Consider the following two formulae in propositional logic. S1:(egp∧(p∨q))→qS_1 : \quad ( eg p \land (p \lor q)) \rightarrow q S2:q→(egp∧(p∨q))S_2 : \quad q \rightarrow ( eg p \land (p \lor q)) Which one of the following choices is correct?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: B) S1 is a tautology but S2 is not a tautology.

Propositional and First-Order Logic

First, simplify the antecedent/consequent expression egp∧(p∨q) eg p \land (p \lor q) using the distributive law: egp∧(p∨q)≡(egp∧p)∨(egp∧q)≡False∨(egp∧q)≡egp∧q eg p \land (p \lor q) \equiv ( eg p \land p) \lor ( eg p \land q) \equiv \text{False} \lor ( eg p \land q) \equiv eg p \land q

Now, evaluate statement S1S_1: S1:(egp∧q)→qS_1 : ( eg p \land q) \rightarrow q ≡eg(egp∧q)∨q\equiv eg ( eg p \land q) \lor q ≡(p∨egq)∨q\equiv (p \lor eg q) \lor q ≡p∨(egq∨q)\equiv p \lor ( eg q \lor q)

≡p∨True≡True\equiv p \lor \text{True} \equiv \text{True}

Therefore, S1S_1 is a tautology.

Next, evaluate statement S2S_2: S2:q→(egp∧q)S_2 : q \rightarrow ( eg p \land q) Consider the truth assignment where p=Truep = \text{True} and q=Trueq = \text{True}:

  • Left-hand side: q=Trueq = \text{True}

  • Right-hand side: $

eg p \land q = False\text{False} \land True\text{True} = False\text{False}$

  • Implication: True→False≡False\text{True} \rightarrow \text{False} \equiv \text{False}

Since S2S_2 evaluates to false when both pp and qq are true, S2S_2 is not a tautology.

Thus, S1S_1 is a tautology but S2S_2 is not a tautology, which corresponds to option (B).

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 Q7 of the GATE CSE 2021 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. 6 of them are 1-mark MCQs like this one, and it is the only one in GATE CSE 2021 Set 1.

How GATE tests Propositional and First-Order Logic

More from GATE CSE 2021 Set 1

Share this solution

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

GateAI solution cardGATE CSE 2021 Set 1 · Q7 · MCQ

Let p and q be two propositions. Consider the following two formulae in propositional logic. S1 : ( eg p ∧ (p ∨ q)) → q S2 : q → ( eg p ∧ (p ∨ q)) Which one of the following choices is correct?

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.