Derive a Canonical POS expression for a Boolean function FN, represented by the following truth truth table:
| X | y | z | FN (X, Y, Z) |
| 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
Advertisement Remove all ads
Solution
Output: `(barX + barY + barZ)(X + barY + barZ)(barX + barY + barZ)(barX + barY + barZ)`
Concept: Obtaining Sum of Product (SOP) and Product of Sum (POS) Form the Truth Table
Is there an error in this question or solution?
APPEARS IN
Advertisement Remove all ads
