NAND gate

Ask
The minimum number of 2-input NAND gates required to implement the Boolean function Z = $A\overline{B}C$, assuming that A,B & C are available
(a)2
(b)3
(c)5
(d)6

 Answer is (c)
Concept
Type Reasoning here



No comments:

Post a Comment

Subscribe to: Post Comments (Atom)