Any set of Boolean operators that is sufficient to represent all Boole – McqOptions

MCQOPTIONS

1.	Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete?
A.	{AND, OR}
B.	{AND, NOT}
C.	{NOT, OR}
D.	{NOR}
Answer» B. {AND, NOT}

Discussion

No Comment Found

Related MCQs

In IEEE floating point representation, the hexadecimal number 0xC0000000 corresponds to
Original ASCII coding scheme uses ______ bits for coding 128 different characters.
According to Boolean law: \(\overline {\bar A}\) = ?
Consider the following gate networkWhich one of the following gates is redundant?
Express -39 in 8-bit 2's complement form.
If the numerical value of a 2-byte unsigned integer on a little endian computer is 255 more than that on a big endian computer, which of the following choices represent(s) the unsigned integer on a little endian computer?
Let m = (313)4 and n = (322)4. Find the base 4 expansion of m + n.
Given the function F = P’ + QR, where F is a function in three Boolean variables P, Q and R and P’ = !P, consider the following statements.(S1) F = ∑ (4, 5, 6)(S2) F = ∑ (0, 1, 2, 3, 7)(S3) F = Π (4, 5, 6)(S4) F = Π (0, 1, 2, 3, 7)Which of the following is true?
Consider the following Boolean expression for F:F(P, Q, R, S) = PQ + P̅QR + P̅QR̅SThe minimal sum-of-products form of F is
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