Skip to content
Official PYQ · 1987

GATE CS 1987 Q12-a — Boolean Algebra

Explain with AI

The Boolean expression A⊕B⊕AA \oplus B \oplus A is equivalent to

Choose one option
View worked solution

Answer: C

The XOR (⊕\oplus) operator is both commutative and associative. This allows us to rearrange the terms in the given Boolean expression:

A⊕B⊕A=(A⊕A)⊕BA \oplus B \oplus A = (A \oplus A) \oplus B

Using the properties of the XOR operator:

  1. Self-inverse property: Any variable XORed with itself results in 00.
    A⊕A=0A \oplus A = 0
  2. Identity property: Any variable XORed with 00 remains unchanged.
    0⊕B=B0 \oplus B = B

Substituting these properties into the expression:

(A⊕A)⊕B=0⊕B=B(A \oplus A) \oplus B = 0 \oplus B = B

Thus, the expression is equivalent to BB, which corresponds to option C.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Boolean Algebra questions