Online TestK-Map Simplification Objective Questions K-Map Simplification Objective Questions Digital Electronics Objective Questions 0% The systematic reduction of logic circuits is accomplished by: Symbolic reduction TTL logic Using Boolean algebra Using a truth table Correct! Wrong! - Continue >> Looping on a K-map always results in the elimination of Variables that remain unchanged within the loop Variables within the loop that appear only in their uncomplemented form Variables within the loop that appear in both complemented and uncomplemented form Variables within the loop that appear only in their complemented form Correct! Wrong! - Continue >> Which statement below best describes a Karnaugh map? Variable complements can be eliminated by using Karnaugh maps It is simply a rearranged truth table The Karnaugh map eliminates the need for using NAND and NOR gates A Karnaugh map can be used to replace Boolean rules Correct! Wrong! - Continue >> Each “0” 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 >> Which of the following statements accurately represents the two BEST methods of logic circuit simplification? Boolean algebra and Karnaugh mapping Boolean algebra and actual circuit trial and error evaluation Actual circuit trial and error evaluation and waveform analysis Karnaugh mapping and circuit waveform analysis Correct! Wrong! - Continue >> 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 maximum number of gates that any signal must pass through is reduced by a factor of two The delay times are greatly reduced over other forms No signal must pass through more than two gates, not including inverters 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 A Karnaugh map DeMorgan’s second theorem The associative law of multiplication Correct! Wrong! - Continue >> The Boolean expression Y = (AB)’ is logically equivalent to what single gate? OR NAND NOR AND Correct! Wrong! - Continue >> Each “1” entry in a K-map square represents: A LOW output for all possible HIGH input conditions A HIGH output on the truth table for all LOW input combinations A DON’T CARE condition for all possible input truth table combinations A HIGH for each input truth table condition that produces a HIGH output Correct! Wrong! - Continue >> Which of the examples below expresses the commutative law of multiplication? A • B = B • A A • B = B + A A + B = B + A A • (B • C) = (A • B) • C 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 *(CD) (A * B)(C * D) Correct! Wrong! - Continue >> 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 >> 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 ↺ PLAY AGAIN ! Share With Your Friends Facebook Twitter LinkedIn Pinterest Email WhatsApp
