Scribd Logo
Upload

Welcome to Scribd!

  • Boolean Algebra Homework 2

    Uploaded by

    anastasia.eleftheriou
    10 views1 page
    This document provides instructions for Homework 2 on Boolean expressions. Students are asked to simplify Boolean expressions in (1a), (1b), and (1c), then simplify expressions in (2a) and (2b) while explaining each step. Finally, students must write expressions for the logic circuit shown in (3) without simplifying. The total marks for the homework is 15.

    Original Description:

    Original Title

    Boolean algebra Homework 2

    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
    This document provides instructions for Homework 2 on Boolean expressions. Students are asked to simplify Boolean expressions in (1a), (1b), and (1c), then simplify expressions in (2a) and (2b) while explaining each step. Finally, students must write expressions for the logic circuit shown in (3) without simplifying. The total marks for the homework is 15.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views1 page

    Boolean Algebra Homework 2

    Uploaded by

    anastasia.eleftheriou
    This document provides instructions for Homework 2 on Boolean expressions. Students are asked to simplify Boolean expressions in (1a), (1b), and (1c), then simplify expressions in (2a) and (2b) while explaining each step. Finally, students must write expressions for the logic circuit shown in (3) without simplifying. The total marks for the homework is 15.

    Copyright:

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

    Homework 2 Boolean expressions

    Unit 8 Boolean algebra

    Homework 2 Boolean Expressions

    1. Simplify the following Boolean expressions.


    (a) A ∧ (B ∨ 1) [1]

    (b) ¬ (¬ A ∧ ¬ B) [1]

    (c) (A ∧ A ∧ B) ∨ (A ∧ B ∧ B) [1]

    2. Simplify the following Boolean expressions, explaining each step.


    (a) A ∧ ¬ B ∨ A ∧ ¬ (B ∨ C) [3]

    (b) A ∧ B ∨ A ∧ (B ∨ C) ∨ B ∧ (B ∨ C) [4]

    3. Write expressions for P, Q, R and S and T represented in the following logic circuit. Do not
    simplify the expressions. [5]

    [Total 15 marks]

    You might also like