logo

CuriousTab

CuriousTab

Discussion


Home Digital Electronics Boolean Algebra and Logic Simplification Comments

  • Question
  • How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z)


  • Options
  • A. 1
  • B. 2
  • C. 4
  • D. 5

  • Correct Answer



  • Boolean Algebra and Logic Simplification problems


    Search Results


    • 1. The commutative law of addition and multiplication indicates that:

    • Options
    • A. we can group variables in an AND or in an OR any way we want
    • B. an expression can be expanded by multiplying term by term just the same as in ordinary algebra
    • C. the way we OR or AND two variables is unimportant because the result is the same
    • D. the factoring of Boolean expressions requires the multiplication of product terms that contain like variables
    • Discuss
    • 2. Determine the values of A, B, C, and D that make the product term equal to 1.

    • Options
    • A. A = 0, B = 1, C = 0, D = 1
    • B. A = 0, B = 0, C = 0, D = 1
    • C. A = 1, B = 1, C = 1, D = 1
    • D. A = 0, B = 0, C = 1, D = 0
    • Discuss
    • 3. The systematic reduction of logic circuits is accomplished by:

    • Options
    • A. using Boolean algebra
    • B. symbolic reduction
    • C. TTL logic
    • D. using a truth table
    • Discuss
    • 4. For the SOP expression , how many 1s are in the truth table's output column?

    • Options
    • A. 1
    • B. 2
    • C. 3
    • D. 5
    • Discuss
    • 5. How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z)

    • Options
    • A. 1
    • B. 2
    • C. 4
    • D. 5
    • Discuss
    • 6. The commutative law of Boolean addition states that A + B = A × B.

    • Options
    • A. True
    • B. False
    • Discuss
    • 7. Determine the values of A, B, C, and D that make the sum term equal to zero.

    • Options
    • A. A = 1, B = 0, C = 0, D = 0
    • B. A = 1, B = 0, C = 1, D = 0
    • C. A = 0, B = 1, C = 0, D = 0
    • D. A = 1, B = 0, C = 1, D = 1
    • Discuss
    • 8. A Karnaugh map is a systematic way of reducing which type of expression?

    • Options
    • A. product-of-sums
    • B. exclusive NOR
    • C. sum-of-products
    • D. those with overbars
    • Discuss
    • 9. The Boolean expression is logically equivalent to what single gate?

    • Options
    • A. NAND
    • B. NOR
    • C. AND
    • D. OR
    • Discuss
    • 10. Applying DeMorgan's theorem to the expression , we get ________

    • Options
    • A.
    • B.
    • C.
    • D.
    • Discuss


    Comments

    There are no comments.

Enter a new Comment