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

Question 6(b)

3 marks

Computer ScienceISC 2017 Computer Science Paper 1DerivationBoolean Algebra

Prove the following using Boolean laws.

Prove the Boolean expression using Boolean laws. Also, mention the law used at each step. F = (x' +…

Prove the Boolean expression using Boolean laws. Also, mention the law used at each step. $F = (x' + z) + [(y' + z) \cdot (x' + y)]' = 1$

Given: $(x' + z) + [(y' + z) \cdot (x' + y)]'$

To show: 1

Open in the Boolean algebra solver

Answer

Answer

To prove: $(x' + z) + [(y' + z) \cdot (x' + y)]' = 1$. Verified with the boolean tool: the expression is a tautology (always 1).
  1. Start: $(x' + z) + [(y' + z) \cdot (x' + y)]'$
  2. $= (x' + z) + (y' + z)' + (x' + y)'$ (De Morgan's law on the complement of the product)
  3. $= x' + z + yz' + xy'$ (De Morgan's law on each complemented sum, and involution law $y'' = y$, $x'' = x$)
  4. $= x' + z + y + xy'$ (Absorption/redundancy law: $z + yz' = z + y$)
  5. $= x' + y' + z + y$ (Absorption/redundancy law: $x' + xy' = x' + y'$)
  6. $= x' + (y' + y) + z$ (Associative and commutative laws)
  7. $= x' + 1 + z$ (Complement law: $y' + y = 1$)
  8. $= 1$ (Null/annulment law: $A + 1 = 1$)