Scribd Logo
Upload

Welcome to Scribd!

  • Lesson 4 2 - DeMorgan Theorem1

    Uploaded by

    Varatha Raj
    21 views9 pages
    DeMorgan's Theorems state that: 1) The complement of an AND operation is the OR of the complements. 2) The complement of an OR operation is the AND of the complements. They allow logic expressions containing ANDs and ORs to be transformed by changing the operators and inverting variables. An example transforms a complex expression into the single term AC B using repeated applications of DeMorgan's rules and algebraic identities.

    Original Description:

    Original Title

    Lesson_4_2--DeMorgan_Theorem1

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    DeMorgan's Theorems state that: 1) The complement of an AND operation is the OR of the complements. 2) The complement of an OR operation is the AND of the complements. They allow logic expressions containing ANDs and ORs to be transformed by changing the operators and inverting variables. An example transforms a complex expression into the single term AC B using repeated applications of DeMorgan's rules and algebraic identities.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    21 views9 pages

    Lesson 4 2 - DeMorgan Theorem1

    Uploaded by

    Varatha Raj
    DeMorgan's Theorems state that: 1) The complement of an AND operation is the OR of the complements. 2) The complement of an OR operation is the AND of the complements. They allow logic expressions containing ANDs and ORs to be transformed by changing the operators and inverting variables. An example transforms a complex expression into the single term AC B using repeated applications of DeMorgan's rules and algebraic identities.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 9

    DeMorgan’s Theorems

    DeMorgan’s Theorem #1
    A · B = A + B
    A B AB AB A B A+B
    0 0 0 1 1 1 1
    0 1 0 1 1 0 1
    1 0 0 1 0 1 1
    1 1 1 0 0 0 0

    EQUAL
    DeMorgan’s Theorem #2
    A + B = A · B

    A B A+B A+B A B AxB


    0 0 0 1 1 1 1
    0 1 1 0 1 0 0
    1 0 1 0 0 1 0
    1 1 1 0 0 0 0

    EQUAL
    DeMorgan’s Theorem #1
    A · B = A + B
    A A

    B
    = B

    Invert output of an Invert the inputs of an


    AND gate OR gate
    DeMorgan’s Theorem #2
    A + B = A · B
    A A

    B
    = B

    Invert output of an Invert the inputs of an


    OR gate AND gate
    DeMorganizing an Expression

    ( AC )  ( BC )  ( A  C )( BC )  X
    DeMorg. ( AC )( BC )(( A  C )( BC ))  X
    A A ( AC )( BC )(( A  C )( BC ))  X
    DeMorg. ( AC )( B  C )(( A  C )( BC ))  X
    Dist. ( AC B  AC C )(( A  C )( BC ))  X
    DeMorganizing an Expression

    ( AC B  AC C )(( A  C )( BC ))  X

    AA  0 ( AC B  A0)(( A  C )( BC ))  X
    A0  0 ( AC B  0)(( A  C )( BC ))  X
    A 0  A ( AC B )(( A  C )( BC ))  X
    DeMorg ( AC B)(( A  C )  ( BC ))  X
    DeMorganizing an Expression

    ( AC B )(( A  C )  ( BC ))  X

    DeMorg ( AC B )(( AC )  ( B  C ))  X
    Assoc. ( AC B )( AC  B  C )  X
    Dist. AC B AC  AC B B  AC BC  X
    A0  0 0C BC  AC B B  AB0  X
    A 0  A 0  AC B B  0  X
    DeMorganizing an Expression

    0  AC B B  0  X

    A 0  A AC B B  X

    AA  A AC B  X

    You might also like