Simplifying Boolean expressions: Besides Boolean algebra, another widely used visual method for simplifying sum-of-products (and product-of-sums) expressions is the _____ map.

Introduction / Context:
The Karnaugh map (K-map) is a graphical tool that helps minimize Boolean expressions by grouping adjacent 1s (or 0s) to identify prime implicants. It provides intuition and a low-effort path to simplified SOP or POS forms, especially for 2–6 variables.

Given Data / Assumptions:

• The question mentions sum-of-products; K-maps handle both SOP and POS simplifications.
• We assume Gray code arrangement on rows/columns to preserve adjacency.
• We consider basic digital logic curricula.

Concept / Approach:
By arranging truth-table outputs on a grid with Gray-coded indices, adjacent cells differ by one variable. Grouping 1s in powers of two (1, 2, 4, 8, …) yields simplified terms by eliminating changed variables in the group.

Step-by-Step Solution:
Map minterms onto a K-map grid.Form largest possible power-of-two groups (wrap-around allowed).Write simplified product terms for each group and sum them.

Verification / Alternative check:
Algebraic minimization (consensus theorem, absorption) can confirm the K-map result; both should match.

Why Other Options Are Wrong:
“De Morgan” is a law, not a map. “Standard” and “Schottky” are not simplification maps; Schottky refers to a device/family.

Common Pitfalls:
Missing wrap-around adjacency; making too many small groups instead of maximal ones; forgetting don’t-care utilization.

Final Answer:
Karnaugh.