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. What is the primary motivation for using Boolean algebra to simplify logic expressions?

    • Options
    • A. It may make it easier to understand the overall function of the circuit.
    • B. It may reduce the number of gates.
    • C. It may reduce the number of inputs required.
    • D. all of the above
      • Discuss
    • 2. When grouping cells within a K-map, the cells must be combined in groups of ________.

    • Options
    • A. 2s
    • B. 1, 2, 4, 8, etc.
    • C. 4s
    • D. 3s
      • Discuss
    • 3. Which of the following expressions is in the sum-of-products (SOP) form?

    • Options
    • A. (A + B)(C + D)
    • B. (A)B(CD)
    • C. AB(CD)
    • D. AB + CD
      • Discuss
    • 4. The truth table for the SOP expression has how many input combinations?

    • Options
    • A. 1
    • B. 2
    • C. 4
    • D. 8
      • Discuss
    • 5. An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________ gate.

    • Options
    • A. NOT
    • B. OR
    • C. NOR
    • D. NAND
      • Discuss
    • 6. Which of the examples below expresses the distributive law of Boolean algebra?

    • Options
    • A. (A + B) + C = A + (B + C)
    • B. A(B + C) = AB + AC
    • C. A + (B + C) = AB + AC
    • D. A(BC) = (AB) + C
      • Discuss
    • 7. Derive the Boolean expression for the logic circuit shown below:


    • Options
    • A.
    • B.
    • C.
    • D.
      • Discuss
    • 8. Which is the correct logic function for this PAL diagram?


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

    Comments

    There are no comments.
Enter a new Comment




Aptitude

Engineering

Programming

Reasoning

Links

Copyright ©CuriousTab. All rights reserved.