Basic Laws of Boolean Algebra
Each law contains two parts which may be obtained from one another by interchanging the 0 and 1, and the same time interchanging + and *.

Match each expression to the law that can be used to simplify it, then simplify each expression.

Simplify the following:

6. Suppose we want an action carried out if A is TRUE or B is TRUE, but absolutely NOT if both of them are TRUE. This is often called the "exclusive or" (XOR). Write an expression that will produce the same result as an exclusive or. (A XOR B) Check your work by constructing a truth table. Can your expression be simplified?