1
Question
Which of the following is a functionally complete gate?
Which of the following is a functionally complete gate?
Open in App
Solution
The correct option is B NAND
NAND is a functionally
complete gate.
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
each of the singleton sets {NAND} is functionally complete.
A NAND gate is a logic
gate which produces an output which is false only if all its inputs are true;
thus its output is complement to that of an AND gate. A low output results only
if all the inputs to the gate are high; if any input is low, a high output
results.
NAND is a functionally complete gate.
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 each of the singleton sets {NAND} is functionally complete.
A NAND gate is a logic gate which produces an output which is false only if all its inputs are true; thus its output is complement to that of an AND gate. A low output results only if all the inputs to the gate are high; if any input is low, a high output results.
Suggest Corrections
0
Similar questions
View More
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
