Scribd Logo
Upload

Welcome to Scribd!

  • Boolean Ex 2

    Uploaded by

    gobal suthakaran
    6 views2 pages
    This document contains solutions to examples of minimizing Boolean algebra expressions: 1) Example (a) is minimized to B, example (b) is minimized to (A + B)C, and example (c) shows that the left and right sides are equal. 2) Example (d) is minimized through a series of steps applying Boolean algebra rules such as distribution, commutativity, and identities like A+A=A to arrive at the simplified form of A(A+C) + B(A+C).

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains solutions to examples of minimizing Boolean algebra expressions: 1) Example (a) is minimized to B, example (b) is minimized to (A + B)C, and example (c) shows that the left and right sides are equal. 2) Example (d) is minimized through a series of steps applying Boolean algebra rules such as distribution, commutativity, and identities like A+A=A to arrive at the simplified form of A(A+C) + B(A+C).

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    6 views2 pages

    Boolean Ex 2

    Uploaded by

    gobal suthakaran
    This document contains solutions to examples of minimizing Boolean algebra expressions: 1) Example (a) is minimized to B, example (b) is minimized to (A + B)C, and example (c) shows that the left and right sides are equal. 2) Example (d) is minimized through a series of steps applying Boolean algebra rules such as distribution, commutativity, and identities like A+A=A to arrive at the simplified form of A(A+C) + B(A+C).

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    269

    Math 123 Boolean Algebra


    Example 6: Minimize the following expression by use of Boolean
    rules.
    __ __
    (a) X=ABC+ A B+AB C
    __ __ __ __ __ __ __ __ __ __
    (b) X = A B C + A B C +A B C + A B C
    __ __
    (c) AB + A C + B C = AB + A C
    __ __
    (d) (A + B) ( A + C) (B + C) =(A + B) ( A + C)
    Solution:
    __ __
    (a) X =ABC + A B + AB C
    __ __
    = ABC + AB C + A B
    __ __
    = AB (C + C ) + A B
    __ __
    =AB + A B as C+ C =1
    __
    = (A + A ) B.
    = 1. B
    =B
    __ __ __ __ __ __ __ __ __ __
    (b) X = A BC +A B C + A B C + A B C
    __ __ __ __ __ __ __ __ __ __
    = A B C + A B C + A B C as A + A = A
    __ __ __ __ __
    = A B C +(A + A ) B C
    __ __ __
    =A BC + 1 . B C
    __ __ __
    = (A B + B ) C
    __ __ __ __ __
    = [( A + B ) . ( B + B )] C by the dual of
    distribution, rules 15
    __ __ __
    = ( A + B ) . 1] C
    __ __ __
    = (A + B ) C
    270
    Math 123 Boolean Algebra

    __
    (c) L.H.S. = AB + A C + BC
    __
    = AB + A C + BC
    __ __
    = AB + A C + 1.BC as 1=A+ A
    __ __
    = AB + A C + (A + A ) BC
    __ __
    = AB + A C +ABC + A BC , by distributive law
    __ __
    =AB +ABC + A C + A BC, by commutative law
    __
    = AB (1 + C) + A C (1 + B), AS 1 + X = 1
    __
    =AB + A C
    L.H.S. =R.H.S.
    __
    (d) L.H.S. = (A +B) ( A + C)( B + C)
    __ __
    =(A A + AC + B A + BC) ( B + C)
    __
    =(0 + AC +B A + BC) ( B +C)
    __
    =(AC + B A + BC ) (B + C)
    __
    =[AC + B( A + C)] (B + C)
    __ __
    =ABC + ACC + BB ( A + C) + BC ( A + C)
    __ __
    =ABC + AC + B ( A + C) + BC ( A + C)
    __
    = AC (B + 1) +B ( A + C) (1 + C)
    __
    = AC + B( A + C)
    __ __ __
    = A A + AC + B ( A + C) as AA = 0
    __ __
    = A( A + C) + B( A + C) or by rule 19.

    You might also like