logo

CuriousTab

CuriousTab

Discussion

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

  • Applying DeMorgan's theorem to the expression Applying DeMorgan's theorem to the expression , we get ________., we get ________.


  • Options
  • A. Applying DeMorgan's theorem to the expression , we get ________.
  • B. Applying DeMorgan's theorem to the expression , we get ________.
  • C. Applying DeMorgan's theorem to the expression , we get ________.
  • D. Applying DeMorgan's theorem to the expression , we get ________.

  • Correct Answer
  •  

    • Boolean Algebra and Logic Simplification problems

    Search Results

    • 1. Applying the distributive law to the expression , we get ________.

    • Options
    • A.
    • B.
    • C.
    • D.
      • Discuss
    • 2. When 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 DeMorgan's theorem to the expression , we get ________.

    • Options
    • A.
    • B.
    • C.
    • D.
      • Discuss
    • 4. Which of the examples below expresses the commutative law of multiplication?

    • Options
    • A. A + B = B + A
    • B. AB = B + A
    • C. AB = BA
    • D. AB = A × B
      • Discuss
    • 5. Which statement below best describes a Karnaugh map?

    • Options
    • A. A Karnaugh map can be used to replace Boolean rules.
    • B. The Karnaugh map eliminates the need for using NAND and NOR gates.
    • C. Variable complements can be eliminated by using Karnaugh maps.
    • D. Karnaugh maps provide a cookbook approach to simplifying Boolean expressions.
      • Discuss
    • 6. 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
    • 7. A truth table for the SOP expression has how many input combinations?

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

    • Options
    • A. True
    • B. False
      • Discuss
    • 9. Mapping the SOP expression , we get ________.


    • Options
    • A. (A)
    • B. (B)
    • C. (C)
    • D. (D)
      • Discuss
    • 10. 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

    Comments

    There are no comments.
Enter a new Comment




Aptitude

Engineering

Programming

Reasoning

Links

Copyright ©CuriousTab. All rights reserved.