4,959 views
0 votes
0 votes
The minimum number of NAND gates required to implement the boolean function A+AB(bar)+AB(bar)C is equal to

 (a)0

(b)1

(c)4

(d)7  

.HOW TO SOLVE SUCH TYPE OF QUESTION? WHAT SHOULD BE THE APPROACH?

2 Answers

Best answer
2 votes
2 votes

First let us simplify the expression :

      A + AB' + AB'C

=    A + AB'(1 + C)

=    A + AB'

=    A(1 + B') 

=    A

So no NAND gate needed in fact..

Hence A) should be the correct answer.

selected by
2 votes
2 votes
A + AB' + AB'C

= A( 1+B' ) + AB'C

= A +AB'C        [ A + 1 = 1 ]

= A(1 + B'C)

= A

So Not need NAND Gates

Option (A) is right answer

Related questions

0 votes
0 votes
0 answers
1
kumarip asked Mar 6, 2018
446 views
0 votes
0 votes
2 answers
2
cse23 asked Jun 8, 2016
2,895 views
options:(a)400 (b)500 (c)600 (d)700
1 votes
1 votes
3 answers
3
sh!va asked Feb 22, 2017
591 views
Given circuit represents(a) INVERTER(b) AND(c) OR(d) NOR
0 votes
0 votes
1 answer
4
sh!va asked Feb 21, 2017
1,186 views
A 1 MHz clock signal is applied to a J-K Flip Flop with J=K=1. What is the frequency of the Flip-Flop 0/P signal? (a) 2 MHz (b) 500 kHz (c) 250 kHz (d) 500 MHz