Core Programming Fundamentals: Control Structures

Control structures are the backbone of logical problem-solving in programming, and active learning helps students internalize these concepts through physical and collaborative engagement. When students model data structures with their bodies or solve real-world scenarios, they move from abstract ideas to concrete understanding.

• JC 1
• Computing
• 3 activities
• 20 min–35 min

Learning Objectives

1. Compare the execution flow and termination conditions of `while` and `for` loops.
2. Trace the step-by-step execution of nested `if/else` statements with given inputs and predict the final output.
3. Analyze the consequences of an infinite loop condition and propose methods to detect and prevent it.
4. Design a simple program that utilizes both conditional statements and loops to achieve a specific interactive outcome.

Simulation Game

⏱ 20 min·Whole Class

Simulation Game: The Human Stack and Queue

Students stand in a line to represent a Queue (First-In-First-Out) and a Stack (Last-In-First-Out). They perform 'push' and 'pop' operations with physical items, observing how the order of retrieval changes between the two structures.

Prepare & details

Compare the behaviour of a while loop and a for loop — under what conditions would you choose each?

Facilitation Tip: During the Human Stack and Queue activity, assign roles clearly and enforce the 'no peeking' rule to reinforce LIFO and FIFO behavior.

Setup: Flexible space for group stations

Materials: Role cards with goals/resources, Game currency or tokens, Round tracker

• Apply
• Analyze
• Evaluate
• Create
• Social Awareness
• Decision-Making

Inquiry Circle

⏱ 35 min·Small Groups

Inquiry Circle: Linked List Scavenger Hunt

Each student is a 'node' holding a piece of data and a 'pointer' (a string) to another student. They must physically rearrange themselves to insert a new node or delete an existing one without breaking the chain.

Prepare & details

Trace the execution of a nested if/else block and predict the output for a given set of inputs.

Facilitation Tip: For the Linked List Scavenger Hunt, provide index cards with mixed data types to force students to discuss node relationships.

Setup: Groups at tables with access to source materials

Materials: Source material collection, Inquiry cycle worksheet, Question generation protocol, Findings presentation template

• Analyze
• Evaluate
• Create
• Self-Management
• Self-Awareness

Think-Pair-Share

⏱ 20 min·Pairs

Think-Pair-Share: Choosing the Structure

Pairs are given scenarios like 'managing browser history' or 'storing a list of high scores.' They must discuss which linear data structure is most efficient for each case, considering both time and memory usage.

Prepare & details

Explain what happens when a loop condition never evaluates to false, and how you would detect and prevent this in your code.

Facilitation Tip: In the Think-Pair-Share, give pairs a scenario first, then ask them to present their reasoning to the class for deeper critique.

Setup: Standard classroom seating; students turn to a neighbor

Materials: Discussion prompt (projected or printed), Optional: recording sheet for pairs

• Understand
• Apply
• Analyze
• Self-Awareness
• Relationship Skills

Teaching This Topic

Experienced teachers begin with tangible analogies before introducing code, because abstract pointers and memory allocation confuse beginners. Avoid rushing to syntax; instead, use visual aids like memory diagrams and physical representations to build intuition. Research shows peer teaching accelerates retention, so structured discussions are more effective than lectures for this topic.

What to Expect

Students will confidently differentiate between arrays, linked lists, stacks, and queues, explaining their use cases with examples. They will also justify their choices in control structures, demonstrating both procedural fluency and conceptual reasoning.

Watch Out for These Misconceptions

Common Misconception

During the Linked List Scavenger Hunt, watch for students who assume arrays and linked lists behave identically when inserting or deleting elements.

What to Teach Instead

Pause the activity and ask students to physically model inserting a middle element in both an array (requiring shifting) and a linked list (requiring pointer updates). Point out the memory and time differences.

Common Misconception

During the Think-Pair-Share activity, listen for students who claim stacks and queues are only useful for trivial tasks like reversing a word or organizing a line.

What to Teach Instead

Prompt pairs to brainstorm one complex system (e.g., browser history or CPU scheduling) and describe how the stack or queue enables its operation.

Assessment Ideas

Quick Check

After the Human Stack and Queue activity, present a code snippet with nested conditionals and a specific input. Ask students to trace the execution path on paper and explain their reasoning to a neighbor.

Exit Ticket

After the Think-Pair-Share activity, ask students to write one scenario where a while loop is more appropriate than a for loop, and one strategy to prevent an infinite loop in their code.

Discussion Prompt

During the Linked List Scavenger Hunt, facilitate a discussion with this prompt: 'Your program crashes after inserting a node. What are the first three things you would check in your memory diagram to identify the error?'

Extensions & Scaffolding

• Challenge students to extend the Linked List Scavenger Hunt by adding a doubly-linked list node without prior instruction.
• For students struggling during the Human Stack and Queue, provide a cheat sheet with LIFO and FIFO definitions and ask them to label each role’s behavior.
• Deeper exploration: Have students research and present on how a priority queue differs from a standard queue, using real-world examples like hospital triage systems.

Key Vocabulary

Conditional Statement	A programming construct that executes a block of code only if a specified condition is true. Examples include `if`, `else if`, and `else`.
Loop	A programming construct that repeatedly executes a block of code as long as a specified condition remains true or for a set number of iterations. Examples include `for` and `while`.
Iteration	A single execution of the code block within a loop. The loop continues to perform iterations until its termination condition is met.
Boolean Expression	An expression that evaluates to either `true` or `false`. These expressions are fundamental for controlling the flow of conditional statements and loops.
Infinite Loop	A loop whose termination condition is never met, causing it to execute indefinitely. This is typically an error that can freeze a program.