❔ 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}
Correct Answer is: (a) {AND, OR}
other options
(b) {AND, NOT} - forms NAND gate
(c) {NOT, OR} - forms NOR gate
(d) {NOR} - (NOR and NAND gates are universal/complete)
(a) {AND, OR}
(b) {AND, NOT}
(c) {NOT, OR}
(d) {NOR}
Correct Answer is: (a) {AND, OR}
other options
(b) {AND, NOT} - forms NAND gate
(c) {NOT, OR} - forms NOR gate
(d) {NOR} - (NOR and NAND gates are universal/complete)
No comments:
Post a Comment