‹ Back to the paper
Prove the Boolean expression using Boolean laws. Also, mention the law used at each step.
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
Answer
No answer yet.
From ISC 2017 Computer Science Paper 1, question 6(b).