Start with the function of three Boolean variables expressed in following truth table:
x | y | z | Result |
---|---|---|---|
0 | 0 | 0 | 1 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 1 |
0 | 1 | 1 | 0 |
1 | 0 | 0 | 1 |
1 | 0 | 1 | 0 |
1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 |
First, express the function in the canonical sum-of-products form as the sum of five minterms.
Second, simplify the function using Boolean manipulation.
Third, use a truth table to show that your simplication if valid.
Do the following problems from pages 118 and 119 of the textbook:
Return to the CSCI 255 index
Return to the UNCA Computer Science home
page