Computer Sciences > GATE 2014 SET-3 > Boolean Algebra
Let ⊕ denote the Exclusive OR (XOR) operation. Let '1' and '0' denote the binary constants. Consider the following Boolean expression for F over two variables P and Q:
F(P, Q) = ((1 ⊕ P) ⊕ (P ⊕ Q)) ⊕ ((P ⊕ Q) ⊕ (Q ⊕ 0))
The equivalent expression for F is
F(P, Q) = ((1 ⊕ P) ⊕ (P ⊕ Q)) ⊕ ((P ⊕ Q) ⊕ (Q ⊕ 0))
The equivalent expression for F is
Correct : d
Similar Questions
Consider a Boolean function of 3 inputs F(X,Y,Z) = Σ(3,5,6,7). Which of the following expressions is/are CORRECT?
For a Boolean variable x, which of the following statements is/are FALSE?
Consider the following Boolean expression. F = (X + Y + Z)(X̅ + Y)(Y̅ + Z) Which of the following Boolean expressions is/are equivalent to F̅ (complement of F)?
Total Unique Visitors
Loading......