I am trying to find the minimum AND-OR expression in a K-map with Don't Cares. My Karnaugh map is attached below.
Here is the min AND-OR expression, I believe.b'd' + b'c + ac
Alright, variable p is missing from that equation, but I get the idea. On that note, is this the correct truth table outputs:
1
1
0
0
1
1
1
1
1
1
0
0
0
0
0
0
The boolean expression I am working with is:
((ab)'(b'c)' + a'bpc') where ' is the NOT symbol.
I have the following logic circuit diagram. Is it correct?