Computer Science and Digital Literacy · 35 minutes

Suggested grades 9–12 · Unit 1: Algorithms and decision logic · Lesson 2 of 2

Translate a Rule into Boolean Logic

Make grouping explicit and test boundary combinations in a fictional access rule.

Mr. S Teaches · Original starter lesson · HS-CS-02 · Grade range is planning guidance.

Watch, notice, discuss

Video choices for this lesson

2 choices

Preview a video, then choose what fits your learners. “Show to class” opens a larger view; use the player’s play and full-screen controls when you’re ready.

Teacher preview needed. Check the language, level and length before showing. YouTube may show ads or related videos.

After watching

Which input row changes when the grouping of AND and OR changes?

An external player loads only after you choose Preview or Show to class. Playback connects to YouTube. Videos belong to their creators; availability and embedding can change.

Learning objective

Build a truth table and show how two different groupings change a rule’s result.

Before you begin

  • True and false values
  • Reading conditions

Gather your materials

  • Paper and pencil
  • Eight-row truth-table template

Language to know

Boolean value
A truth value, true or false.
conjunction
An AND condition requiring both parts.
disjunction
An inclusive OR condition satisfied by either or both parts.

Understand the concept

Fictional makerspace rule: Admit a visitor when the room is open AND the visitor has either a member card OR a staff pass. Write O AND(C OR P). Parentheses preserve the wording’s grouping. The superficially similar(O AND C) OR P would admit a staff-pass holder even when the room is closed, contradicting the original policy. This is paper logic, not a real access-control implementation.

Teach it step by step

  1. Define O,C and P in words before using symbols.
  2. Translate the rule and draw a two-stage flowchart: check open, then check card-or-pass.
  3. Build all eight truth-table rows systematically rather than testing only favorable cases.
  4. Compare the alternative grouping and identify rows where it contradicts the written rule.

Make the thinking visible

Worked example or model response

If O=false,C=false,P=true, the correct rule is false AND true=false. The alternative is(false AND false) OR true=true. The two expressions differ because the staff pass bypasses the open condition in the alternative.

Guided practice

Complete outputs for O=true with(C,P)=(false,false),(false,true),(true,false),(true,true).

Independent practice

1. State the correct output when O=false,C=true,P=true. 2. Translate“Send a reminder if homework is missing OR a form is missing, AND the contact preference allows reminders” with explicit grouping.

Quick assessment

Why is an inclusive OR true when both card and pass are present?

Answer key & assessment criteria

Answers and teaching guidance

  1. Guided: Outputs false,true,true,true.
  2. Independent 1: false. 2:(H OR F) AND A, where H and F mean the respective missing items and A means reminders are allowed.
  3. Quick check: Inclusive OR requires at least one true input; both true also satisfies it.

Look for: Require the learner to explain the interpretation and check, not only state a result. Assess the written trace or evidence record; do not request real passwords, accounts or personal data.

Make it work for your learner

More support

Use colored true/false cards and split the rule into two spoken questions.

Extension challenge

Rewrite the policy with an exclusive choice and show which truth-table row changes.

Verified references · Selected contributions

Standards connections

Subject-content alignment not yet verified

Supporting literacy connections

These records apply to the specified reading, writing or communication task. They do not establish subject-content alignment.

Supporting Common Core connection

RST.9-10.7

Common Core · Grades 9–10

Translate a written technical rule into a flowchart and truth table, then explain it in words.

Read the official standard ↗

Supporting grades 9–10 technical-literacy practice in the stated task, not a verified computer-science content alignment or full text-complexity assessment.

Verified 2026-11-04. Selected contribution, not full attainment.