Question
Write the SOP form of a Boolean Function F, which is represented in a truth table as follows:
|
X |
Y |
Z |
F |
|
0 |
0 |
0 |
1 |
|
0 |
0 |
1 |
0 |
|
0 |
1 |
0 |
1 |
|
0 |
1 |
1 |
0 |
|
1 |
0 |
0 |
1 |
|
1 |
0 |
1 |
0 |
|
1 |
1 |
0 |
0 |
|
1 |
1 |
1 |
1 |
Solution
SOP form
(X’Y’Z’)+(X’+Y+Z’)+(XY’Z’)+(X+Y+Z)
