What is the Boolean expression for a NAND gate ?
UKPSC Combined Upper Subordinate Service - 2025,
Answer: B
The NAND expression is (A·B)'.
NAND is NOT-AND: the output is the complement of A AND B, so it is 0 only when both inputs are 1.
(A + B)' is NOR, A + B is OR, and A·B is AND. NAND and NOR are called universal gates because any logic circuit can be built from either alone.
Truth table check for NAND: inputs 00, 01 and 10 give 1, and only 11 gives 0, which is exactly the complement of AND.
Please log in or register to report this question.