![]() | Digital Teaching Aid (DED Philippinen, 86 p.) |
![]() | ![]() | Karnaugh Mapping - Lesson 4 |
![]() |
|
No. 1 Simplify the following Karnaugh maps and write down the Boolean equation for every map.
|
|
|
|
0 |
0 |
|
1 |
0 |
|
1 |
1 |
|
0 |
0 |
|
|
|
|
1 |
1 |
|
0 |
0 |
|
1 |
0 |
|
1 |
1 |
|
|
|
|
1 |
0 |
|
0 |
0 |
|
0 |
0 |
|
1 |
0 |
|
|
|
|
|
|
0 |
1 |
0 |
0 |
|
1 |
0 |
1 |
1 |
|
1 |
0 |
0 |
1 |
|
0 |
1 |
1 |
0 |
|
|
|
|
|
|
1 |
1 |
0 |
1 |
|
0 |
0 |
1 |
1 |
|
0 |
0 |
0 |
1 |
|
1 |
1 |
0 |
1 |
No. 2 Translate each output (v, w, x, y, z) into a Karnaugh map, do the simplification and write down the Boolean equation.
A |
B |
C |
D |
v |
w |
x |
y |
z |
0 |
0 |
0 |
0 |
1 |
1 |
0 |
1 |
0 |
0 |
0 |
0 |
1 |
0 |
1 |
0 |
1 |
1 |
0 |
0 |
1 |
0 |
0 |
1 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
0 |
0 |
0 |
0 |
1 |
0 |
1 |
0 |
0 |
0 |
0 |
1 |
0 |
1 |
0 |
1 |
0 |
1 |
1 |
0 |
1 |
1 |
0 |
0 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
0 |
0 |
1 |
1 |
1 |
1 |
0 |
1 |
1 |
0 |
1 |
0 |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
1 |
1 |
1 |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
0 |
1 |
0 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
1 |
0 |
0 |
0 |
1 |
1 |
1 |
1 |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
1 |
1 |
1 |
0 |
1 |
0 |
0 |
0 |