K-Map Simplification MCQ

Test your knowledge with important K-Map Simplification MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more K-Map Simplification MCQs at Bissoy

• Which of the following expressions is in the product-of-sums form?
  ক

  (A + B)(C + D)

  খ

  (AB)(CD)

  গ

  AB(CD)

  ঘ

  AB + CD
• Which of the following is an important feature of the sum-of-products form of expressions?
  ক

  All logic circuits are reduced to nothing more than simple AND and OR operations

  খ

  The delay times are greatly reduced over other forms

  গ

  No signal must pass through more than two gates, not including inverters

  ঘ

  The maximum number of gates that any signal must pass through is reduced by a factor of two
• Which of the following expressions is in the sum-of-products form?
  ক

  (A + B)(C + D)

  খ

  (A * B)(C * D)

  গ

  A* B *(CD)

  ঘ

  A * B + C * D
• Looping on a K-map always results in the elimination of __________
  ক

  Variables within the loop that appear only in their complemented form

  খ

  Variables that remain unchanged within the loop

  গ

  Variables within the loop that appear in both complemented and uncomplemented form

  ঘ

  Variables within the loop that appear only in their uncomplemented form
• Which of the following statements accurately represents the two BEST methods of logic circuit simplification?
  ক

  Actual circuit trial and error evaluation and waveform analysis

  খ

  Karnaugh mapping and circuit waveform analysis

  গ

  Boolean algebra and Karnaugh mapping

  ঘ

  Boolean algebra and actual circuit trial and error evaluation
• Each “0” entry in a K-map square represents _______________
  ক

  A HIGH for each input truth table condition that produces a HIGH output

  খ

  A HIGH output on the truth table for all LOW input combinations

  গ

  A LOW output for all possible HIGH input conditions

  ঘ

  A DON’T CARE condition for all possible input truth table combinations
• Each “1” entry in a K-map square represents _______________
  ক

  A HIGH for each input truth table condition that produces a HIGH output

  খ

  A HIGH output on the truth table for all LOW input combinations

  গ

  A LOW output for all possible HIGH input conditions

  ঘ

  A DON’T CARE condition for all possible input truth table combinations
• The systematic reduction of logic circuits is accomplished by _______________
  ক

  Symbolic reduction

  খ

  TTL logic

  গ

  Using Boolean algebra

  ঘ

  Using a truth table
• The observation that a bubbled input OR gate is interchangeable with a bubbled output AND gate is referred to as __________________
  ক

  A Karnaugh map

  খ

  DeMorgan’s second theorem

  গ

  The commutative law of addition

  ঘ

  The associative law of multiplication
• The Boolean expression Y = (AB)’ is logically equivalent to what single gate?
  ক

  NAND

  খ

  NOR

  গ

  AND

  ঘ

  OR
• Which of the examples below expresses the commutative law of multiplication?
  ক

  A + B = B + A

  খ

  A • B = B + A

  গ

  A • (B • C) = (A • B) • C

  ঘ

  A • B = B • A
• Which statement below best describes a Karnaugh map?
  ক

  It is simply a rearranged truth table

  খ

  The Karnaugh map eliminates the need for using NAND and NOR gates

  গ

  Variable complements can be eliminated by using Karnaugh maps

  ঘ

  A Karnaugh map can be used to replace Boolean rules