What describes the complete mapping of all input combinations to their outputs for a logic gate?

What describes the complete mapping of all input combinations to their outputs for a logic gate?

• A. Boolean Expression
• B. Karnaugh Map
• C. Truth Table
• D. Lookup Table

Answer: (C)

Mapping all input combinations to their outputs for a logic gate is captured by a truth table. It lists every possible input pattern and the corresponding output, giving a complete view of how the gate behaves. For n inputs there are 2^n possible combinations, so the table has 2^n rows, showing exactly what the gate outputs for each case. A Boolean expression describes the rule that defines the output from the inputs, but it isn’t the full enumeration of results. A Karnaugh map derives from the truth table and is used to simplify that rule, not to list every input-output pair. A lookup table can implement the same mapping in hardware or software, but the canonical representation of the complete input-output mapping for a gate is the truth table.

Mapping all input combinations to their outputs for a logic gate is captured by a truth table. It lists every possible input pattern and the corresponding output, giving a complete view of how the gate behaves. For n inputs there are 2^n possible combinations, so the table has 2^n rows, showing exactly what the gate outputs for each case.

A Boolean expression describes the rule that defines the output from the inputs, but it isn’t the full enumeration of results. A Karnaugh map derives from the truth table and is used to simplify that rule, not to list every input-output pair. A lookup table can implement the same mapping in hardware or software, but the canonical representation of the complete input-output mapping for a gate is the truth table.