Skip to content
Official PYQ · 2007

GATE CS 2007 Q33 — Boolean Algebra

Explain with AI

Define the connective ∗* for the Boolean variables XX and YY as: X∗Y=XY+X′Y′.X * Y = XY + X'Y'. Let Z=X∗YZ = X * Y. Consider the following expressions PP, QQ and RR.
P:X=Y∗Z,Q:Y=X∗Z,R:X∗Y∗Z=1P : X = Y * Z, \\ Q :Y = X * Z, \\ R : X *Y * Z = 1
Which of the following is TRUE?

Choose one option
View worked solution

Answer: D

The given connective ∗* is defined as:

X∗Y=XY+X′Y′X * Y = XY + X'Y'

This is the standard XNOR (equivalence) operator, denoted as ⊙\odot. Let us analyze the properties of the ⊙\odot operator:

  • Commutativity: A⊙B=B⊙AA \odot B = B \odot A
  • Associativity: (A⊙B)⊙C=A⊙(B⊙C)(A \odot B) \odot C = A \odot (B \odot C)
  • Identity: 1⊙A=A1 \odot A = A
  • Self-equivalence: A⊙A=1A \odot A = 1

We are given Z=X∗Y=X⊙YZ = X * Y = X \odot Y. Let us evaluate each expression:

1. Evaluating P:X=Y∗ZP : X = Y * Z

Y∗Z=Y⊙(X⊙Y)=(Y⊙Y)⊙X(by associativity and commutativity)=1⊙X(since Y⊙Y=1)=X\begin{aligned} Y * Z &= Y \odot (X \odot Y) \\ &= (Y \odot Y) \odot X & \quad \text{(by associativity and commutativity)} \\ &= 1 \odot X & \quad \text{(since } Y \odot Y = 1\text{)} \\ &= X \end{aligned} Thus, PP is valid.

2. Evaluating Q:Y=X∗ZQ : Y = X * Z

X∗Z=X⊙(X⊙Y)=(X⊙X)⊙Y=1⊙Y=Y\begin{aligned} X * Z &= X \odot (X \odot Y) \\ &= (X \odot X) \odot Y \\ &= 1 \odot Y \\ &= Y \end{aligned} Thus, QQ is valid.

3. Evaluating R:X∗Y∗Z=1R : X * Y * Z = 1

X∗Y∗Z=(X⊙Y)⊙Z=Z⊙Z(since X⊙Y=Z)=1\begin{aligned} X * Y * Z &= (X \odot Y) \odot Z \\ &= Z \odot Z & \quad \text{(since } X \odot Y = Z\text{)} \\ &= 1 \end{aligned} Thus, RR is valid.

Since PP, QQ, and RR are all valid, the correct option is D.

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

Published
Report a correction
Keep exploringMore Boolean Algebra questions