Which of the following is functionally complete set?
In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression. A well-known complete set of connectives is {AND, NOT}, consisting of binary conjunction and negation.
AND gate:-
The AND gate is an electronic circuit that gives a high output (1) only if all its inputs are high. A dot (.) is used to show the AND operation i.e. A.B.
OR gate:-
The OR gate is an electronic circuit that gives a high output (1) if one or more of its inputs are high.
NOT gate:-
The NOT gate is an electronic circuit that produces an inverted version of the input at its output.