Which statement describes how a truth table is used for a boolean expression?

• A. It shows the truth value of a boolean expression for every combination of inputs.
• B. It lists all comments in the code.
• C. It shows memory addresses of variables.
• D. It defines the syntax of the language.

Answer: (A)

A truth table records the output of a boolean expression for every possible set of input values. The idea is to list all input combinations and show the resulting truth value (true or false) for each one, so you can see exactly how the expression behaves across all scenarios. For example, with two inputs there are four combinations, and the table will show what the expression yields for each pair of inputs. This helps you verify logic and understand how changing inputs affects the result, and it’s especially useful when designing circuits or simplifying expressions. The other options don’t fit because a truth table is not about code comments, memory addresses, or language syntax.