GateAI
Boolean Algebra and Minimization

GATE CSE 2016 Set 2 · Q8

MCQ1 markMedium

Time

Let, x1⊕x2⊕x3⊕x4=0x_1 \oplus x_2 \oplus x_3 \oplus x_4 = 0 where x1,x2,x3,x4x_1, x_2, x_3, x_4 are Boolean variables, and ⊕\oplus is the XOR operator. Which one of the following must always be TRUE?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: C) x1 ⊕ x3 = x2 ⊕ x4

Boolean Algebra and Minimization

Given the equation:

x1⊕x2⊕x3⊕x4=0x_1 \oplus x_2 \oplus x_3 \oplus x_4 = 0

Using the commutative and associative properties of the XOR operation:

(x1⊕x3)⊕(x2⊕x4)=0  ⟹  x1⊕x3=x2⊕x4(x_1 \oplus x_3) \oplus (x_2 \oplus x_4) = 0 \implies x_1 \oplus x_3 = x_2 \oplus x_4

Now consider option (C), xˉ1⊕xˉ3=xˉ2⊕xˉ4\bar{x}_1 \oplus \bar{x}_3 = \bar{x}_2 \oplus \bar{x}_4: Note that complementation on both inputs to an XOR function leaves the result unchanged:

aˉ⊕bˉ=(a⊕1)⊕(b⊕1)=a⊕b⊕(1⊕1)=a⊕b\bar{a} \oplus \bar{b} = (a \oplus 1) \oplus (b \oplus 1) = a \oplus b \oplus (1 \oplus 1) = a \oplus b

Therefore:

xˉ1⊕xˉ3=x1⊕x3\bar{x}_1 \oplus \bar{x}_3 = x_1 \oplus x_3
xˉ2⊕xˉ4=x2⊕x4\bar{x}_2 \oplus \bar{x}_4 = x_2 \oplus x_4

Since x1⊕x3=x2⊕x4x_1 \oplus x_3 = x_2 \oplus x_4, we have:

xˉ1⊕xˉ3=xˉ2⊕xˉ4\bar{x}_1 \oplus \bar{x}_3 = \bar{x}_2 \oplus \bar{x}_4

Thus, (C) is always TRUE.

Counterexample for options (A), (B), and (D): Let x1=x2=x3=x4=1x_1 = x_2 = x_3 = x_4 = 1. The given condition 1⊕1⊕1⊕1=01 \oplus 1 \oplus 1 \oplus 1 = 0 is satisfied, but:

  • (A) x1x2x3x4=1≠0x_1 x_2 x_3 x_4 = 1 \neq 0 (False)

  • (B) x1x3+x2=1+1=1≠0x_1 x_3 + x_2 = 1 + 1 = 1 \neq 0 (False)

  • (D) x1+x2+x3+x4=1≠0x_1 + x_2 + x_3 + x_4 = 1 \neq 0 (False)

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 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

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 2016 Set 2.

How GATE tests Boolean Algebra and Minimization

More from GATE CSE 2016 Set 2

Share this solution

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

GateAI solution cardGATE CSE 2016 Set 2 · Q8 · MCQ

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

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