Computer Science · Grade 12

Active learning ideas

Introduction to Data Structures

Dynamic memory and linked structures require students to visualize abstract concepts like pointers and non-contiguous storage. Active learning transforms these invisible processes into tangible experiences, helping students grasp how memory allocation and node connections work in real time. Movement and collaboration make the shift from static to dynamic data concrete rather than abstract.

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

• 15–30 min
• Pairs → Whole Class
• 3 activities

Activity 01

• Simulation Game
• 30 min · Whole Class

Simulation Game: Human Linked List

Assign each student a 'data' value and a piece of paper representing a 'pointer' to another student. Students must physically rearrange themselves to demonstrate operations like inserting a new node or deleting one, ensuring the 'chain' of pointers remains intact.

Differentiate between primitive and complex data types in programming.

Facilitation Tip

In the Human Linked List activity, use colored wristbands to represent pointers so students can physically see how the 'next' reference moves from person to person.

What to look for

Present students with two scenarios: one requiring a fixed-size data collection and another needing a variable-size collection. Ask them to identify which scenario is better suited for a static array and which for a dynamically allocated structure like a linked list, and to justify their choices.

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

Activity 02

• Inquiry Circle
• 20 min · Small Groups

Inquiry Circle: Array vs. Linked List

Provide small groups with a set of scenarios (e.g., a music playlist, a fixed seating chart, a growing undo history). Groups must use a T-chart to argue which structure is better for each case based on memory usage and speed.

Explain why efficient data organization is crucial for software performance.

Facilitation Tip

For the Array vs. Linked List investigation, provide a shared digital workspace where students can adjust code snippets and immediately observe performance differences.

What to look for

Facilitate a class discussion using the prompt: 'Imagine you are building a playlist application. When would using a linked list be more advantageous than using a standard array, particularly concerning adding or removing songs from the middle of the playlist?'

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

Activity 03

• Think-Pair-Share
• 15 min · Pairs

Think-Pair-Share: The Memory Leak Mystery

Present a snippet of code where a pointer is reassigned before the original memory is freed. Students work in pairs to trace the memory addresses and explain why that memory is now 'lost' to the system.

Analyze how different data structures impact memory usage and processing speed.

Facilitation Tip

During the Memory Leak Mystery, pause the activity after each step to ask students to predict what happens to the 'orphaned' data before revealing the next clue.

What to look for

On an index card, ask students to draw a simple representation of a singly linked list with at least three nodes. They should label the 'head' pointer and indicate what data type the 'next' pointer would typically hold.

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

A few notes on teaching this unit

Start with the Human Linked List to ground the concept in physical movement, then use the Array vs. Linked List investigation to let students collect empirical data on performance. Teachers should avoid rushing to code implementations before students can articulate why dynamic structures matter. Research suggests that combining kinesthetic modeling with collaborative coding helps students retain abstract concepts longer than lectures alone.

Students will demonstrate understanding by explaining the trade-offs between arrays and linked lists, tracing pointer operations in a human model, and identifying where memory leaks occur during node removal. Success looks like clear articulation of time complexity and memory management principles in both discussions and diagrams.

---

Watch Out for These Misconceptions

• During the Array vs. Linked List activity, watch for students assuming that linked lists are always faster because they are dynamic.

  Use the provided code snippets in this activity to have students measure access times for both structures at the head, middle, and tail, so they can see that linked lists are O(1) only at the head while arrays provide O(1) random access.

• During the Memory Leak Mystery activity, watch for students believing that deleting a node automatically frees its memory.

  Have students physically remove their node from the chain and then point to the empty space where the data 'resides' until they explicitly deallocate it, using the materials provided in this activity.

---

Methods used in this brief

• Simulation Game
• Inquiry Circle
• Think-Pair-Share