Complex Data Structures: Lists and Arrays

Active learning works for lists and arrays because students often confuse abstract references with concrete values. When they build real projects like shopping lists or class rosters, the gaps in their understanding become visible and fixable immediately, rather than waiting for a test.

• Grade 10
• Computer Science
• 4 activities
• 25 min–45 min

Learning Objectives

1. Compare the memory usage and access speed of lists versus arrays for storing identical datasets.
2. Create Python code to dynamically add, remove, and modify elements within a list.
3. Analyze the time complexity of linear search algorithms applied to unsorted lists.
4. Design a program that utilizes a list to manage a collection of student records.
5. Evaluate the suitability of lists for different data management tasks based on their mutability.

Problem-Based Learning

⏱ 35 min·Pairs

Pair Programming: Shopping List Builder

Partners start with an empty list and use input() to add grocery items via append(). They access items by index to display prices, remove out-of-stock items with pop(), and slice for categories. Pairs test and swap code for feedback.

Prepare & details

Differentiate between a single variable and a list/array for storing multiple values.

Facilitation Tip: Before starting Pair Programming: Shopping List Builder, model reading a list index aloud to reinforce zero-based counting.

Setup: Groups at tables with access to research materials

Materials: Problem scenario document, KWL chart or inquiry framework, Resource library, Solution presentation template

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

Problem-Based Learning

⏱ 45 min·Small Groups

Small Groups: Search Race Simulation

Groups receive printed lists of 10, 50, and 100 numbers. They time manual linear searches for targets, then code the same in Python and compare runtimes. Discuss why larger lists slow searches and brainstorm improvements.

Prepare & details

Construct code to add, remove, and access elements within a list.

Facilitation Tip: During Search Race Simulation, circulate with a timer to make the race feel urgent and real, prompting students to think about search efficiency.

Setup: Groups at tables with access to research materials

Materials: Problem scenario document, KWL chart or inquiry framework, Resource library, Solution presentation template

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

Problem-Based Learning

⏱ 30 min·Whole Class

Whole Class: Class Roster Manager

Follow teacher-led code to build an array of student names. Add late arrivals with insert(), remove graduates with del, and loop to print attendance. Class votes on extensions like sorting.

Prepare & details

Analyze the efficiency of different methods for searching within a list.

Facilitation Tip: Before the Class Roster Manager begins, demonstrate sorting a small list so students see how order affects search speed.

Setup: Groups at tables with access to research materials

Materials: Problem scenario document, KWL chart or inquiry framework, Resource library, Solution presentation template

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

Problem-Based Learning

⏱ 25 min·Individual

Individual: Debug List Challenges

Provide 5 code snippets with errors like off-by-one indexing or mutable aliasing. Students fix, run, and explain changes in comments. Share one fix with the class.

Prepare & details

Differentiate between a single variable and a list/array for storing multiple values.

Facilitation Tip: For Debug List Challenges, provide printed code with syntax errors first, so students practice fixing before writing their own.

Setup: Groups at tables with access to research materials

Materials: Problem scenario document, KWL chart or inquiry framework, Resource library, Solution presentation template

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

Teaching This Topic

Start with concrete analogies like a bookshelf for lists and an egg carton for fixed-size arrays. Have students map physical objects to code to reduce abstraction overload. Avoid rushing to abstract examples; let students struggle with real lists first. Research shows that early exposure to mutability bugs helps students debug later, so embrace the mess of unexpected changes.

What to Expect

Students should confidently declare, modify, and traverse lists and arrays without mixing up indices or mutability rules. They will explain why zero-based indexing matters and choose the right method to add or remove items. Their code will run without IndexError exceptions and produce correct outputs during peer review.

Watch Out for These Misconceptions

Common Misconception

During Pair Programming: Shopping List Builder, watch for students counting items starting at 1 instead of 0 when inserting new elements.

What to Teach Instead

Pause the pair work and ask them to label each item position on a printed list from 0 to n-1, then trace the code step-by-step while pointing to the labels to correct the offset.

Common Misconception

During Search Race Simulation, watch for students assuming all list items must be numbers or all strings.

What to Teach Instead

Have them add mixed entries like 'apple', 3.14, 'banana' to their lists and explain how Python handles different types in the same collection.

Common Misconception

During Debug List Challenges, watch for students believing that list1 = list2 creates a new independent copy.

What to Teach Instead

Ask partners to run a quick test by modifying list2 and observing list1 changes, then prompt them to research the .copy() method to fix the issue.

Assessment Ideas

Quick Check

After Debug List Challenges, present a short snippet that uses .append() or .pop() and ask students to predict the final list contents and explain their reasoning, focusing on mutability and index changes.

Exit Ticket

After Class Roster Manager, provide the scenario: 'Add a new student to the class roster.' Ask students to write the Python code and circle the method they used, explaining why it was appropriate for the task.

Discussion Prompt

After Search Race Simulation, pose the question: 'If you had to find a name in a list of 1000 students, would sorting first make the search faster or slower? Use your race data to justify your answer, considering the time cost of sorting versus scanning.'

Extensions & Scaffolding

• Challenge students to write a function that merges two shopping lists without duplicates, using set operations.
• Scaffolding: Provide a partially filled list with comments like '# Add your items here' for students who freeze when staring at a blank editor.
• Deeper: Ask students to compare the performance of linear search versus binary search on a list of 1 million random numbers using Python's timeit module.

Key Vocabulary

List	A mutable, ordered collection of items in Python that can store elements of different data types and can grow or shrink dynamically.
Array	A data structure that stores a collection of elements, typically of the same data type, in contiguous memory locations, often with a fixed size.
Indexing	The process of accessing individual elements within a list or array using their numerical position, starting from zero.
Mutability	The ability of a data structure, like a Python list, to be changed after it has been created.
Linear Search	A simple searching algorithm that checks each element in a list or array sequentially until the target element is found or the end of the collection is reached.