logo

CuriousTab

CuriousTab

Discussion

Home ‣ Digital Electronics ‣ Boolean Algebra and Logic Simplification Comments
  • Question

  • Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.


  • Options
  • A. LM + MNOPQ
  • B. L + MNO + MPQ
  • C. LM + M + NO + MPQ
  • D. LM + MNO + MPQ

  • Correct Answer
  • LM + MNO + MPQ 

    • Boolean Algebra and Logic Simplification problems

    Search Results

    • 1. An OR gate with schematic "bubbles" on its inputs performs the same functions as a(n)________ gate.

    • Options
    • A. NOR
    • B. OR
    • C. NOT
    • D. NAND
      • Discuss
    • 2. For the SOP expression , how many 0s are in the truth table's output column?

    • Options
    • A. zero
    • B. 1
    • C. 4
    • D. 5
      • Discuss
    • 3. Convert the following SOP expression to an equivalent POS expression.

    • Options
    • A.
    • B.
    • C.
    • D.
      • Discuss
    • 4. The NAND or NOR gates are referred to as "universal" gates because either:

    • Options
    • A. can be found in almost all digital circuits
    • B. can be used to build all the other types of gates
    • C. are used in all countries of the world
    • D. were the first gates to be integrated
      • Discuss
    • 5. Output will be a LOW for any case when one or more inputs are zero for a(n):

    • Options
    • A. OR gate
    • B. NOT gate
    • C. AND gate
    • D. NOR gate
      • Discuss
    • 6. 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
    • 7. 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
    • 8. 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
    • 9. 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
    • 10. 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

    Comments

    There are no comments.
Enter a new Comment




Aptitude

Engineering

Programming

Reasoning

Links

Copyright ©CuriousTab. All rights reserved.