logo

CuriousTab

CuriousTab

Discussion


Home Digital Electronics Combinational Logic Circuits Comments

  • Question
  • 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.

  • Correct Answer
  • Karnaugh maps provide a visual approach to simplifying Boolean expressions. 


  • Combinational Logic Circuits problems


    Search Results


    • 1. 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
    • 2. 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
    • Discuss
    • 3. Which logic gate does this truth table describe?


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


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


    • Options
    • A. a
    • B. b
    • C. c
    • D. d
    • Discuss
    • 6. 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
    • 7. Convert BCD 0001 0111 to binary.

    • Options
    • A. 10101
    • B. 10010
    • C. 10001
    • D. 11000
    • Discuss
    • 8. 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
    • 9. Each "1" entry in a K-map square represents:

    • Options
    • A. a HIGH for each input truth table condition that produces a HIGH output.
    • B. a HIGH output on the truth table for all LOW input combinations.
    • C. a LOW output for all possible HIGH input conditions.
    • D. a DON'T CARE condition for all possible input truth table combinations.
    • Discuss
    • 10. A certain BCD-to-decimal decoder has active-HIGH inputs and active-LOW outputs. Which output goes LOW when the inputs are 1001?

    • Options
    • A. 0
    • B. 3
    • C. 9
    • D. None. All outputs are HIGH.
    • Discuss


    Comments

    Avatar
    Etedott
    Nickel JC, Gilling P, Tammela TL, Morrill B, Wilson TH, Rittmaster RSA Review of the Clinical Use of Cranberry Juice, 160, p


Enter a new Comment