Let, x1 ⊕ x2 ⊕ x3 ⊕ x4 = 0 where x1, x2, x3, x4 are Boolean variables, and ⊕ is the XOR operator. Which one of the following must always be TRUE?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2016 Set 2 · Q8
Time
Select one answerSingle correct
Solution
Official answer: C) x1 ⊕ x3 = x2 ⊕ x4
Boolean Algebra and MinimizationGiven the equation:
Using the commutative and associative properties of the XOR operation:
Now consider option (C), : Note that complementation on both inputs to an XOR function leaves the result unchanged:
Therefore:
Since , we have:
Thus, (C) is always TRUE.
Counterexample for options (A), (B), and (D): Let . The given condition is satisfied, but:
(A) (False)
(B) (False)
(D) (False)
Try the question first, then check your work.
Examiner trap
Use the property that XOR is commutative and associative, along with the identity .
This Boolean Algebra and Minimization previous year question is Q8 of the GATE CSE 2016 Set 2 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 2016 Set 2.
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.