Difficulty: Easy
Correct Answer: a HIGH for each input truth table condition that produces a HIGH output.
Explanation:
Introduction / Context:
Karnaugh maps are populated with 1s, 0s, and sometimes Xs (don’t care) to represent the output of a Boolean function for every input combination. Understanding exactly what a '1' means is essential for forming correct groups when obtaining a minimized sum-of-products expression.
Given Data / Assumptions:
Concept / Approach:
For SOP, we group adjacent 1s (including wrap-around) in sizes of 2^k to form product terms that evaluate to 1 for those input combinations. Each 1 corresponds to a minterm in the truth table where the function’s output is HIGH.
Step-by-Step Solution:
Verification / Alternative check:
Reconstruct the truth table from the minimized SOP and verify that it yields 1 for exactly the minterms marked by 1s in the K-map and 0 elsewhere (except Xs which are don’t care conditions).
Why Other Options Are Wrong:
Common Pitfalls:
Final Answer:
a HIGH for each input truth table condition that produces a HIGH output.
Discussion & Comments