![]() | Digital Teaching Aid (DED Philippinen, 86 p.) |
![]() | ![]() | Karnaugh Mapping II - Lesson 5 |
![]() |
|
No. 1
A |
B |
C |
D |
Y |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
0 |
0 |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
0 |
0 |
0 |
0 |
1 |
0 |
1 |
1 |
0 |
1 |
1 |
0 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
0 |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
0 |
1 |
0 |
1 |
0 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
1 |
a) Draw the Karnaugh map.
b) Encircle all octets, quads and pairs you can find.
c) What is the simplified Boolean equation for the Karnaugh map?
d) Draw the logic circuit.
e) Suppose the last six entries of the truth table are changed to don't cares. Using the Karnaugh map, show the simplified circuit.
f) What is the simplified NOR-NOR circuit?