9-12 Computer Science — Algorithms and Computational Thinking: Worked Example Workshop

Lesson snapshot

Subject: Computer Science · Grade band: 9-12 · Suggested time: 50 minutes · Format: Worked Example Workshop

This lesson is designed to make expert decisions visible, compare solution paths or interpretations, and help learners explain why each step is justified. It supports learners as they decompose problems, recognize patterns, design precise algorithms, and evaluate efficiency and correctness.

Learning objectives and success criteria

• Explain the central idea of Algorithms and Computational Thinking in learner-friendly and discipline-appropriate language.
• Use this reasoning process: define inputs and outputs, break the task into cases, write unambiguous steps, trace examples, and revise.
• Create an algorithm, trace table, edge cases, and revision and revise at least one decision from evidence or feedback.
• Apply the idea to a changed example without copying the modeled response.

Success is visible when the learner completes an appropriate task accurately, identifies relevant evidence, explains the method, and transfers the learning with the stated level of support.

Preparation, materials, and vocabulary

Materials: teacher-selected grade-appropriate example; student response sheet or notebook; display or chart space; exit ticket; privacy-safe device or unplugged computing cards.

Vocabulary: algorithms, computational, thinking. Add or replace terms to match the adopted local curriculum and learners’ language needs.

Before class, verify source permissions, accessibility, technology access, physical safety, privacy, and any required school procedures. Prepare one accessible entry example and one extension that deepens reasoning rather than adding repetitive work.

Warm-up: compare two starts — 6 minutes

Show two plausible first moves for a Algorithms and Computational Thinking task. Students identify what each move assumes and what evidence would decide between them.

Worked example with decision stops — 16 minutes

Model the complete task using this process: define inputs and outputs, break the task into cases, write unambiguous steps, trace examples, and revise. Pause before each major decision, invite a prediction, reveal the step, and explain why a tempting alternative is weaker. Annotate the example with questions an expert asks.

Example completion pairs — 12 minutes

Give pairs a partially completed example. One partner explains the next decision; the other checks it against evidence, units, source context, criteria, or system constraints. Switch roles midway. Each student records the final reasoning independently.

Faded example — 11 minutes

A learner traces an algorithm with normal and edge cases and identifies an ambiguous instruction. Provide fewer annotations than in the model. Students must choose and justify the missing steps, then compare approaches without assuming that only one surface form can be correct.

Exit explanation — 5 minutes

Students finish: “The most important decision was ___ because ___; I checked it by ___.” Save the response beside an algorithm, trace table, edge cases, and revision to document both process and outcome.

Differentiation without lowering the learning goal

• Access: Chunk directions, model one step, use visuals or manipulatives, permit approved assistive technology, and reduce task length while preserving the target.
• Multilingual learners: Preview essential language, provide discussion rehearsal, allow home-language resources when appropriate, and assess disciplinary thinking separately from minor language difference.
• Additional support: Use a worked example, organizer, highlighted evidence, or smaller data/text set; document the support and plan how it will fade.
• Extension: Add a counterexample, competing source, changed constraint, new audience, proof, design trade-off, or request for generalization.

Follow the learner’s IEP, 504 plan, language-support plan, school policy, and teacher or specialist guidance. This lesson does not diagnose a disability or replace qualified support.

Teacher answer and feedback guidance

Do not look only for a single final answer. A satisfactory response should demonstrate this reasoning: define inputs and outputs, break the task into cases, write unambiguous steps, trace examples, and revise. It should include accurate evidence or representation, a defensible decision, explanation, and a check or limitation. Watch specifically for assuming a sequence works because it succeeds on one example. If it appears, ask the learner to compare the decisive feature in an example and nonexample before assigning more practice.

Homework or extension option

Ask learners to find or create one new, privacy-safe example of Algorithms and Computational Thinking from class, home, media, a public dataset, a text, or a designed scenario. They should explain why it fits, apply the lesson method, and identify one limitation. Do not require purchases, private family financial or health disclosures, unsafe activity, or access to a paid service.

Safety, rights, and source boundaries

Use teacher-approved materials, age-appropriate supervision, accessible formats, licensed or public-domain sources, and privacy-safe data. Verify current local rules for laboratory work, technology, health, CTE equipment, student records, media use, and community activity. Financial, health, legal, emergency, and career-program decisions require the appropriate official or qualified source.

Related Algorithms and Computational Thinking lessons

Concept Launch Lesson · Worked Example Workshop · Collaborative Investigation

Framework reference: 2026 CSTA PK–12 Computer Science Standards. This is an original independent Exams.fit lesson, not copied standards or an official state curriculum. Local expectations may differ. Reviewed August 2, 2026.