Dean thinks that AB + A'B' simplifies to 1 by the Inverse law. a. Using the DeMorgan and Involution laws, express the inverse of A'B' as a boolean expression bexp5d that is a sum of literals. Show the application(s) of each law. b. Using the DeMorgan and Involution laws, express the inverse of (A'+B+C') as a boolean expression bexp5ethat is a product of literals. Show the application(s) of each law. c. Show that Dean is wrong by fleshing out a truth table to find all rows in which AB + A'B' evaluates to 0, not 1. Circle these rows.
Dean thinks that AB + A'B' simplifies to 1 by the Inverse law.
a. Using the DeMorgan and Involution laws, express the inverse of A'B' as a boolean expression bexp5d that is a sum of literals. Show the application(s) of each law.
b. Using the DeMorgan and Involution laws, express the inverse of (A'+B+C') as a boolean expression bexp5ethat is a product of literals. Show the application(s) of each law.
c. Show that Dean is wrong by fleshing out a truth table to find all rows in which AB + A'B' evaluates to 0, not 1. Circle these rows.
In Boolean algebra, the Inverse law states that the sum of a variable and its complement always equals 1. Dean believes that the expression AB + A'B' simplifies to 1 using this law. However, we will use the DeMorgan and Involution laws to demonstrate the correct simplification of this expression
Step by step
Solved in 5 steps
