Stacks, Queues, and Applications

Hands-on manipulation of stacks and queues helps students see how these abstract structures function in real systems. Physical and collaborative tasks make invisible processes visible, reducing confusion about priority and order. Students remember these concepts better when they experience the LIFO and FIFO rules through movement and discussion rather than abstract explanations alone.

• Grade 11
• Computer Science
• 4 activities
• 20 min–45 min

Learning Objectives

1. Compare the operational principles of stacks (LIFO) and queues (FIFO) to model real-world scenarios.
2. Analyze specific applications where a priority queue is more efficient than a standard queue.
3. Design and implement a program that uses a stack to evaluate a postfix mathematical expression.
4. Explain how the abstract data types of stacks and queues are implemented using underlying array or linked list structures.
5. Evaluate the trade-offs between using a stack versus a queue for a given problem.

Stations Rotation

⏱ 45 min·Small Groups

Stations Rotation: LIFO and FIFO Stations

Prepare four stations: stack push/pop with cups, queue enqueue/dequeue with cards, priority queue sorting by number, and application demo with undo buttons. Groups rotate every 10 minutes, sketching operations and noting real-world links. Debrief as a class.

Prepare & details

How do LIFO and FIFO structures mirror real-world organizational systems?

Facilitation Tip: During LIFO and FIFO Stations, circulate with a timer to keep rotations tight and ensure students physically act out each operation before discussing.

Setup: Tables/desks arranged in 4-6 distinct stations around room

Materials: Station instruction cards, Different materials per station, Rotation timer

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

Collaborative Problem-Solving

⏱ 30 min·Pairs

Pair Programming: Stack Expression Evaluator

Pairs code a stack-based program to convert infix math expressions to postfix, then evaluate them. Start with templates for push/pop methods. Test with expressions like (3+4)*2, discuss errors.

Prepare & details

In what scenarios would a priority queue be more effective than a standard queue?

Facilitation Tip: Before coding the Stack Expression Evaluator, have students trace one full expression on paper to identify where pushes and pops occur.

Setup: Groups at tables with problem materials

Materials: Problem packet, Role cards (facilitator, recorder, timekeeper, reporter), Problem-solving protocol sheet, Solution evaluation rubric

• Apply
• Analyze
• Evaluate
• Create
• Relationship Skills
• Decision-Making
• Self-Management

Collaborative Problem-Solving

⏱ 35 min·Whole Class

Whole Class: Print Queue Simulator

Distribute task cards with priorities; class acts as queue, processing FIFO then priority order. Time each run, chart differences. Code a simple queue manager afterward.

Prepare & details

How can we use a stack to evaluate mathematical expressions programmatically?

Facilitation Tip: In the Print Queue Simulator, assign printed ‘jobs’ with timestamps so students see how order affects waiting times in real time.

Setup: Groups at tables with problem materials

Materials: Problem packet, Role cards (facilitator, recorder, timekeeper, reporter), Problem-solving protocol sheet, Solution evaluation rubric

• Apply
• Analyze
• Evaluate
• Create
• Relationship Skills
• Decision-Making
• Self-Management

Collaborative Problem-Solving

⏱ 20 min·Individual

Individual: Real-World Mapping

Students list 5 personal examples of stacks/queues, sketch diagrams, code one in pseudocode. Share one via gallery walk.

Prepare & details

How do LIFO and FIFO structures mirror real-world organizational systems?

Setup: Groups at tables with problem materials

Materials: Problem packet, Role cards (facilitator, recorder, timekeeper, reporter), Problem-solving protocol sheet, Solution evaluation rubric

• Apply
• Analyze
• Evaluate
• Create
• Relationship Skills
• Decision-Making
• Self-Management

Teaching This Topic

Teach stacks and queues by starting with concrete, relatable examples before introducing formal definitions. Use analogies students already understand, like stacking plates or waiting in line, and then connect these to code. Avoid overwhelming students with terminology early; focus on the behavior first. Research shows that students grasp abstract concepts more easily when they can manipulate physical or visual representations, so prioritize activities that require action over passive note-taking.

What to Expect

Students will confidently distinguish between stacks and queues, explain their roles in common applications, and justify choices between standard and priority queues. They will also demonstrate how these structures solve problems by creating or simulating them in different contexts. Clear explanations during peer discussions and activity outputs will show mastery of these concepts.

Watch Out for These Misconceptions

Common Misconception

During LIFO and FIFO Stations, watch for students who assume stacks and queues work the same way because they both store data.

What to Teach Instead

Ask them to physically demonstrate removal: one group should remove from the top of a stack, another from the front of a queue, then compare outcomes using the same set of numbered objects.

Common Misconception

During the Print Queue Simulator, watch for students who believe priority queues ignore all order, including arrival time.

What to Teach Instead

Have them sort numbered task cards by priority and then by arrival time, then discuss why ties need a secondary rule.

Common Misconception

During the Real-World Mapping activity, watch for students who only associate stacks with undo features in editors.

What to Teach Instead

Ask them to brainstorm other contexts where order matters, like browser history or function calls, and sketch how stacks apply in those cases.

Assessment Ideas

Exit Ticket

After the LIFO and FIFO Stations, provide students with two scenarios: one describing a web browser's back button functionality and another describing a line at a movie ticket counter. Students identify which data structure models each scenario and explain their reasoning in one sentence per scenario.

Quick Check

During the Print Queue Simulator activity, ask students to arrange a small, unsorted list of tasks with priority levels as they would appear in a priority queue. Students explain why a standard queue would be less effective for this set of tasks within the activity's discussion time.

Discussion Prompt

After the Real-World Mapping activity, facilitate a class discussion using the prompt: ‘Imagine you are designing a system for managing customer support tickets. When would a simple queue be sufficient, and when would you need to implement a priority queue?’ Students provide at least two distinct examples for each case, referencing the activity's real-world examples.

Extensions & Scaffolding

• Challenge students who finish early to design a hybrid system that uses both a stack and a queue to manage a restaurant order system with special VIP orders.
• For students who struggle, provide pre-labeled cards with ‘push,’ ‘pop,’ ‘enqueue,’ and ‘dequeue’ actions to sequence during the station rotation.
• Deeper exploration: Have students research how operating systems use stacks in thread management and present their findings to the class.

Key Vocabulary

Stack	A linear data structure that follows the Last-In, First-Out (LIFO) principle. Elements are added and removed from the same end, called the top.
Queue	A linear data structure that follows the First-In, First-Out (FIFO) principle. Elements are added at one end (rear) and removed from the other end (front).
LIFO (Last-In, First-Out)	The principle governing stacks, where the most recently added item is the first one to be removed.
FIFO (First-In, First-Out)	The principle governing queues, where the first item added is the first one to be removed.
Priority Queue	A variation of a queue where each element has an associated priority. Elements with higher priority are served before elements with lower priority.