logo

CuriousTab

CuriousTab

Boolean Algebra and Logic Simplification problems

  • 1. Applying DeMorgan's theorem to the expression Digital Electronics Boolean Algebra and Logic Simplification: Applying DeMorgan's theorem to the expression, we get ________.

  • Options
  • A.
  • B.
  • C.
  • D.
    • Discuss
  • 2. When Digital Electronics Boolean Algebra and Logic Simplification: When are the inputs to are the inputs to a NAND gate, according to De Morgan's theorem, the output expression could be:

  • Options
  • A. X = A + B
  • B.
  • C. X = (A)(B)
  • D.
    • Discuss
  • 3. Applying the distributive law to the expression Digital Electronics Boolean Algebra and Logic Simplification: Applying the distributive law to the expression, we get ________.

  • Options
  • A.
  • B.
  • C.
  • D.
    • Discuss
  • 4. Applying DeMorgan's theorem to the expression Digital Electronics Boolean Algebra and Logic Simplification: Applying DeMorgan's theorem to the expression, we get ________.

  • Options
  • A.
  • B.
  • C.
  • D.
    • Discuss
  • 5. Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as a BCD-to-decimal converter. These result in ________terms in the K-map and can be treated as either ________ or ________, in order to ________ the resulting term.

  • Options
  • A. don't care, 1s, 0s, simplify
  • B. spurious, ANDs, ORs, eliminate
  • C. duplicate, 1s, 0s, verify
  • D. spurious, 1s, 0s, simplify
    • Discuss
  • 6. A truth table for the SOP expression Digital Electronics Boolean Algebra and Logic Simplification: A truth table for the SOP expression has how many input combinations?

  • Options
  • A. 1
  • B. 2
  • C. 4
  • D. 8
    • Discuss
  • 7. AC + ABC = AC

  • Options
  • A. True
  • B. False
    • Discuss
  • 8. Mapping the SOP expression Digital Electronics Boolean Algebra and Logic Simplification: Mapping the SOP expression, we get ________.

    Digital Electronics Boolean Algebra and Logic Simplification: Mapping the SOP expression


  • Options
  • A. (A)
  • B. (B)
  • C. (C)
  • D. (D)
    • Discuss
  • 9. Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.

  • Options
  • A. F = ABD + ABC + CD
  • B. F = CD + AD
  • C. F = BC + AB
  • D. F = AC + AD
    • Discuss
  • 10. Mapping the standard SOP expression Digital Electronics Boolean Algebra and Logic Simplification: Mapping the standard SOP expression, we get

    Digital Electronics Boolean Algebra and Logic Simplification: Mapping the standard SOP expression


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

First 2 3 4 5 6 7 8

Aptitude

Engineering

Programming

Reasoning

Links

Copyright ©CuriousTab. All rights reserved.