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?

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? Correct Answer {AND, OR}

Functionally complete operations set is a set of logic functions from which any arbitrary Boolean logic function can be realized.

Examples of functionally complete operation set are:

  1. OR gate, NOT gate 
  2. AND gate, NOT gate
  3.  NOR gate
  4. NAND gate
  5.  2:1 MUX

Any superset of the above examples will also form functionally complete operations set.

Therefore {AND, OR} is not functionally complete

Related Questions

You are the administrator of eight SQL Server 2000 computers. You configure alerts on each server so that various problem conditions will be reported if they occur.You create 20 operators on one of the servers. You configure these operators by using the e-mail and pager contact information for the employees in your department. You configure the alerts on the server to send e-mail messages and pager messages to the appropriate operators.You need to configure the same 20 operators on the other seven servers. You want to do this with a minimum amount of administrative time.What should you do?