in Others edited by
9 views
0 votes
0 votes

GATE ECE 1995 | Question-29

The minimum number of $\text{NAND}$ gates required to implement the Boolean function $\mathrm{A}+\mathrm{A} \overline{\mathrm{B}}+\mathrm{A} \overline{\mathrm{B}} \mathrm{C}$, is equal to

  1. zero
  2. $1$
  3. $4$
  4. $7$

     

in Others edited by
by
31.3k points
9 views

Please log in or register to answer this question.

Welcome to GO Electronics, where you can ask questions and receive answers from other members of the community.