Computing · Year 11

Active learning ideas

Introduction to Algorithms and Flowcharts

Active learning works well here because students often see algorithms as abstract code. By moving physically and drawing symbols, Year 11 students connect abstract logic to concrete steps, building confidence in computational thinking before formal coding. Flowcharts turn invisible decisions into visible paths, so hands-on tracing makes the topic clearer than lecture alone.

• National Curriculum Attainment Targets
• GCSE: Computing - Algorithms
• GCSE: Computing - Computational Thinking

• 20–45 min
• Pairs → Whole Class
• 4 activities

Activity 01

• Stations Rotation
• 25 min · Pairs

Pairs: Flowchart Relay Race

Pairs collaborate on a whiteboard to build a flowchart for a daily task like checking weather before leaving home. One student draws sequence or selection steps while the partner adds iteration; they switch roles after each addition. End with pairs testing each other's flowchart by walking through it aloud.

Analyze the role of sequence, selection, and iteration in algorithmic design.

Facilitation Tip

During the Flowchart Relay Race, circulate and ask pairs to explain their symbol choices aloud, forcing articulation of logic before moving to the next station.

What to look for

Provide students with a short, simple algorithm description (e.g., 'Make a cup of tea'). Ask them to draw a basic flowchart for it, clearly labeling one example of sequence, one of selection, and one of iteration (if applicable). Collect and check for correct symbol usage and logical flow.

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

Activity 02

• Stations Rotation
• 45 min · Small Groups

Small Groups: Algorithm Design Workshop

Groups receive a problem like planning a school trip budget and construct a flowchart incorporating all three constructs. They swap flowcharts with another group for peer review on clarity. Discuss revisions as a class to highlight effective designs.

Construct a flowchart to represent a simple decision-making process.

Facilitation Tip

In the Algorithm Design Workshop, hand out blank paper and colored pencils so groups can color-code paths, making iteration exits and selection branches visually distinct.

What to look for

Display a pre-made flowchart on the board. Ask students to identify and label one instance of sequence, selection, and iteration. Then, ask them to trace the path of execution for a specific input value and state the final output.

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

Activity 03

• Stations Rotation
• 30 min · Whole Class

Whole Class: Debug the Flowchart

Project a sample flowchart with deliberate errors in sequence, selection, or iteration. Students raise hands to spot issues and suggest fixes. Vote on best corrections and redraw the flowchart live.

Evaluate the clarity and completeness of a given algorithm represented as a flowchart.

Facilitation Tip

For the Debug the Flowchart activity, display the flowchart on the board and use a remote pointer to trace paths with students, pausing at each decision to ask, 'What happens if the condition is false?'

What to look for

In pairs, students create a flowchart for a simple task (e.g., 'Calculate the average of two numbers'). They then swap flowcharts and use a checklist to evaluate: Are standard symbols used correctly? Is the logic clear? Is it easy to follow the sequence, selection, and iteration? Partners provide one suggestion for improvement.

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

Activity 04

• Stations Rotation
• 20 min · Individual

Individual: Personal Iteration Challenge

Students create a flowchart for a repetitive personal task, such as practicing piano scales with a loop condition. Share one with a partner for feedback on loop termination. Revise based on input.

Analyze the role of sequence, selection, and iteration in algorithmic design.

Facilitation Tip

During the Personal Iteration Challenge, provide sticky notes labeled 'loop counter' and 'exit condition' so students physically place them to show controlled repetition.

What to look for

Provide students with a short, simple algorithm description (e.g., 'Make a cup of tea'). Ask them to draw a basic flowchart for it, clearly labeling one example of sequence, one of selection, and one of iteration (if applicable). Collect and check for correct symbol usage and logical flow.

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

A few notes on teaching this unit

Teachers should start with everyday examples students recognize, like making toast or crossing the road, to show algorithms exist everywhere. Avoid introducing variables or complex conditions too early; focus first on clear sequence and one simple decision. Research shows students grasp iteration better when they simulate loops with physical objects before abstracting to code. Emphasize that flowcharts are communication tools, not just decoration, so peer review and explanation become central.

Successful learning looks like students confidently translating real-world tasks into flowcharts with correct symbols, identifying sequence, selection, and iteration in peers’ work, and debugging logical gaps in group tasks. They should explain why a loop exits or why a decision branches, using clear language and precise symbols.

---

Watch Out for These Misconceptions

• During Flowchart Relay Race, watch for students who treat algorithms as exclusively digital, ignoring everyday tasks.

  Use the relay stations to include tasks like 'Use a phone to call a friend' or 'Cross a busy road safely,' forcing students to map non-digital steps into flowcharts and see algorithms as universal.

• During Algorithm Design Workshop, watch for students who dismiss flowcharts as optional, preferring to write pseudocode instead.

  Require each group to present their flowchart first, then translate it to pseudocode, explicitly comparing how the visual path reveals logic gaps that text might hide.

• During Personal Iteration Challenge, watch for students who assume loops run forever without exit conditions.

  Provide sticky notes labeled 'counter = 0' and 'if counter > 5, exit loop,' so students physically place these to see how repetition ends, making the concept tangible.

---

Methods used in this brief

• Stations Rotation