Write down the Boolean expression that corresponds
to the following logic circuit.
Z = ( (B != C) (A == B) ) + ( (A != B) (B == C) )
Note: != is "not equal", just another way to write XOR; == is "equal", just another way to write XNOR.
Fill in the truth table for the function.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Write the function above in canonical sum-of-products form.
Z = A'B'C + A'BC + AB'C' + ABC'
Simplify the function above as much as you can in the time alotted using the axioms/theorems of Boolean algebra (show your work):
Z = A'B'C + A'BC + AB'C' + ABC'
Z = A'C (B' + B) + AC' (B' + B)
Z = A'C + AC'
Z = (A != C)
Comments to: cse370-webmaster@cs.washington.edu
(Last Update: )