boolean-algebra , Equation simplification using boolean algebra

Equation simplification using boolean algebra


Tag: boolean-algebra
**Simply Equations using boolean rules** 

AB + (BC)` + A`C`

AB + B` + C` + A`C`
AB + B` + C` (1)
AB + B` + C`

AD + B`D + AB

AD + B` + D`+ AB
AD + D` +AB + B`
AD + AB + B` + D` 
A(B+D) + B` + D`

have I done simplification in right way.? Answers could be simplified further if yes then what rule should I use.? if I am totally wrong then please tell me correct answer. ? thanks


The first one is correct, the second is not:

B`D = B` + D` is wrong
B`D = B + D` is correct

Therefore the solution is:

AD + B`D + AB

AD + B + D` + AB
AD + D` + AB + B
AD + D` + B (A + 1)
AD + D` + B
(A` + D`) + D` + B
A` + D` + B

PS: I also wanted to highlight that StackOverflow is not a place for solving or reviewing homework.


Logical Boolean Negation Operator Precedence and Association

here's my first question(s) on StackOverflow, and as such I imagine it has been asked here before, but everything I type into the search bar gives me different questions. (Or sometimes "no" results at all!) I am learning on w3Schools, but I saw this seemingly simple code snippet which stirred...

Which laws simplify this boolean expression?

Which laws do I need to use to simplify !X + (!Y + !Z)*(Y + Z) to !X + (Y*!Z) + (!Y*Z) ...