Scribd Logo
Upload

Welcome to Scribd!

  • تكليف 1 - دوائر منطقية - ع

    Uploaded by

    abir.abir.arts
    2 views2 pages
    There are 4 chairs labeled A, B, C, D. The output should be 1 if chairs B and C or chairs C and D are both empty. Otherwise, the output should be 0. This problem can be solved using Boolean algebra to express the conditions for an output of 1 as a Boolean expression involving the variables A, B, C, and D.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    There are 4 chairs labeled A, B, C, D. The output should be 1 if chairs B and C or chairs C and D are both empty. Otherwise, the output should be 0. This problem can be solved using Boolean algebra to express the conditions for an output of 1 as a Boolean expression involving the variables A, B, C, and D.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    2 views2 pages

    تكليف 1 - دوائر منطقية - ع

    Uploaded by

    abir.abir.arts
    There are 4 chairs labeled A, B, C, D. The output should be 1 if chairs B and C or chairs C and D are both empty. Otherwise, the output should be 0. This problem can be solved using Boolean algebra to express the conditions for an output of 1 as a Boolean expression involving the variables A, B, C, and D.

    Copyright:

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

    Question:

    If we have four chairs and there are two empty chairs next to each other, I want
    the output to be 1.

    Solution:

    A B C D Output
    0 0 0 0 1
    0 0 0 1 1
    0 0 1 0 1
    0 0 1 1 1
    0 1 0 0 1
    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 1
    1 1 0 1 0
    1 1 1 0 0
    1 1 1 1 0
    SOP:

    = 𝐴̅𝐵̅𝐶̅ 𝐷
    ̅ + 𝐴̅𝐵̅𝐶̅ 𝐷 + 𝐴̅𝐵̅𝐶𝐷
    ̅ + 𝐴̅𝐵̅𝐶𝐷 + 𝐴̅𝐵𝐶̅ 𝐷
    ̅ + 𝐴𝐵̅𝐶̅ 𝐷
    ̅ + 𝐴𝐵̅𝐶̅ 𝐷 + 𝐴𝐵𝐶̅ 𝐷
    ̅

    Boolean Algebra:

    = 𝐴̅𝐵̅𝐶̅ (𝐷
    ̅ + 𝐷) + 𝐴̅𝐵̅𝐶(𝐷 ̅ + 𝐷) + 𝐴𝐵̅𝐶̅ (𝐷
    ̅ + 𝐷) + 𝐵𝐶̅ 𝐷
    ̅ (𝐴̅ + 𝐴)
    = 𝐴̅𝐵̅𝐶̅ + 𝐴̅𝐵̅𝐶 + 𝐴𝐵̅𝐶̅ + 𝐵𝐶̅ 𝐷 ̅
    = 𝐴̅𝐵̅(𝐶̅ + 𝐶) + 𝐴𝐵̅𝐶̅ + 𝐵𝐶̅ 𝐷 ̅
    = 𝐴̅𝐵̅ + 𝐴𝐵̅𝐶̅ + 𝐵𝐶̅ 𝐷̅
    = 𝐵̅(𝐴̅ + 𝐴𝐶̅ ) + 𝐵𝐶̅ 𝐷̅
    = 𝐵̅((𝐴̅ + 𝐴). (𝐴̅ + 𝐶̅ )) + 𝐵𝐶̅ 𝐷 ̅
    = 𝐵̅(𝐴̅ + 𝐶̅ ) + 𝐵𝐶̅ 𝐷
    ̅
    = 𝐵̅𝐴̅ + 𝐵̅𝐶̅ + 𝐵𝐶̅ 𝐷
    ̅
    = ̅̅̅̅̅̅̅̅
    𝐵 + 𝐴 + ̅̅̅̅̅̅̅̅
    𝐵 + 𝐶 + 𝐵(𝐶 ̅̅̅̅̅̅̅̅
    + 𝐷)

    You might also like