The NAND gate output will be low if the two inputs are-
1, 1
The output is the inverse of the result of the AND operation on the inputs A and B. The AND output is 0, and the NAND output is the inverse of 0, which is 1. When inputs are 1, 1:
Important Questions from Basic Gates
Which of the following statements are true?
(i) Every logic network is equivalent to one using just NAND gates or just NOR gates.
(ii) Boolean expressions and logic networks correspond to labelled acyclic digraphs.
(iii) No two Boolean algebras with n atoms are isomorphic.
(iv) Non-zero elements of finite Boolean algebras are not uniquely expressible as joins of atoms.Minimum number of NAND gates required to implement the following binary equation $Y = (A+B)(\overline{C \cdot D})$
Which of the following logic gates has output low when one of the inputs is high?
A + B = Y is the Boolean function for
Which of the following gates gives output 1 when any one of the input is 1?
