Project ForgeDigital Logic
Boolean Algebra & Minimization
GATE 2012
Easy
The truth table
X | Y | f(X,Y) 0 | 0 | 0 0 | 1 | 0 1 | 0 | 1 1 | 1 | 1
represents the Boolean function
- X
- BX + Y
- CX ⊕ Y
- DY
Explanation
f(X,Y) equals 1 exactly when X=1 (rows X=1,Y=0 and X=1,Y=1), and equals 0 whenever X=0, regardless of Y. So f(X,Y) = X.
Source: GATE CS 2012 (2012)
This question is part of a 15-day revision cycle — sign in and Project Forge will bring it back the day before you'd forget it.