Simplifying boolean equations with Truth Tables
A common question is to give
you a complex boolean equation, which you will then have to work out a simpler exact equivalent. This is useful when you are designing circuits and want to minimise the number of gates you are using or make circuits that only use particular types of gates. To simplify boolean equations you must be familiar with two methods. You can normally use either, but try to master both:
Truth tables
Boolean algebra - identities and De Morgan’s Law