logo

CuriousTab

CuriousTab

Discussion

Home ‣ Digital Electronics ‣ Describing Logic Circuits Comments
  • Question

  • In Boolean algebra, 1 · 0 = 0.


  • Options
  • A. True
  • B. False

  • Correct Answer
  • True 

    • Describing Logic Circuits problems

    Search Results

    • 1. The symbol shown below is an AND gate.


    • Options
    • A. True
    • B. False
      • Discuss
    • 2. The NAND gate is an example of combinational logic.

    • Options
    • A. True
    • B. False
      • Discuss
    • 3. A NAND gate consists of an AND gate and an OR gate connected in series with each other.

    • Options
    • A. True
    • B. False
      • Discuss
    • 4. The timing diagram for a two-input NAND gate is shown below. The gate is working correctly.


    • Options
    • A. True
    • B. False
      • Discuss
    • 5. The effect of an inverted output being connected to the inverting input of another gate is to effectively eliminate one of the inversions, resulting in a single inversion.

    • Options
    • A. True
    • B. False
      • Discuss
    • 6. VHDL is not a new language.

    • Options
    • A. True
    • B. False
      • Discuss
    • 7. A two-input NAND gate has inputs of 1 and 0; the output is 0.

    • Options
    • A. True
    • B. False
      • Discuss
    • 8. The output of a NAND gate is the inverse of the output for an AND gate for all possible input combinations.

    • Options
    • A. True
    • B. False
      • Discuss
    • 9. The commutative law of Boolean addition states that A + B = A · B.

    • Options
    • A. True
    • B. False
      • Discuss
    • 10. Boolean algebra was first applied to the analysis of digital circuits by Claude Shannon at Stanford University.

    • Options
    • A. True
    • B. False
      • Discuss

    Comments

    There are no comments.
Enter a new Comment




Aptitude

Engineering

Programming

Reasoning

Links

Copyright ©CuriousTab. All rights reserved.