logo

CuriousTab

CuriousTab

Discussion

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

  • The truth table for the SOP expression The truth table for the SOP expression has how many input combinations? 1 2 4 8 has how many input combinations?


  • Options
  • A. 1
  • B. 2
  • C. 4
  • D. 8

  • Correct Answer
  • 8 

    • Boolean Algebra and Logic Simplification problems

    Search Results

    • 1. 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
    • 2. Derive the Boolean expression for the logic circuit shown below:


    • Options
    • A.
    • B.
    • C.
    • D.
      • Discuss
    • 3. Which Boolean algebra property allows us to group operands in an expression in any order without affecting the results of the operation [for example, A + B = B + A]?

    • Options
    • A. associative
    • B. commutative
    • C. Boolean
    • D. distributive
      • Discuss
    • 4. Which of the following is an important feature of the sum-of-products (SOP) form of expression?

    • Options
    • A. All logic circuits are reduced to nothing more than simple AND and OR gates.
    • B. The delay times are greatly reduced over other forms.
    • C. No signal must pass through more than two gates, not including inverters.
    • D. The maximum number of gates that any signal must pass through is reduced by a factor of two.
      • Discuss
    • 5. Applying DeMorgan's theorem to the expression , we get ________

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

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

    Comments

    There are no comments.
Enter a new Comment




Aptitude

Engineering

Programming

Reasoning

Links

Copyright ©CuriousTab. All rights reserved.