Online TestK-Map Simplification Objective Questions K-Map Simplification Objective Questions Digital Electronics Objective Questions 0% Which of the following expressions is in the product-of-sums form? AB(CD) (AB)(CD) AB + CD (A + B)(C + D) Correct!Wrong!- Continue >> Which statement below best describes a Karnaugh map? It is simply a rearranged truth table A Karnaugh map can be used to replace Boolean rules Variable complements can be eliminated by using Karnaugh maps The Karnaugh map eliminates the need for using NAND and NOR gates Correct!Wrong!- Continue >> 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 Correct!Wrong!- Continue >> Each “0” entry in a K-map square represents: A DON’T CARE condition for all possible input truth table combinations A HIGH output on the truth table for all LOW input combinations A HIGH for each input truth table condition that produces a HIGH output A LOW output for all possible HIGH input conditions Correct!Wrong!- Continue >> Each “1” entry in a K-map square represents: A HIGH output on the truth table for all LOW input combinations A HIGH for each input truth table condition that produces a HIGH output A DON’T CARE condition for all possible input truth table combinations A LOW output for all possible HIGH input conditions Correct!Wrong!- Continue >> The systematic reduction of logic circuits is accomplished by: Symbolic reduction Using Boolean algebra TTL logic Using a truth table Correct!Wrong!- Continue >> Which of the following is an important feature of the sum-of-products form of expressions? The maximum number of gates that any signal must pass through is reduced by a factor of two 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 Correct!Wrong!- Continue >> Which of the following expressions is in the sum-of-products form? A * B + C * D (A * B)(C * D) (A + B)(C + D) A* B *(CD) Correct!Wrong!- Continue >> Looping on a K-map always results in the elimination of Variables within the loop that appear only in their uncomplemented form 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 Correct!Wrong!- Continue >> The Boolean expression Y = (AB)’ is logically equivalent to what single gate? NAND NOR OR AND Correct!Wrong!- Continue >> The observation that a bubbled input OR gate is interchangeable with a bubbled output AND gate is referred to as: The commutative law of addition DeMorgan’s second theorem The associative law of multiplication A Karnaugh map Correct!Wrong!- Continue >> Which of the following statements accurately represents the two BEST methods of logic circuit simplification? Boolean algebra and Karnaugh mapping Karnaugh mapping and circuit waveform analysis Actual circuit trial and error evaluation and waveform analysis Boolean algebra and actual circuit trial and error evaluation Correct!Wrong!- Continue >> Share the quiz to show your results ! Facebook Facebook Just tell us who you are to view your results ! Show my results >> K-Map Simplification I got %%score%% of %%total%% right Share your results Facebook Facebook Twitter Google+ ↺ PLAY AGAIN ! Share With Your Friends Facebook Twitter LinkedIn Pinterest Email WhatsApp
