# Disjunctive Normal Form

The boolean expression:

y= (a'+b) * (b(c'+d')) = (a'+b) * (bc' + bd')

is given.

Find out the disjunctive normal form to this boolean expression.

My suggestion:

y= a'bc'd' + a'bc'd + a'bcd' + abc'd' + abc'd+abcd'

only when these terms are true the function is 1 and otherwise not. (=0)

Is the DNF right?

Thanks for the help.

Edit: Here ist the truth table for the boolean expression: • You might notice that a has no effect on the output. May 5 '19 at 12:01

That looks good your original equation reduces to (bc' + bd') which is what you have put in your truth table and then extracted in DNF.

Edit to clarify reduction of original equation.

(a'+b) * (bc' + bd')= a'(bc' + bd')+b(bc' + bd')

              = a'(bc' + bd')+(bc' + bd')

= (bc' + bd')

• the simplified boolean equation would be b(c'+d'), so i could simplify the DNF to y= bc'd' + bc'd + bcd' + bc'd' + bc'd+bcd' , right? May 5 '19 at 12:17
• @lightsodium DNF requires all the variables to be present in all of the terms.
– RoyC
May 5 '19 at 12:19
• oh,thanks! so it still would be y= a'bc'd' + a'bc'd + a'bcd' + abc'd' + abc'd+abcd' May 5 '19 at 12:22
• "that looks good your original equation reduces to (bc' + bd')": how can I read this just out of the truth table? and not by using laws to reduce the equation May 5 '19 at 12:42
• You can't you have to use the laws of boolean algebra to get to (bc' + bd'). After you put this in your truth table you can read out the DNF form.
– RoyC
May 5 '19 at 13:01