Let ⊕ denote the exclusive OR (XOR) operation. Let '1' and '0' denote the…

PYQ GATE 2014

Let ⊕ denote the exclusive OR (XOR) operation. Let '1' and '0' denote the binary constants. Consider the following Boolean expression for FF over two variables PP and QQ:

F(P,Q)=((1⊕P)⊕(P⊕Q))⊕((P⊕Q)⊕(Q⊕0))F(P,Q)=\left( \left(1 \oplus P \right) \oplus \left( P \oplus Q \right )\right ) \oplus \left(\left(P \oplus Q\right) \oplus \left(Q \oplus 0\right)\right)

The equivalent expression for FF is

  1. A.

    P+QP+Q

  2. B.

    P+Q‾\overline{P+Q}

  3. C.

    P⊕QP \oplus Q

  4. D.

    P⊕Q‾\overline {P \oplus Q}

Attempted by 1192 students.

Sign up free to check your answer

Sign up free

Explore the full course: Digital Electronics

Loading lesson…