Prashnikaप्रश्निका
Code
About
‹ Back to the paper

Question 1(b)

1 mark

Computer ScienceISC 2018 Computer Science Paper 1One wordBoolean Algebra

Answer the following.

Convert the following expression into its canonical POS form: F(X, Y, Z) = (X+Y' ) · (Y'+Z)

Convert the following expression into its canonical POS form: $F(X, Y, Z) = (X+Y' ) \cdot (Y'+Z)$
Open in the Boolean algebra solver

Answer

Answer

$F(X,Y,Z) = (X+Y').(Y'+Z)$ Each term is expanded to include the missing variable by ORing it with (variable.variable'): $(X+Y') = (X+Y'+Z.Z') = (X+Y'+Z).(X+Y'+Z')$ $(Y'+Z) = (Y'+Z+X.X') = (X+Y'+Z).(X'+Y'+Z)$ Combining and removing the repeated term $(X+Y'+Z)$: Canonical POS: $F(X,Y,Z) = (X+Y'+Z).(X+Y'+Z').(X'+Y'+Z)$ (verified with the boolean tool)