Digital Logic - Boolean Algebra
19. Consider a function that is defined by the following truth table:
|
A |
B |
C |
F(A, B, C ) |
|
0 |
0 |
0 |
1 |
|
1 |
0 |
0 |
1 |
|
0 |
1 |
0 |
1 |
|
1 |
1 |
0 |
1 |
|
0 |
0 |
1 |
1 |
|
1 |
0 |
1 |
0 |
|
0 |
1 |
1 |
X |
|
1 |
1 |
1 |
X |
*/?>
*/?>
*/?>
*/?>