Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Experiment 2

    Uploaded by

    RASUL.ZEYNULLA
    The document describes an experiment involving Boolean algebra and logic gates. It provides two examples to simplify Boolean expressions into sum of products or product of sums form. The first expression (A+C)(AD+AD') + AC + C is simplified to A+C. The second expression A'(A+B) + (B+AA)(A+B') is simplified to A'B+B. Truth tables are provided to verify the simplified expressions.

    Copyright:

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

    Experiment 2

    Uploaded by

    RASUL.ZEYNULLA
    5 views4 pages
    The document describes an experiment involving Boolean algebra and logic gates. It provides two examples to simplify Boolean expressions into sum of products or product of sums form. The first expression (A+C)(AD+AD') + AC + C is simplified to A+C. The second expression A'(A+B) + (B+AA)(A+B') is simplified to A'B+B. Truth tables are provided to verify the simplified expressions.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes an experiment involving Boolean algebra and logic gates. It provides two examples to simplify Boolean expressions into sum of products or product of sums form. The first expression (A+C)(AD+AD') + AC + C is simplified to A+C. The second expression A'(A+B) + (B+AA)(A+B') is simplified to A'B+B. Truth tables are provided to verify the simplified expressions.

    Copyright:

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

    Experiment 2

    Uploaded by

    RASUL.ZEYNULLA
    The document describes an experiment involving Boolean algebra and logic gates. It provides two examples to simplify Boolean expressions into sum of products or product of sums form. The first expression (A+C)(AD+AD') + AC + C is simplified to A+C. The second expression A'(A+B) + (B+AA)(A+B') is simplified to A'B+B. Truth tables are provided to verify the simplified expressions.

    Copyright:

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

    Experiment 2.

    2
    Applying NAND, NOR and XOR Gates

    Prepared by: Zeinulla Rassul


    Checked by: Seralieva A.
    Almaty 2024
    Objective:
    To get simplification form of Boolean expression. Convert to Sum of Products or
    Products of Sum.
    Pre-Lab
    1) 𝐹 =(𝐴 + 𝐶)(𝐴𝐷 + 𝐴𝐷′) + 𝐴𝐶 + 𝐶
    a)
    A C D F
    0 0 0 0
    0 0 1 0
    0 1 0 1
    0 1 1 1
    1 0 0 1
    1 0 1 1
    1 1 0 1
    1 1 1 1

    b) Draw the logic diagram, using the original Boolean expression.


    c) Use Boolean algebra to simplify the function to a minimum number of literals.
    F=(A+C)(AD+AD′)+AC+C = (A+C)A(D+D′)+AC+C = (A+C)A(1)+AC+C =
    A+AC+C = A+C(1+A) = A+C
    d) Obtain the truth table of the function from the simplified expression and show
    that it is the same as the one in part a.
    A C F
    0 0 0
    0 1 1
    1 0 1
    1 1 1
    e) Draw the logic diagram from the simplified expression, and compare the total
    number of gates with the diagram of part b.
    Sum of minterms: F(A,B,C,D) = ∑ m(3 ,5 , 7)
    Product of maxterms: F(A,B,C,D) = M(1,2,6)
    2) Sum of minterms: F(A, B, C, D) = ∑ m(3 ,5 , 6) = m3 + m5 + m6

    Product of maxterms: F(A, B, C, D) = M(1, 2, 7)


    In-Lab:
    a)
    A B F
    0 0 1
    0 1 0
    1 0 0
    1 1 1

    b)
    c) F=A′(A+B)+(B+AA)(A+B′)= A′A+A′B+B+B′(A+B) = 0+A′B+B+B′(1) = A
    ′B+B+B′ = A′B+B
    d)
    A B F
    0 0 1
    0 1 0
    1 0 0
    1 1 1

    e) Sum of minterms: F(A, B, C, D) = ∑ m(3 ,5 , 6) = m3 + m5 + m6

    Product of maxterms: F(A, B, C, D) = M(1, 2, 7)


    2)
    (b+d)(a′+b′+c)=ab′+bb′+cb′+ad+bd+cd
    F= ∑ m(1 , 3 , 4 ,5 , 6)
    Post – Lab:

    (A*B)+((B+C)*A)+((B+C)*B) =

    ((A*B)+((B+C)*(C*B)))

    You might also like