Write down the Boolean expression that corresponds
to the following logic circuit.
Z =
Fill in the truth table for the function.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Write the function above in canonical sum-of-products form.
Z =
Simplify the function above as much as you can in the time alotted using the axioms/theorems of Boolean algebra (show each step):
Z =