Computer Science
Minimize the expression using Boolean laws:
(A + B')(B + CD)'
Boolean Algebra
11 Likes
Answer
(A + B')(B + CD)'
= (A + B')(B'(CD)') [De-Morgan's Law]
= (A + B')(B'(C' + D')) [De-Morgan's Law]
= (A + B')(B'C' + B'D') [Distributive Law]
= AB'C' + AB'D' + B'B'C' + B'B'D'
= AB'C' + AB'D' + B'C' + B'D' [∵ B'B' = B']
= B'C'(1 + A) + B'D'(1 + A)
= B'C' + B'D' [∵ 1 + A = 1]
Answered By
8 Likes
Related Questions
State the principal of duality. Write the dual of:
(P + Q').R.1 = P.R + Q'.RConvert the following cardinal form of expression into canonical form:
F(P, Q, R) = π(1, 3)In the following truth table x and y are inputs and B and D are outputs:
Input Output x y B D 0 0 0 0 0 1 1 1 1 0 0 1 1 1 0 0 Answer the following questions:
(i) Write the SOP expression for D.
(ii) Write the POS expression for BReduce the following function by using Boolean laws:
F(A, B, C, D) = (A' + C) (A' + C') (A' + B + C'D)