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:
- OR gate, NOT gate
- AND gate, NOT gate
- NOR gate
- NAND gate
- 2:1 MUX
Any superset of the above examples will also form functionally complete operations set.
Therefore {AND, OR} is not functionally complete
মোঃ আরিফুল ইসলাম
Feb 20, 2025