Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    Assignment

    Uploaded by

    Mehrez Saafi
    1. The document presents truth tables for two logic gate expressions: (a) X = A+B.B.C and (b) X = (A.B.C) + (A.B.C) + (A.B.D). 2. It states that if X=1 when A=1 and B=1, then X = (A + B).C, but if X=0, then X = (A ⊕ B).C. 3. It provides logic gate diagrams for implementing X-OR and X-NOR using NAND and NOR gates.

    Copyright:

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

    Assignment

    Uploaded by

    Mehrez Saafi
    20 views2 pages
    1. The document presents truth tables for two logic gate expressions: (a) X = A+B.B.C and (b) X = (A.B.C) + (A.B.C) + (A.B.D). 2. It states that if X=1 when A=1 and B=1, then X = (A + B).C, but if X=0, then X = (A ⊕ B).C. 3. It provides logic gate diagrams for implementing X-OR and X-NOR using NAND and NOR gates.

    Original Description:

    logic gate aasignment

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document presents truth tables for two logic gate expressions: (a) X = A+B.B.C and (b) X = (A.B.C) + (A.B.C) + (A.B.D). 2. It states that if X=1 when A=1 and B=1, then X = (A + B).C, but if X=0, then X = (A ⊕ B).C. 3. It provides logic gate diagrams for implementing X-OR and X-NOR using NAND and NOR gates.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    20 views2 pages

    Assignment

    Uploaded by

    Mehrez Saafi
    1. The document presents truth tables for two logic gate expressions: (a) X = A+B.B.C and (b) X = (A.B.C) + (A.B.C) + (A.B.D). 2. It states that if X=1 when A=1 and B=1, then X = (A + B).C, but if X=0, then X = (A ⊕ B).C. 3. It provides logic gate diagrams for implementing X-OR and X-NOR using NAND and NOR gates.

    Copyright:

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

    1. (a): X = A+B . B . C = A . B . B . C = A . B .

    Truth Table:
    A B C X
    0 0 0 0
    0 0 1 0
    0 1 0 0
    0 1 1 0
    1 0 0 0
    1 0 1 0
    1 1 0 0
    1 1 1 1

    (b): X = (A . B . C) + (A . B . C) + (A . B . D)
    = A . B . C . (D + D) + A . B . C . (D + D) + A . B . D . (C + C)
    = (A . B . C . D) + (A . B . C . D) + (A . B . C . D) + (A . B . C . D) + (A . B .
    C . D) +(A . B . C . D)
    = (A . B . C . D) + (A . B . C . D) + (A . B . C . D) + (A . B . C . D) + (A . B . C . D)

    Truth Table:
    A B C D X
    0 0 0 0 1
    0 0 0 1 1
    0 0 1 0 0
    0 0 1 1 1
    0 1 0 0 0
    0 1 0 1 0
    0 1 1 0 0
    0 1 1 1 0
    1 0 0 0 1
    1 0 0 1 1
    1 0 1 0 0
    1 0 1 1 0
    1 1 0 0 0
    1 1 0 1 0
    1 1 1 0 0
    1 1 1 1 0
    2. Two cases are possible:
     If X=1 when A=1 and B=1, then X = (A + B) . C

     If X=0 when A=1 and B=1, then X = (A ⊕ B) . C

    3.  X-OR using NAND:

    X=A⊕B

     X-OR using NOR:

    X=A⊕B

     X-NOR using NAND:

    X=A⊕B

     X-NOR using NOR:

    X=A⊕B

    You might also like