Computer Science
For the given truth table A, B and C are the inputs and X is the output.
| A | B | C | X |
|---|---|---|---|
| 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 0 |
Write:
(i) Canonical Sum of Product expression (SOP).
(ii) Canonical Product of Sum expression (POS).
Boolean Algebra
8 Likes
Answer
| A | B | C | X | Min Terms | Max Terms |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | A'B'C' | |
| 0 | 0 | 1 | 0 | A+B+C' | |
| 0 | 1 | 0 | 0 | A+B'+C | |
| 0 | 1 | 1 | 1 | A'BC | |
| 1 | 0 | 0 | 1 | AB'C' | |
| 1 | 0 | 1 | 0 | A'+B+C' | |
| 1 | 1 | 0 | 1 | ABC' | |
| 1 | 1 | 1 | 0 | A'+B'+C' |
Canonical Sum of Product expression (SOP):
A'B'C' + A'BC + AB'C' + ABC'
Canonical Product of Sum expression (POS):
(A+B+C').(A+B'+C).(A'+B+C').(A'+B'+C')
Answered By
3 Likes
Related Questions
Simplify the following expression and convert it into its canonical POS form:
(X.Y + Z)(Y + Z'.X)Minimise the following expression. At each step clearly mention the law used.
Y.(A+B').(B+CD)'Given F = A + (B + C).(D' + E)
Find F' and show the relevant working in steps.Obtain the truth table to verify the following expression:
X.(Y + Z)= X.Y + X.Z
Also state this law.