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
GATE CSE 2018 · Q4
Time
Select one answerSingle correct
Solution
Official answer: D) (P ⊕ P) ⊕ Q = (P P) Q
Boolean Algebra and MinimizationLet us evaluate each option using Boolean algebra properties:
Option A: . This is the standard definition of the XNOR operation (the complement of XOR). This is correct.
Option B: . This is correct.
Option C: . This is correct.
Option D:
Left-hand side (LHS):
Right-hand side (RHS):
Since in general, LHS RHS.
Therefore, statement D is NOT CORRECT.
Try the question first, then check your work.
Examiner trap
Recall that and . Evaluate both sides of each equation.
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
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.
An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.
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 MinimizationIndependent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.