Computing · JC 1

Active learning ideas

Linear Data Structures (Arrays and Linked Lists)

Active learning works because algorithms and flowcharts are procedural skills best grasped through doing. When students physically model sorting or trace pseudocode with peers, they confront the gap between theory and execution. This hands-on approach builds the intuition needed to choose the right tool for the right job, not just follow steps in a textbook.

• MOE Syllabus Outcomes
• 9569 1.3.1 Understand and use 1D and 2D arrays
• 9569 1.3.2 Implement stacks, queues, and linked lists

• 20–50 min
• Pairs → Whole Class
• 3 activities

Activity 01

• Stations Rotation
• 50 min · Small Groups

Stations Rotation: Sorting Challenge

Set up four stations, each representing a different sorting algorithm. At each station, students follow a set of physical instructions to sort a set of cups. They record the number of 'swaps' and 'comparisons' at each station to compare efficiency.

What is the difference between static and dynamic data structures?

Facilitation Tip

During Station Rotation: Sorting Challenge, set a strict 8-minute timer per station to force quick decision-making and prevent over-analysis.

What to look for

Provide students with a scenario, such as 'Deciding whether to bring an umbrella based on the weather forecast.' Ask them to draw a simple flowchart representing this decision process and write one sentence explaining the role of selection in their flowchart.

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

Activity 02

• Peer Teaching
• 45 min · Small Groups

Peer Teaching: Algorithm Experts

Divide the class into four groups, each assigned one algorithm (e.g., Quicksort). They must master it and then create a 3-minute 'unplugged' demonstration to teach the rest of the class how the algorithm works without using a computer.

How are stacks and queues implemented using arrays or linked lists?

Facilitation Tip

For Peer Teaching: Algorithm Experts, provide a checklist of key concepts each expert must cover before peers rotate, ensuring accountability.

What to look for

Present students with a short piece of pseudocode. Ask them to trace the execution for a given input and write down the output. Then, ask them to identify which control structures (sequence, selection, iteration) are used in the pseudocode.

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

Activity 03

• Think-Pair-Share
• 20 min · Pairs

Think-Pair-Share: The Best Tool for the Job

Present students with three scenarios: sorting 10 names, searching a sorted list of 1 million IC numbers, and sorting a list that is already 90% sorted. Students must choose the best algorithm for each and justify their choice to a partner.

When should a linked list be used over an array?

Facilitation Tip

In Think-Pair-Share: The Best Tool for the Job, require pairs to write their final comparison on chart paper and present it to another pair for cross-validation.

What to look for

Pose the question: 'When would you prefer to use a flowchart over pseudocode to explain an algorithm, and vice versa?' Facilitate a class discussion where students justify their choices based on clarity, complexity, and audience.

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

A few notes on teaching this unit

Teach algorithms by contrasting them side by side, not in isolation. Start with bubble sort to build empathy for inefficiency, then introduce insertion sort as the 'nearly sorted hero.' Use real datasets like student attendance records to make efficiency tangible. Avoid rushing to code—let students stumble through manual steps first to appreciate why algorithms exist.

Successful learning looks like students explaining why a nearly sorted list speeds up insertion sort but slows down quicksort. They should justify algorithm choices using efficiency terms like O(n) or O(n log n) and connect flowchart symbols to pseudocode control structures without prompting.

---

Watch Out for These Misconceptions

• During Station Rotation: Sorting Challenge, watch for students applying binary search to an unsorted station. Redirect them by having them physically shuffle a deck of cards and attempt to find the '7' using binary search steps.

  During Station Rotation: Sorting Challenge, if students default to quicksort for every dataset, pause the station and ask them to rank the algorithms by speed first for a list of 100 identical numbers. This reveals quicksort's worst-case flaw.

---

Methods used in this brief

• Stations Rotation
• Peer Teaching
• Think-Pair-Share