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

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

rational · Answer

$$\large f(a,b,c,d)= a\overline{b}c + cd + \overline{a}d + bd$$

like that ?

anonymous · Answer

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

rational · Answer

Your expression is already in SOP form and is minimum

anonymous · Answer

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

anonymous · Answer

Remember Boolean Identities?

rational · Answer

you cant simplify it further in SOP form

anonymous · Answer

Umm, can you explain more about that ?

rational · Answer

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

rational · Answer

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

dan815 · Answer

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

dan815 · Answer

|dw:1426568056732:dw|