In Boolean algebra, a minterm is best described as a

In Boolean algebra, a minterm is best described as a

• A. Represents exactly one input combination
• B. Represents all input combinations
• C. Covers multiple input combinations
• D. Represents an output value independent of inputs

Answer: (A)

A minterm is a canonical product term that uses every input variable in either true or complemented form, chosen so that the term is true for exactly one specific input combination. Because each variable appears in the product, only that one combination makes all literals evaluate to 1, while any other combination makes at least one literal 0 and the whole term 0. So a minterm corresponds to one row in the truth table. For two inputs, the minterms are A·B, A'·B, A·B', and A'·B', each true for exactly its own input pair. That’s why the correct description is that a minterm represents exactly one input combination.

A minterm is a canonical product term that uses every input variable in either true or complemented form, chosen so that the term is true for exactly one specific input combination. Because each variable appears in the product, only that one combination makes all literals evaluate to 1, while any other combination makes at least one literal 0 and the whole term 0. So a minterm corresponds to one row in the truth table. For two inputs, the minterms are A·B, A'·B, A·B', and A'·B', each true for exactly its own input pair. That’s why the correct description is that a minterm represents exactly one input combination.