# Minimum number of NAND gates for logic circuit

3.5k views

Here we are getting output as Y'=A'BC+AB'C+ABC'+ABC

=AB+BC+AC

=((A(B'C')')' (BC)')'

So, total 6 NAND gates are required.

If complemented and uncomplemented variable both present then minimum NAND gates are 4

selected
0

Is there any method to reduce AB+BC+AC to ((A(B'C')')' (BC)')' ?

0
No, just put demorgan law (A+B)'=A'B'  ,(AB)'=A'+B'

and then trial and error
0
Mam, I think that the function is 1 on the minterms 0,1,2,4. so y' is definitely what you wrote but forgot to make the pos. You are counting max terms so it you should use pos term right. ?
1
7 NAND gates required
1 vote

There is a systematic procedure to find the number of NAND gates.

First, determine the minimal SOP for ( AND-OR structure) then follow the steps--

no of gates=6

## Related questions

1
5.3k views
The truth table for the combinational circuit is shown below: What is the minimum number of two input NAND gates required to realize this logic circuit?
1 vote
Q. The minimum number of $2$-input $NAND$ gates required to implement the function $F = (x' + y')(z + w)$ is $?$ plz explain?? and also i realized but I am getting always correct answer plz suggest how to approach???