edited by
7,115 views
9 votes
9 votes

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

  1. $0$ (Zero)
  2. $1$
  3. $4$
  4. $7$
edited by

1 Answer

Best answer
24 votes
24 votes

ZERO    Because After simplifying You would get This

A(1+B'+B'C)   which is equal To A

So No need For any NAND gate

 

selected by
Answer:

Related questions

8 votes
8 votes
2 answers
1
Arjun asked Jul 6, 2016
3,734 views
If $12A7C_{16} = X_8$ then the value of $X$ is$224174$$425174$$6173$$225174$
12 votes
12 votes
3 answers
2
Arjun asked Jul 6, 2016
8,175 views
The logic circuit given below converts a binary code $Y_1Y_2Y_3$ into Excess-$3$ codeGray code$\text{BCD}$ codeHamming code
9 votes
9 votes
5 answers
3
go_editor asked Jul 6, 2016
8,319 views
The Excess-$3$ code is also calledCyclic Redundancy CodeWeighted CodeSelf-Complementing CodeAlgebraic Code
8 votes
8 votes
2 answers
4
go_editor asked Jul 5, 2016
4,676 views
The circuit given in the figure below isAn oscillating circuit and its output is square waveThe one whose output remains stable in $\text{‘1'}$ stateThe one having outp...