Decision Trees and Choices gives Grade 3 students a practical introduction to computer science algorithms and problem solving through conditions, choices, branches, paths, and results. Students explore how yes-or-no answers can guide a computer through different outcomes and how decision trees can help organize instructions before code is written.

What Students Practice

The lesson builds vocabulary and reasoning around conditions, branches, paths, choices, results, rules, and decision trees. Students follow simple decision-tree paths, identify how answers change the next step, and explain how programmers can use organized choices to find missing paths or confusing rules.

The worksheet moves from guided discussion into matching, a cloze passage, diagram labeling, reading comprehension, multiple-choice questions, true-or-false statements, brief written responses, and an extended response. The reading passage uses accessible examples such as checking whether it is raining, determining whether a number is greater than 10, and deciding whether a game player has enough points.

What You Receive

• Worksheet focused on decision trees, choices, conditions, branches, paths, and computer instructions
• Decision-tree diagram labeling practice
• Reading passage with questions that check understanding of key concepts
• Short-answer and extended-response opportunities for applying decision-tree ideas
• Separate Teacher Guide PDF with Learning Objectives, Teaching Tips, Discussion Questions, and Common Mistakes

Classroom Use

Use this Grade 3 computer science worksheet for direct instruction, guided practice, independent work, review, or a lesson on algorithms and problem solving. The progression gives students opportunities to identify parts of a decision tree, trace possible outcomes, apply conditions to everyday choices, and construct their own simple decision tree for choosing an after-school activity.

The extended response asks students to design a decision tree with at least two conditions and explain how different answers lead to different results. This provides a concrete way to connect algorithmic thinking with organized decision-making.

Why It Supports the Lesson

Rather than treating decision trees as abstract programming vocabulary, the resource connects each concept to clear choices and paths. Students encounter the same core idea from several angles: identifying a condition, following a branch, determining an outcome, spotting potential problems in a plan, and explaining how a programmer can organize instructions. The accompanying Teacher Guide adds practical support for preparing and discussing the lesson.