No devices · Grades 6-8 · 50 min
Computing, woven in
Free integrated lesson · No devices needed
6-8 · 50 min · Math · Science · Social Studies · ELA · CS/Technology
An integrated lesson on decision-making: students map a real back-to-school dilemma as a branching decision tree, weigh consequences, and discover that the questions you ask — and their order — decide the outcome, with a callout for whatever subject you teach.
Materials last updated Jun 23, 2026.
Decision Paths
Make it yours
No co-teacher needed. Open your subject for a single card with the core content you teach and the specifics for weaving this lesson into your room — nothing to look up elsewhere.
Topic refresher
New to a concept? Tap a topic for a printable cheat sheet — plain-language definitions and classroom examples.
Decisions are algorithms. Students take a real back-to-school dilemma — how to split group roles, resolve a shared-resource conflict, plan an event — and map it as a branching decision tree: each question sends you down a path to an outcome. They learn conditional logic and trade-offs, and discover the big idea: the questions you ask, and their order, decide where you land.
A base integrated lesson — run it in your room as-is. It’s the same test-it-at-the-edges discipline that engineers, scientists, and policymakers use when the rules they write start deciding things for real people.
Students will (1) represent a decision as a branching tree, (2) trace paths to outcomes, and (3) revise questions when the tree gives a bad result.
Courts, triage nurses, admissions, budgets, and apps all run on decision rules — and a community is only as fair as the rules behind those calls and the people who test them. Making a rule visible and probing it for the cases it gets wrong is logic, ethics, and systems thinking at once. The students mapping a tree here are practicing exactly what engineers, scientists, and policymakers do when they design the rules that decide things for real people — and the ones who learn to ask “whose case does this break?” are the ones who get to steer those systems toward justice.
Students treat a decision as a single gut call. Reframe: it’s a sequence of conditions — yes/no questions, each narrowing the options. Change the questions and you change the outcome.
Hand teams a new scenario their tree didn’t plan for. Run it down the branches. Sometimes it lands on a bad or missing outcome — a real edge case. Teams decide whether to add a branch or reorder questions, then re-test. The lesson: a decision rule can look complete and still fail at the edges, so you test it against cases it didn’t expect. Apply the same to any confident automated recommendation — an app, a policy, an AI tool: what case breaks it, and who would it hurt?
Use the Post prompt — “Which question mattered most? What happens if you ask it first vs. last?” — plus the edge case from Check the Machine.
Proficient when a team traces a new scenario down the tree, identifies a case it gets wrong, and revises it (adds a branch or reorders questions) so it handles that case.
3 branches in your tree · 2 outcomes you mapped · 1 case your tree got wrong.
“Map a family decision (where to eat, how to split chores) as a yes/no tree. Find the question that decides it.”
Tap any code to see what it covers.
The national computer-science learning standards from the Computer Science Teachers Association.
Algorithms & Programming strand, grades 6–8
CS/Technology:CSTA 2-AP-11 and 2-AP-13 cover control structures (if/else conditionals) and using variables in algorithms. In plain terms: a program 'decides' by checking conditions in order and taking the first one that's true, so the order of conditions matters — an early, too-broad condition can swallow cases meant for a later branch.
Algorithms & Programming strand, grades 6–8
CS/Technology:CSTA 2-AP-11 and 2-AP-13 cover control structures (if/else conditionals) and using variables in algorithms. In plain terms: a program 'decides' by checking conditions in order and taking the first one that's true, so the order of conditions matters — an early, too-broad condition can swallow cases meant for a later branch.
Algorithms & Programming strand, grades 6–8
Standards for how students use technology to learn, from the International Society for Technology in Education.
Computational Thinker (Standard 5)
Global Collaborator (Standard 7)
The Common Core reading, writing, speaking, and language standards.
Speaking & Listening, grade 6
ELA:W.6.1 asks students to write an argument that states a clear claim and backs it with reasons and relevant evidence; SL.6.1 is collaborative discussion where students build on one another's reasoning. In plain terms: take a position, defend it with 'because' statements, and reason together out loud rather than trading opinions.
View this standard ↗Keep going
3-5, 6-8 · 50 min
Plan the Road Trip
Students turn a summer road trip into a map of towns and roads, then find a good route between two places — discovering that the 'best' route depends on what you're trying to save (miles, time, or money), and that a computer plans your trip the same way, one connection at a time.
9-12 · 55 min
Systems & Feedback
An integrated systems-thinking lesson: students diagram a real school or community system as stocks, flows, and feedback loops — discovering why systems resist change, overshoot, or stabilize, with a callout for whatever subject you teach.
3-5 · 45 min
The Helping Network
An integrated community-builder: students map who can help with what in the classroom as a network of people and connections — meeting nodes, links, and how information travels, with a callout for whatever subject you teach.
You just read a free Math lesson. There are 31 more, going deeper.
The Educator plan ($9/mo) unlocks the standards-aligned Math library for your grade band — extended lessons, slides, answer keys, and standards maps. Advanced adds PD contact-hour certificates for license renewal.