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

Question 6(c)

2 marks

Computer ScienceISC 2020 Computer Science Paper 1Short answerBoolean Algebra

Answer the following in short.

Simplify the following expression using Boolean laws: F = [ (X' + Y) · (Y' + Z) ]' + (X' + Z)

Simplify the following expression using Boolean laws: $F = [ (X' + Y) \cdot (Y' + Z) ]' + (X' + Z)$
Open in the Boolean algebra solver

Answer

Answer

$F = [(X' + Y) \cdot (Y' + Z)]' + (X' + Z)$ $= (X' + Y)' + (Y' + Z)' + (X' + Z)$ (De Morgan's law) $= XY' + YZ' + X' + Z$ (De Morgan's law, involution law) $= (X' + XY') + (Z + YZ')$ (regrouping) $= (X' + Y') + (Z + Y)$ (using $A + A'B = A + B$) $= (Y + Y') + X' + Z$ (regrouping) $= 1 + X' + Z$ (complement law) $= 1$ (null law) So $F = 1$ (verified with the boolean tool: the expression is a tautology).