Computer Science
Minimise the following expression. At each step clearly mention the law used.
Y.(A+B').(B+CD)'
Boolean Algebra
5 Likes
Answer
Y.(A + B').(B + CD)'
= Y.(A + B').[B'.(CD)'] [De-Morgan's Law]
= Y.(A + B').[B'.(C' + D')] [De-Morgan's Law]
= (AY + B'Y).(B'C' + B'D') [Distributive Law]
= AB'C'Y + AB'D'Y + B'C'Y + B'D'Y [Distributive Law]
= B'C'Y(A + 1) + B'D'Y(A + 1) [Distributive Law]
= B'C'Y + B'D'Y [∵ A+1=1]
Answered By
2 Likes
Related Questions
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).What is the Canonical form of Boolean expression? State the two types of Canonical forms.
Simplify the following expression and convert it into its canonical POS form:
(X.Y + Z)(Y + Z'.X)State the distributive law. Verify it using the truth table.