Computer Science · Grade 12

Active learning ideas

Stacks: LIFO Principle

Active learning works well for stacks because the LIFO principle is counterintuitive without hands-on experience. Physical and collaborative activities make abstract concepts concrete, helping students visualize how stacks restrict access to only one end of the structure. This approach builds confidence as students see immediate, tangible results of their actions.

• Ontario Curriculum Expectations
• CS.DSAA.5
• CS.P.5

• 25–40 min
• Pairs → Whole Class
• 4 activities

Activity 01

• Stations Rotation
• 25 min · Small Groups

Physical Simulation: Plate Stacking

Provide stacks of paper plates to small groups. Instruct students to add (push) and remove (pop) plates only from the top, simulating LIFO. Have them note what happens if they try middle access, then discuss violations. Transition to drawing array representations.

Why is a stack the ideal structure for managing function calls in a recursive algorithm?

Facilitation Tip

During Plate Stacking, move slowly between groups to ensure students physically experience the 'top-only' rule by failing attempts to remove plates from the middle.

What to look for

On a small card, ask students to write down the sequence of operations (push A, push B, pop, push C, pop, pop) and list the elements removed in order. Then, ask them to identify which operation would cause a stack overflow if the stack had a maximum capacity of 2 elements.

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

Activity 02

• Stations Rotation
• 35 min · Pairs

Pair Programming: Array-Based Stack

Pairs code a stack class with push, pop, peek, and isEmpty methods using arrays. Test with sample inputs like reversing a string. Debug stack overflow together, comparing results.

Explain the 'Last-In, First-Out' principle and its implications for data access.

Facilitation Tip

For Array-Based Stack, circulate to listen for students explaining why popping an empty stack triggers an error, not just noting it happens.

What to look for

Present students with a scenario: 'A user types the following commands in a web browser: Page A, Page B, Page C. They then click the back button twice. Which page do they land on?' Ask students to explain their answer using the LIFO principle and the terms 'push' and 'pop'.

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

Activity 03

• Stations Rotation
• 30 min · Whole Class

Whole Class: Recursion Call Stack Trace

Project a recursive factorial function. Class traces pushes and pops step-by-step on a shared whiteboard stack diagram. Students predict outputs for inputs 4 and 5, then verify with code.

Construct a stack implementation using an array or a linked list.

Facilitation Tip

In Recursion Call Stack Trace, model tracing by thinking aloud while stepping through the call stack to make the invisible process visible.

What to look for

Facilitate a class discussion by asking: 'Besides function calls and print spooling, can you think of other scenarios where the LIFO principle is naturally applied? How would a stack be beneficial in those situations?' Encourage students to share examples from games, simulations, or other software they use.

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

Activity 04

• Stations Rotation
• 40 min · Individual

Debug Challenge: Linked List Stack

Individuals implement a linked-list stack, then swap code with a partner to find and fix bugs like null pointer errors in pop. Regroup to share fixes.

Why is a stack the ideal structure for managing function calls in a recursive algorithm?

Facilitation Tip

During Debug Challenge, ask students to explain their fixes in terms of LIFO to reinforce conceptual understanding over just code changes.

What to look for

On a small card, ask students to write down the sequence of operations (push A, push B, pop, push C, pop, pop) and list the elements removed in order. Then, ask them to identify which operation would cause a stack overflow if the stack had a maximum capacity of 2 elements.

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

A few notes on teaching this unit

Teach stacks by starting with physical simulations to establish the LIFO principle before moving to code. Avoid rushing into implementation details; let students struggle briefly with the 'top-only' constraint to build intuition. Research shows students grasp abstract concepts better when they first experience them concretely, then connect those experiences to formal structures.

Successful learning looks like students correctly describing LIFO behavior and applying push and pop operations without confusion. Students should articulate why stacks restrict access to the top element only and connect the structure to real applications like function calls and print spooling. Confidence in debugging stack-related errors shows deep understanding.

---

Watch Out for These Misconceptions

• During Plate Stacking, watch for students attempting to remove plates from the middle of the stack, treating it like an array.

  Guide students to verbalize that stacks only allow access to the top plate. If a student tries to remove a middle plate, pause the activity and ask the class to predict the outcome, then demonstrate why it fails under LIFO rules.

• During Array-Based Stack or Linked List Stack, watch for students mixing up stack and queue behaviors when implementing push and pop.

  Have students explain their code’s logic aloud while pointing to the specific lines that enforce LIFO. Ask peers to verify whether the operations match the 'last-in, first-out' principle before moving forward.

• During Plate Stacking or Cup Stacking, watch for students describing push as adding to the bottom instead of the top.

  Demonstrate the correct action while narrating: 'We add this plate to the top, making it the new first plate to be removed.' Ask students to mimic the action while restating the rule aloud.

---

Methods used in this brief

• Stations Rotation