edited by
58 views
0 votes
0 votes

The minimum number of $2$-input $\text{NAND}$ gates required to implement the Boolean function $Z=A \bar{B} C$, assiming that $A, B$ and $C$ are available, is

  1. two
  2. three
  3. five
  4. six
edited by

Please log in or register to answer this question.

Answer: