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. ?

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?

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???