GATEverse Practice, past papers & mock tests
GATE 2011
Digital LogicLogic Functions and MinimizationmediumMCQ1 mark
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
Save your progress

Related Digital Logic PYQs