Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 72 views

    Logic Design (CE 207, CE 213) Chapter No. 2 - Part No. 1

    Uploaded by

    Freyja Sigurgisladottir
    This document contains examples of Boolean algebra identities and logic circuit problems from a college-level digital logic design course. It includes the steps to simplify Boolean expressions using identities like DeMorgan's laws, distributive laws, and associative laws. It also asks to draw the logic diagrams for the original and simplified expressions. The document is in Arabic and contains chapter and problem numbers as well as solution steps for simplifying Boolean algebra expressions and drawing equivalent logic circuits.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Logic Design (CE 207, CE 213) Chapter No. 2 - Part No. 1

    Uploaded by

    Freyja Sigurgisladottir
    72 views11 pages
    This document contains examples of Boolean algebra identities and logic circuit problems from a college-level digital logic design course. It includes the steps to simplify Boolean expressions using identities like DeMorgan's laws, distributive laws, and associative laws. It also asks to draw the logic diagrams for the original and simplified expressions. The document is in Arabic and contains chapter and problem numbers as well as solution steps for simplifying Boolean algebra expressions and drawing equivalent logic circuits.

    Original Title

    20120306122827_54685.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains examples of Boolean algebra identities and logic circuit problems from a college-level digital logic design course. It includes the steps to simplify Boolean expressions using identities like DeMorgan's laws, distributive laws, and associative laws. It also asks to draw the logic diagrams for the original and simplified expressions. The document is in Arabic and contains chapter and problem numbers as well as solution steps for simplifying Boolean algebra expressions and drawing equivalent logic circuits.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    72 views11 pages

    Logic Design (CE 207, CE 213) Chapter No. 2 - Part No. 1

    Uploaded by

    Freyja Sigurgisladottir
    This document contains examples of Boolean algebra identities and logic circuit problems from a college-level digital logic design course. It includes the steps to simplify Boolean expressions using identities like DeMorgan's laws, distributive laws, and associative laws. It also asks to draw the logic diagrams for the original and simplified expressions. The document is in Arabic and contains chapter and problem numbers as well as solution steps for simplifying Boolean algebra expressions and drawing equivalent logic circuits.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 11

    Kingdom of Saudi Arabia

    Ministry of Higher Education


    Majma’ah University
    College of Engineering
    EE & CEN

    Logic Design (CE 207, CE 213)


    Chapter No. 2 – Part No. 1
    Problem 2.1: Demonstrate the validity of the following identities by means of Truth Table.
    a) DeMorgan’s Law for three variables:

    Sol:

    Page 1 of 11
    b) Distributive Law:

    Sol:

    c) Distributive Law:

    Sol:

    Page 2 of 11
    d) Associative Law:

    Sol:

    e) Associative Law:

    Sol:

    Page 3 of 11
    Problem 2.2: Simplify the following Boolean expressions to a minimum number of
    Literals:

    a) xy+xy'
    Sol:
    xy +xy '=x ( y + y ' ) ( y' + y)=1
    xy+xy'=x

    b) ( x+ y )( x+ y ' )
    Sol:
    ( x+ y )( x+ y ' )=x . x +xy '+xy+ y . y ' ( y' . y)=0
    ( x+ y )( x+ y ' )=x +x ( y ' + y )+0 ( y' + y)=1
    ( x+ y )( x+ y ' )=x +x
    ( x+ y )( x+ y ' )=x

    c) xyz+x' y+xyz '


    Sol:
    xyz+x' y +xyz '=xyz+xyz '+x ' y
    xyz+x ' y +xyz '=xy (z+z ')+x ' y ( z'+z )=1
    \
    xyz+x ' y+xyz '=xy+x ' y
    xyz+x ' y +xyz '= y (x +x ') ( x'+x )=1
    xyz+x ' y+xyz '= y

    d) ( A +B)'( A '+B ' )'


    Sol: ( A +B)'=A ' B ' ( A '')= A
    and
    ( A +B)'( A '+B ' )'=( A ' B ' )( AB )
    ( A +B)'( A '+B ' )'= A '( B ' B ) A (B ' B)=0
    ( A +B)'( A '+B ' )'=0

    e) xyz' +x' yz+xyz+x' yz'


    Sol:

    Page 4 of 11
    xyz' +x' yz+xyz+x' yz'=xyz' +xyz+x' yz+x ' yz'
    xyz' +x ' yz+xyz+x ' yz'=xy ( z'+ z)+x' y ( z+z' ) ( z'+z )=1
    xyz' +x' yz+xyz+x' yz'=xy+x' y
    xyz' +x ' yz+xyz+x ' yz'= y ( x+ x ' ) ( x'+x )=1
    xyz' +x' yz+xyz+x' yz'= y

    f) ( x+ y+z ' )(x '+ y '+z )


    Sol:
    ( x+ y+z ' )(x '+ y '+z )=xx' +xy' +xz+ x ' y+ yy '+ yz+x ' z '+ y ' z' +zz'
    ( x+ y+z ' )(x '+ y '+z )=xy' +xz+x' y+ yz+x' z '+ y ' z' ( y' . y)=0
    ( x+ y+z ' )(x '+ y '+z )=xy ' +x ' y +xz+x ' z '+ yz+ y ' z'
    ( x+ y+z ' )(x '+ y '+z )=( x ⊕ y )+( x ⊕ z )'+( y⊕ z )'

    Problem 2.3: Simplify the following Boolean expression to minimum number of literals.
    a) ABC + A ' B+ ABC '
    Sol:
    ABC + A ' B+ ABC '= ABC + ABC '+ A ' B
    ABC + A ' B+ ABC '= AB(C+C ' )+ A ' B
    ABC + A ' B+ ABC '= AB+ A ' B
    ABC + A ' B+ ABC '=B( A+ A ' )
    ABC + A ' B+ ABC '=B

    b) x' yz+xz
    Sol:
    x ' yz +xz=z ( x ' y+ x )
    x ' yz+xz=z ( x ' +x )( x+ y )
    x ' yz+xz=z ( x + y )

    c) ( x+ y)' ( x'+ y' )


    Sol:
    ( x+ y)' ( x'+ y' )=( x' y ' )(x '+ y ' )

    Page 5 of 11
    ( x+ y)' ( x'+ y' )=( x' x' y'+ x' y ' y' )
    ( x+ y)' ( x'+ y' )=( x' y '+x' y' )
    ( x+ y)' ( x'+ y' )=x ' y'

    d) xy +x (wz+wz ' )
    Sol:
    xy + x (wz+ wz ' )=xy + xwz+xwz '
    xy + x (wz+wz ' )=x ( y+wz+ wz ' )
    xy +x (wz+wz ' )=x ( y+w( z+ z' ))
    xy +x (wz+wz ' )=x ( y+w )

    e) (BC '+ A ' D)( AB'+CD' )


    Sol:
    (BC '+ A ' D)( AB'+CD' )=BC ' AB '+BC ' CD' +A ' DAB '+ A ' DCD '
    (BC '+ A ' D)( AB'+CD' )= A( BB' )C '+B(C ' C )D '+( A ' A ) DB'+ A ' C ( DD' )
    (BC '+ A ' D)( AB'+CD' )= A(0)C '+B(0)D '+(0)DB' +A ' C(0)
    (BC '+ A ' D)( AB'+CD' )=0

    f) ( x+ y'+z ' )( x'+z ' )


    Sol:
    ( x+ y'+z ' )( x'+z ' )=xx' +xz'+ x' y '+ y ' z'+ x' z' +z' z '
    ( x+ y'+z ' )( x'+z ' )=0+xz '+x' y'+ y' z '+x' z '+z '
    ( x+ y'+z ' )( x'+z ' )=xz' +x' z '+x' y '+ y' z' +z'
    ( x+ y'+z ' )( x'+z ' )=z' ( x+x ' )+x ' y '+ y ' z'+z '
    ( x+ y'+z ' )( x'+z ' )=z'+ x' y '+ y ' z'+ z'
    ( x+ y'+z ' )( x'+z ' )=z'+ z'+x ' y '+ y ' z'
    ( x+ y'+z ' )( x'+z ' )=z'+ x' y '+ y ' z'
    ( x+ y'+z ' )( x'+z ' )=z'+ y' z '+x ' y'

    Page 6 of 11
    ( x+ y'+z ' )( x'+z ' )=z' (1+ y' )+x' y '
    ( x+ y'+z ' )( x'+z ' )=z' (1)+x' y '
    ( x+ y'+z ' )( x'+z ' )=z'+ x' y '

    Problem: 2.4: Reduce the following Boolean expressions to the indicated number of literals.

    a)
    Sol:
    A ' C '+ ABC + AC '= A ' C '+ AC '+ ABC
    A ' C '+ ABC + AC '=C '( A '+ A )+ ABC
    A ' C '+ ABC+ AC '=C '+ ABC
    A ' C '+ ABC+ AC '= AB+C '

    b)
    Sol:
    ( x ' y '+z)'+z+xy+wz=( x ' y ')' z' +z+ xy+wz
    ( x ' y '+z)'+z+xy+wz=( x ' y ')' z' +z+ xy+wz
    ( x ' y '+z )'+z +xy +wz=[(x + y )z '+z ]+xy +wz
    ( x ' y '+ z)'+z +xy +wz=( z+ z ' )( z+ x + y )+xy + wz
    ( x ' y '+z )'+z +xy+wz=z +x + y +xy+wz
    ( x ' y '+z )'+z +xy +wz=z +wz +x+ xy+ y
    ( x ' y '+z)'+z+xy +wz=z(1+w )+x (1+ y )+ y
    ( x ' y '+z )'+z +xy+wz=z(1)+x (1)+ y
    ( x ' y '+z )'+ z +xy +wz=x + y + z

    c)
    Sol:

    Page 7 of 11
    A ' B (D '+C ' D)+B( A+ A ' CD)=A ' BD '+ A ' BC' D+ AB+ A ' BCD
    A ' B (D '+C ' D)+B( A+ A ' CD)=B [ A ' D '+ A ' C ' D+ A+ A ' CD ]
    A ' B (D '+C ' D)+B( A+ A ' CD)=B [ A ' C ' D+ A ' CD +A ' D' +A ]
    A ' B (D '+C ' D)+B( A+ A ' CD)=B [ A ' D(C '+C )+ A ' D '+ A ]
    A ' B (D '+C ' D)+B( A+ A ' CD )=B [ A ' D+ A ' D '+ A ]
    A ' B (D '+C ' D)+B( A+ A ' CD )=B [ A '( D+D ' )+A ]
    A ' B (D '+C ' D)+B( A+ A ' CD)=B [ A '+ A ]
    A ' B (D '+C ' D)+B( A+ A ' CD)=B

    d)
    Sol:
    ( A '+C )( A '+C ' )( A+B+C ' D )=( A ' A '+ A ' C '+ A ' C+CC ')( A+B+C ' D)
    ( A '+C )( A '+C ' )( A+B+C ' D )=( A ' +A ' C '+ A ' C )( A+B+C ' D )
    ( A '+C )( A '+C ' )( A+B+C ' D )=( A ' +A '(C '+C ))( A +B+C ' D )
    ( A '+C )( A '+C ' )( A+B+C ' D )=( A ' +A ')( A+B+C ' D)
    ( A '+C )( A '+C ' )( A+B+C ' D )= A '( A+B+C ' D)
    ( A '+C )( A '+C ' )( A+B+C ' D )= A ' A+ A ' B+ A ' C ' D
    ( A '+C )( A '+C ' )( A+B+C ' D )= A '( B+C ' D )

    e)
    Sol:
    ABCD+ A ' BD + ABC ' D= ABCD+ABC ' D+ A ' BD
    ABCD+ A ' BD + ABC ' D= ABD(C+C ' )+ A ' BD
    ABCD+ A ' BD+ ABC ' D= ABD+ A ' BD
    ABCD+ A ' BD+ ABC ' D=BD( A+ A ' )
    ABCD+ A ' BD+ ABC ' D=BD

    Problem 2.5: Draw the logic diagrams of the circuits that implement the original and simplified
    expressions in Problem 2.2.
    a) Original expression Simplified expression

    Page 8 of 11
    F=xy+xy' F=x

    b) Original expression Simplified expression


    F=( x + y )( x + y ' ) F=x

    c) Original expression Simplified expression


    F=xyz+ x' y+xyz ' F= y

    Page 9 of 11
    d) Original expression Simplified expression
    F=( A+B )' ( A ' +B ' )' F=0

    e) Original expression Simplified expression


    F=xyz' +x' yz+xyz+x ' yz' F= y

    f) Original expression Simplified expression

    Page 10 of 11
    F=( x + y +z ' )( x '+ y ' +z ) F=( x ⊕ y )+( x ⊕ z )'+( y ⊕ z )'

    Page 11 of 11

    You might also like