GateAI
Boolean Algebra and Minimization

GATE CSE 2018 · Q4

MCQ1 markEasy

Time

Let ⊕\oplus and ⊙\odot denote the Exclusive OR and Exclusive NOR operations, respectively. Which one of the following is NOT CORRECT?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: D) (P ⊕ P) ⊕ Q = (P P) Q

Boolean Algebra and Minimization

Let us evaluate each option using Boolean algebra properties:

  • Option A: P⊕Q‾=P⊙Q\overline{P \oplus Q} = P \odot Q. This is the standard definition of the XNOR operation (the complement of XOR). This is correct.

  • Option B: Pˉ⊕Q=PˉQˉ+Pˉ‾Q=PˉQˉ+PQ=P⊙Q\bar{P} \oplus Q = \bar{P}\bar{Q} + \overline{\bar{P}}Q = \bar{P}\bar{Q} + PQ = P \odot Q. This is correct.

  • Option C: Pˉ⊕Qˉ=PˉQˉ‾+Pˉ‾Qˉ=PˉQ+PQˉ=P⊕Q\bar{P} \oplus \bar{Q} = \bar{P}\overline{\bar{Q}} + \overline{\bar{P}}\bar{Q} = \bar{P}Q + P\bar{Q} = P \oplus Q. This is correct.

  • Option D:

    • Left-hand side (LHS): (P⊕Pˉ)⊕Q=1⊕Q=Qˉ(P \oplus \bar{P}) \oplus Q = 1 \oplus Q = \bar{Q}

    • Right-hand side (RHS): (P⊙Pˉ)⊙Qˉ=0⊙Qˉ=0⊕Qˉ‾=Qˉ‾=Q(P \odot \bar{P}) \odot \bar{Q} = 0 \odot \bar{Q} = \overline{0 \oplus \bar{Q}} = \overline{\bar{Q}} = Q

    • Since Qˉ≠Q\bar{Q} \neq Q in general, LHS ≠\neq RHS.

Therefore, statement D is NOT CORRECT.

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 Boolean Algebra and Minimization previous year question is Q4 of the GATE CSE 2018 paper. Find more GATE CSE PYQs on Boolean Algebra and Minimization in Digital Logic, 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 Boolean Algebra and Minimization 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.

Boolean Algebra and Minimization in GATE CSE

Boolean Algebra and Minimization has 36 GATE CSE PYQs across 23 papers from 2011 to 2026. 13 of them are 1-mark MCQs like this one, and it is the only one in GATE CSE 2018.

How GATE tests Boolean Algebra and Minimization

More from GATE CSE 2018

Share this solution

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

GateAI solution cardGATE CSE 2018 · Q4 · MCQ

Let ⊕ and denote the Exclusive OR and Exclusive NOR operations, respectively. Which one of the following is NOT 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.