I am looking for some assistance with this question. I have a basic understanding but I just need someone to answer it and to show a detailed description of how it is done. The detailed description is important so I can get an exact understanding.
Plot the following Truth Tables on to the given Karnaugh maps and obtain the minimal Boolean expression for each.
1.
| A |
B |
Y |
| 0 |
0 |
1 |
| 0 |
1 |
1 |
| 1 |
0 |
1 |
| 1 |
1 |
0 |
2.
| A |
B |
C |
Y |
| 0 |
0 |
0 |
0 |
| 0 |
0 |
1 |
0 |
| 0 |
1 |
0 |
1 |
| 0 |
1 |
1 |
1 |
| 1 |
0 |
0 |
1 |
| 1 |
0 |
1 |
0 |
| 1 |
1 |
0 |
1 |
| 1 |
1 |
1 |
1 |
3.
| A |
B |
C |
D |
Y |
| 0 |
0 |
0 |
0 |
1 |
| 0 |
0 |
0 |
1 |
0 |
| 0 |
0 |
1 |
0 |
1 |
| 0 |
0 |
1 |
1 |
0 |
| 0 |
1 |
0 |
0 |
1 |
| 0 |
1 |
0 |
1 |
1 |
| 0 |
1 |
1 |
0 |
0 |
| 0 |
1 |
1 |
1 |
1 |
| 1 |
0 |
0 |
0 |
1 |
| 1 |
0 |
0 |
1 |
0 |
| 1 |
0 |
1 |
0 |
1 |
| 1 |
0 |
1 |
1 |
0 |
| 1 |
1 |
0 |
0 |
0 |
| 1 |
1 |
0 |
1 |
1 |
| 1 |
1 |
1 |
0 |
1 |
| 1 |
1 |
1 |
1 |
1 |
| AB\CD |
00 |
01 |
11 |
10 |
| 00 |
|
|
|
|
01
|
|
|
|
|
10
|
|
|
|
|
11
|
|
|
|
|