Why Choosing the right data structure in Intro to Computing? - Purpose & Use Cases

The Big Idea

What if your computer could find information as fast as you grab your favorite toy from a neat box?

The Scenario

Imagine you have a huge pile of different types of toys mixed together in a box. When you want to find a specific toy, you have to dig through the entire box every time.

The Problem

This manual way is slow and frustrating. You waste time searching, and sometimes you might even miss the toy you want because the box is messy and unorganized.

The Solution

Choosing the right data structure is like organizing your toys into labeled bins: cars in one, dolls in another, and blocks in a third. This makes finding, adding, or removing toys quick and easy.

Before vs After

✗ Before

toys = ['car', 'doll', 'block', 'car', 'doll']
# Search by checking each toy one by one

✓ After

toys = {'cars': ['car', 'car'], 'dolls': ['doll', 'doll'], 'blocks': ['block']}
# Directly access the right group

What It Enables

It enables your programs to work faster and smarter by using the best way to store and access data.

Real Life Example

Think about a library: books are sorted by genre and author so you can quickly find the book you want instead of searching every shelf.

Key Takeaways

Manual searching is slow and error-prone.

Right data structures organize data efficiently.

Good choices speed up programs and reduce mistakes.

Practice

1. Which data structure should you use if you want to store a list of items where order matters and duplicates are allowed?

easy

A. List or array

B. Set

C. Dictionary

D. Tuple

Solution

1. Step 1: Understand the need for order and duplicates

   Lists and arrays keep the order of items and allow duplicates, which matches the requirement.

2. Step 2: Compare with other structures

   Sets do not allow duplicates, dictionaries store key-value pairs, and tuples are immutable but also keep order.

3. Final Answer:

   List or array -> Option A

4. Quick Check:

   Order + duplicates = List/array [OK]

Hint: Use lists for ordered data with duplicates [OK]

Common Mistakes:

• Choosing set which removes duplicates
• Choosing dictionary which stores key-value pairs
• Confusing tuple immutability with order

2. Which of the following is the correct way to create an empty set in Python?

easy

A. empty_set = {}

B. empty_set = set()

C. empty_set = []

D. empty_set = ()

Solution

1. Step 1: Recall syntax for empty set

   In Python, {} creates an empty dictionary, not a set.

2. Step 2: Identify correct set creation

   Using set() creates an empty set correctly.

3. Final Answer:

   empty_set = set() -> Option B

4. Quick Check:

   Empty set = set() [OK]

Hint: Use set() to create empty sets, {} is a dict [OK]

Common Mistakes:

• Using {} which creates an empty dictionary
• Using [] which creates a list
• Using () which creates a tuple

3. What will be the output of this Python code?

data = {'apple': 3, 'banana': 5, 'orange': 2}
print(data['banana'])

medium

A. 5

B. 3

C. 'banana'

D. KeyError

Solution

1. Step 1: Understand dictionary key-value access

   In the dictionary, 'banana' is a key with value 5.

2. Step 2: Access the value for 'banana'

   Using data['banana'] returns the value 5.

3. Final Answer:

   5 -> Option A

4. Quick Check:

   Dictionary key 'banana' = 5 [OK]

Hint: Dictionary[key] returns the value for that key [OK]

Common Mistakes:

• Confusing key with value
• Expecting the key name as output
• Mistyping key causing KeyError

4. You want to store unique user IDs and quickly check if a user ID exists. Which data structure is best? The code below has an error. Find and fix it.

user_ids = []
user_ids.add(101)
user_ids.add(102)

medium

A. Use dictionary instead of list

B. Use append instead of add: user_ids.append(101)

C. Change list to set: user_ids = set()

D. No error, code is correct

Solution

1. Step 1: Identify the error in method usage

   Lists do not have an add() method; add() is for sets.

2. Step 2: Choose correct data structure for unique items

   Sets store unique items and support add() method, so change list to set.

3. Final Answer:

   Change list to set: user_ids = set() -> Option C

4. Quick Check:

   Unique items + add() = set [OK]

Hint: Use set() for unique items and add() method [OK]

Common Mistakes:

• Using add() on list causing AttributeError
• Using append() but duplicates allowed
• Choosing dictionary unnecessarily

5. You have a list of student names with possible duplicates. You want to count how many times each name appears. Which data structure is best and why?

hard

A. Use a tuple to store names immutably

B. Use a set to store unique names only

C. Use a list to store all names again

D. Use a dictionary to map names to counts

Solution

1. Step 1: Understand the need to count occurrences

   Counting requires storing each name with its count, which is a key-value pair.

2. Step 2: Choose data structure for key-value pairs

   Dictionaries store keys (names) with values (counts), perfect for this task.

3. Final Answer:

   Use a dictionary to map names to counts -> Option D

4. Quick Check:

   Counting items = dictionary [OK]

Hint: Use dictionary for counting items with keys and values [OK]

Common Mistakes:

• Using set which removes duplicates and loses counts
• Using list which doesn't map names to counts
• Using tuple which is immutable and not for counting