Algorithmic Thinking: Pseudocode

Students learn pseudocode best when they see it as a bridge between their everyday language and formal logic. By writing and revising instructions for tasks they know well, pupils grasp how algorithms break down complexity into clear steps. Active tasks make the need for precision immediate and tangible.

• Year 7
• Computing
• 4 activities
• 20 min–45 min

Learning Objectives

1. Design pseudocode algorithms to represent simple real-world processes.
2. Analyze given pseudocode examples to identify clarity, precision, and potential errors.
3. Create pseudocode algorithms for sorting a list of items numerically and alphabetically.
4. Evaluate the effectiveness of pseudocode in communicating algorithmic steps.

Peer Teaching

⏱ 30 min·Pairs

Pair Programming: Daily Routine Pseudocode

Pairs write pseudocode for a morning routine, like getting ready for school. They swap scripts, follow instructions literally as 'computers', and note failures. Revise together for clarity and test again.

Prepare & details

Translate a simple real-world process into pseudocode.

Facilitation Tip: During Pair Programming, circulate and listen for students to verbalize steps before writing, reinforcing the connection between action and code.

Setup: Presentation area at front, or multiple teaching stations

Materials: Topic assignment cards, Lesson planning template, Peer feedback form, Visual aid supplies

• Understand
• Apply
• Analyze
• Create
• Self-Management
• Relationship Skills

Peer Teaching

⏱ 45 min·Small Groups

Small Groups: Sorting Challenge

Provide number cards to groups. Students design pseudocode to sort them ascending. Groups perform the algorithm with cards, time it, then swap and improve rival versions for efficiency.

Prepare & details

Evaluate the clarity and precision of a given pseudocode example.

Facilitation Tip: In Small Groups, limit sorting tools to physical items first (e.g., cards or books) to ground abstract concepts in concrete experience.

Setup: Presentation area at front, or multiple teaching stations

Materials: Topic assignment cards, Lesson planning template, Peer feedback form, Visual aid supplies

• Understand
• Apply
• Analyze
• Create
• Self-Management
• Relationship Skills

Peer Teaching

⏱ 20 min·Whole Class

Whole Class: Human Algorithm

Teacher reads pseudocode for a simple task like traffic lights. Class members act as elements, demonstrating flow. Discuss breakdowns, then students volunteer improved pseudocode.

Prepare & details

Design a pseudocode algorithm to solve a specific problem, such as sorting a list of numbers.

Facilitation Tip: For Human Algorithm, deliberately introduce a misstep in the human ‘code’ to model debugging and revision in real time.

Setup: Presentation area at front, or multiple teaching stations

Materials: Topic assignment cards, Lesson planning template, Peer feedback form, Visual aid supplies

• Understand
• Apply
• Analyze
• Create
• Self-Management
• Relationship Skills

Peer Teaching

⏱ 25 min·Individual

Individual: Recipe Refinement

Students convert a real recipe into pseudocode, adding decisions like 'if oven hot'. Self-evaluate using a checklist, then share one strength and fix with a peer.

Prepare & details

Translate a simple real-world process into pseudocode.

Setup: Presentation area at front, or multiple teaching stations

Materials: Topic assignment cards, Lesson planning template, Peer feedback form, Visual aid supplies

• Understand
• Apply
• Analyze
• Create
• Self-Management
• Relationship Skills

Teaching This Topic

Teach pseudocode as a rehearsal for programming, not just a separate skill. Model turning your own spoken instructions into pseudocode, then reverse the process: have students translate their pseudocode back into steps to check for gaps. Research shows that students benefit from seeing mistakes corrected in public, so deliberately include flawed examples for analysis. Avoid rushing to correct students; instead, prompt them to articulate why a step is unclear or incomplete.

What to Expect

Students will write pseudocode that others can follow without confusion. They will identify missing steps or vague language in peer work and refine their own instructions through feedback. By the end, they should confidently decompose small tasks into algorithmic steps using structured English.

Watch Out for These Misconceptions

Common Misconception

During Pair Programming, watch for students using casual phrases like 'get the cup' without specifying which cup or how to verify it is clean.

What to Teach Instead

Have pairs act out their instructions to expose vague steps. Ask, 'Which cup did you take?' and 'How do you know it is clean?' to guide them to add conditions like 'take clean cup' and 'check water level'.

Common Misconception

During Small Groups: Sorting Challenge, watch for groups treating the task as a single pass through the items rather than iterating until sorted.

What to Teach Instead

Ask groups to time their sorts and compare steps. Prompt them to add loops by asking, 'How many times did you need to look at each book?' to highlight the need for repetition in the pseudocode.

Common Misconception

During Recipe Refinement, watch for students changing a single word without considering the impact on the whole process.

What to Teach Instead

Have students swap recipes and underline any word that could cause confusion. Discuss how a change like 'add sugar' to 'add 2 spoons of sugar' affects the outcome, linking to debugging precision.

Assessment Ideas

Exit Ticket

After Recipe Refinement, ask students to write a 4-step pseudocode for a recipe they know, then circle one word or phrase that could be misunderstood. Collect these to check for clarity and precision.

Peer Assessment

During Small Groups: Sorting Challenge, have pairs swap pseudocode and physically sort using only the written steps. Each student must point out one step that needs clarification before the sort can continue.

Quick Check

After Human Algorithm, display a short pseudocode example on the board (e.g., IF light = on THEN turn switch off ELSE ask for help). Ask students to write what happens if the light is off and what happens if it is on, to assess their understanding of conditional logic.

Extensions & Scaffolding

• Challenge students to write pseudocode for a sorting task with an additional constraint, like sorting by two criteria (e.g., books by height and then by color).
• For students who struggle, provide partially completed pseudocode templates with missing keywords or steps to fill in.
• Deeper exploration: Ask students to compare their pseudocode with a peer’s and explain which version is clearer, citing specific improvements.

Key Vocabulary

Pseudocode	A method of writing algorithms using plain English that is structured and easy to follow, without strict programming syntax.
Algorithm	A step-by-step set of instructions or rules designed to perform a specific task or solve a particular problem.
Sequencing	The order in which instructions are performed in an algorithm; steps are executed one after another.
Selection	A control structure in an algorithm that allows different actions to be performed based on a condition (e.g., IF...THEN...ELSE).
Iteration	The repetition of a block of instructions within an algorithm until a certain condition is met (e.g., FOR loop, WHILE loop).