Construct a fresh CM after Lesson 9

A system accepts when A or B is true, provided C is false. The three inputs are independent Boolean facts.

Record your first response, explanation and time before opening a key. There is no countdown. Use paper or your own scratch file; this page does not save responses.

1. Write the Boolean rule with explicit parentheses.
2. Use rows [A] and columns [B,C], in false-first order. Construct the complete 2×4 matrix.
3. Predict the result for ABC=101 directly from the rule, then give its zero-based row and column address.
4. Use rows [A,B] and columns [C]. Construct the new matrix and locate the same assignment.
5. Check all eight assignments independently from the Boolean rule. Explain what the new partition changes and what it preserves.

Binary address reference · Record your attempt with the rubric · Lesson 09