Question

1. Use Boolean algebra to find the minimum cost SOP expression for the function below.

f(a,b,c,d) =a~bc + cd + ~ad + bd

Answer 1

\[\large f(a,b,c,d)= a\overline{b}c + cd + \overline{a}d + bd\]

like that ?

Answer 2

Yes, I couldnt figure out how to put like that.

Answer 3

Your expression is already in SOP form and is minimum

Answer 4

No, it is not. I was told to use Consensus laws and I'm not sure how.

Answer 5

Remember Boolean Identities?

Answer 6

you cant simplify it further in SOP form

Answer 7

Umm, can you explain more about that ?

Answer 8

you may use boolean algebra to reduce the cost but that disturbs the SOP form

Answer 9

is this the actual given expression or have you simlified it using k-map or something already ?

Answer 10

maybe its a~(bc) or something? u sure u are giving the right formula