logo

CuriousTab

CuriousTab

Boolean Algebra and Logic Simplification problems


  • 1. 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
  • 2. Convert the following SOP expression to an equivalent POS expression.Digital Electronics Boolean Algebra and Logic Simplification: Convert the following SOP expression to an equivalent POS expression.

  • Options
  • A.
  • B.
  • C.
  • D.
  • Discuss
  • 3. For the SOP expression Digital Electronics Boolean Algebra and Logic Simplification: 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
  • 4. 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
  • 5. 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
  • 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 Digital Electronics Boolean Algebra and Logic Simplification: For the SOP expression , how many 1s are in the truth table's output column?

  • Options
  • A. 1
  • B. 2
  • C. 3
  • D. 5
  • Also asked in: Bank Exams

  • 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 Digital Electronics Boolean Algebra and Logic Simplification: 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

First 2 3 4 5 6 7 8