The complement of the Boolean expression F = x'y z' + x'y'z is:
Complement by De Morgan's: F' = (x'y z' + x'y'z)' = (x'y z')' . (x'y'z)' = (x + y' + z)(x + y + z').
Which of the following Boolean logic statements is/are CORRECT?
NAND & NOR are universal. XOR is associative. XNOR is NOT associative in general for odd inputs. XNOR of 3 inputs is 1 when even number of 1s (or odd number of 0s).
For F(A,B,C,D)=$\Sigma m(0,1,2,5,8,9,10)$, which statements about its essential prime implicants are CORRECT?
The essential prime implicants are B'D', B'C', and A'C'D, so the count is 3.
A logic gate whose output is HIGH only when all its inputs are LOW is a:
For a NOR gate, output Y = (A + B)' = A'B'. So $Y = 1$ if and only if $A=0$ and $B=0$.
Assume the complemented inputs A' and B' are available. Which statements about implementing F=A+B'C using 2-input NAND gates are CORRECT?
With A' and B' available, the two NAND gates above implement the function. Extra gates are needed only if complements must also be generated.