Scribd Logo
Upload

Welcome to Scribd!

  • Chapter 2 Assignment

    Uploaded by

    AB SHOW
    97 views4 pages
    The document provides 10 logic circuit problems involving completing truth tables and expressing logic functions in canonical forms. The problems cover topics such as: 1) Completing truth tables for various logic circuits with 2-4 inputs 2) Writing boolean functions and canonical forms (sum of products, product of sums) for given logic circuits and truth tables 3) Converting between canonical forms (sum of products to product of sums) 4) Expressing standard boolean functions in canonical forms

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides 10 logic circuit problems involving completing truth tables and expressing logic functions in canonical forms. The problems cover topics such as: 1) Completing truth tables for various logic circuits with 2-4 inputs 2) Writing boolean functions and canonical forms (sum of products, product of sums) for given logic circuits and truth tables 3) Converting between canonical forms (sum of products to product of sums) 4) Expressing standard boolean functions in canonical forms

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    97 views4 pages

    Chapter 2 Assignment

    Uploaded by

    AB SHOW
    The document provides 10 logic circuit problems involving completing truth tables and expressing logic functions in canonical forms. The problems cover topics such as: 1) Completing truth tables for various logic circuits with 2-4 inputs 2) Writing boolean functions and canonical forms (sum of products, product of sums) for given logic circuits and truth tables 3) Converting between canonical forms (sum of products to product of sums) 4) Expressing standard boolean functions in canonical forms

    Copyright:

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

    1.

    A Logic circuit has two inputs being X and Y X Y


    Fill in all the possible combinations.

    2. The figure below shows a logic circuit and its incomplete truth table. Complete the below truth
    table.

    A B C Q
    A
    C Q 0 0
    B 0 1
    1 0
    1 1

    3. The figure below shows a logic circuit and its incomplete truth table. Complete its truth table.

    A C A B C D Q
    Q 0 0
    B
    0 1
    D
    1 0
    1 1

    4. The figure below shows a logic circuit and its incomplete truth table. Complete the below truth
    table.
    A A B C D Q
    C
    Q 0
    0

    D 1
    B
    1
    5. The figure below shows a logic circuit and its incomplete truth table. Complete the below truth
    table.
    A
    C A B C D Q
    Q
    0
    B 1
    D
    0
    1

    6. For the logic circuit below complete the truth table.

    A B D
    A
    0 0
    D 0 1
    1 0
    B 1 1
    7. Write the Boolean function for the following logic circuit
    8. Write the canonical pos and sop form for boolean function for the given truth table

    X Y z w F
    0 0 0 0 0
    0 0 0 1 0
    0 0 1 0 1
    0 0 1 1 1
    0 1 0 0 0
    0 1 0 1 1
    0 1 1 0 0
    0 1 1 1 1
    1 0 0 0 0
    1 0 0 1 0
    1 0 1 0 1
    1 0 1 1 1
    1 1 0 0 1
    1 1 0 1 1
    1 1 1 0 1
    1 1 1 1 1

    A B C Output
    0 0 0 1
    0 0 1 0
    0 1 0 1
    0 1 1 0
    1 0 0 0
    1 0 1 1
    1 1 0 1
    1 1 1 0

    9. Convert the following to the other canonical form:

    (a) F (x, y , z) = ∑ (1,3,7) (b) F(A,B,C,D)= ∏ (0,1,2,3,4,6,12)

    10. Convert the following standard Boolean function to the canonical form:

    A. F(A,B,C) = AB + AC' + BC

    B. F(A,B,C) = (A+B).(A+C).(A+C')

    You might also like