logo

CuriousTab

CuriousTab

Discussion


Home Digital Electronics Describing Logic Circuits Comments

  • Question
  • Which of the examples below expresses the distributive law?


  • 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

  • Correct Answer
  • A(B + C) = AB + AC 


  • Describing Logic Circuits problems


    Search Results


    • 1. Which logic gate does this truth table describe?


    • Options
    • A. AND
    • B. OR
    • C. NAND
    • D. NOR
    • Discuss
    • 2. Which of the figures given below represents a NAND gate?


    • Options
    • A. a
    • B. b
    • C. c
    • D. d
    • Discuss
    • 3. Which timing diagram shown below is correct for an inverter?


    • Options
    • A. a
    • B. b
    • C. c
    • D. d
    • Discuss
    • 4. Simplify the expression using DeMorgan's theorems.

    • Options
    • A.
    • B.
    • C.
    • D.
    • Discuss
    • 5. For a 3-input NAND gate, with the input waveforms as shown below, which output waveform is correct?


    • Options
    • A. a
    • B. b
    • C. c
    • D. d
    • Discuss
    • 6. A small circle on the output of a logic gate is used to represent the:

    • Options
    • A. Comparator operation.
    • B. OR operation.
    • C. NOT operation.
    • D. AND operation.
    • Discuss
    • 7. 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 visual approach to simplifying Boolean expressions.
    • Discuss
    • 8. The binary numbers A = 1100 and B = 1001 are applied to the inputs of a comparator. What are the output levels?

    • Options
    • A. A > B = 1, A < B = 0, A < B = 1
    • B. A > B = 0, A < B = 1, A = B = 0
    • C. A > B = 1, A < B = 0, A = B = 0
    • D. A > B = 0, A < B = 1, A = B = 1
    • Discuss
    • 9. Convert BCD 0001 0111 to binary.

    • Options
    • A. 10101
    • B. 10010
    • C. 10001
    • D. 11000
    • Discuss
    • 10. Which of the following statements accurately represents the two BEST methods of logic circuit simplification?

    • Options
    • A. Boolean algebra and Karnaugh mapping
    • B. Karnaugh mapping and circuit waveform analysis
    • C. Actual circuit trial and error evaluation and waveform analysis
    • D. Boolean algebra and actual circuit trial and error evaluation
    • Discuss


    Comments

    There are no comments.

Enter a new Comment