Can you help me with this problem:
"Simplify the Boolean Function together with the don't care condition d in sum of the products and product of sum.
F(x,y,z) = ∑(0,1,2,4,5)
d(x, y, z) = ∑(3,6,7)"
I try to solve it but I came up with 1 and 0.
Can you help me with this problem:
"Simplify the Boolean Function together with the don't care condition d in sum of the products and product of sum.
F(x,y,z) = ∑(0,1,2,4,5)
d(x, y, z) = ∑(3,6,7)"
I try to solve it but I came up with 1 and 0.
I would use a Karnaugh map for this problem. The order of the minterms would be (in the top row), 0,2,6,4 and (in the bottom row) 1, 3, 7, 5. This evaluates to 1 since the 'don't cares' can be whatever value (1 or 0).
|1|_1_|d|_1_|
| 1 | d | d | 1 |