Why data structures matter for efficiency in Intro to Computing - Draw It to Prove It

Draw This - beginner

Draw a simple diagram comparing how quickly you can find a book in two different ways: (1) a messy pile of books (like an unsorted list), and (2) a neatly arranged bookshelf with labels (like a sorted array). Show the steps you take in each case to find the book titled 'Data Structures'.

10 minutes

Hint 1

Hint 2

Hint 3

Grading Criteria

Two distinct methods shown: messy pile and neatly arranged shelf

Steps for searching clearly indicated for both methods

Labels or titles used to identify books

Comparison of search effort visible (many steps vs few steps)

Diagram is clear and easy to follow

Solution

Data Science

→Algorithms

↓

Algorithms

This diagram shows two ways to find a book called 'Data Structures'.

In the messy pile (like an unsorted list), you must check each book one by one until you find the right one. This takes more time because you might check many books.

In the neatly arranged bookshelf (like a sorted array), books are organized and labeled. You can quickly jump to the book you want without checking others, saving time.

This example explains why choosing the right data structure matters for efficiency: some structures let you find things faster.

Variations - 2 Challenges

[intermediate] Draw a flowchart showing how searching for a phone number differs between a list of contacts in random order and a phonebook sorted alphabetically.

[advanced] Draw a diagram comparing how inserting a new contact differs in an unsorted list versus a balanced tree data structure.

Practice

1. Why is choosing the right data structure important for efficiency?

easy

A. It makes the code look more colorful.

B. It helps perform tasks faster and saves resources.

C. It increases the size of the program.

D. It makes the program run slower.

Solution

1. Step 1: Understand the role of data structures

   Data structures organize data in ways that make accessing and modifying data easier and faster.

2. Step 2: Connect efficiency to task performance

   Choosing the right structure reduces time and resources needed to complete tasks.

3. Final Answer:

   It helps perform tasks faster and saves resources. -> Option B

4. Quick Check:

   Right data structure = faster tasks [OK]

Hint: Right data structure means faster and easier tasks [OK]

Common Mistakes:

• Thinking data structures only affect code appearance
• Believing all data structures perform the same
• Ignoring the impact on program speed

2. Which of the following is the correct way to declare a list in Python?

easy

A. myList = [1, 2, 3]

B. myList = (1, 2, 3)

C. myList = {1, 2, 3}

D. myList = <1, 2, 3>

Solution

1. Step 1: Identify Python list syntax

   Lists in Python are declared using square brackets [].

2. Step 2: Compare options to syntax

   myList = [1, 2, 3] uses square brackets, so it is correct.

3. Final Answer:

   myList = [1, 2, 3] -> Option A

4. Quick Check:

   Python list = square brackets [OK]

Hint: Lists use square brackets [] in Python [OK]

Common Mistakes:

• Using curly braces {} which create sets
• Using parentheses () which create tuples
• Using angle brackets <> which are invalid

3. Consider this Python code:

my_dict = {'a': 1, 'b': 2, 'c': 3}
print(my_dict['b'])

What will be the output?

medium

A. 2

B. Error

C. 'b'

D. 1

Solution

1. Step 1: Understand dictionary key access

   Accessing a dictionary value uses the key inside square brackets.

2. Step 2: Find value for key 'b'

   Key 'b' maps to value 2 in the dictionary.

3. Final Answer:

   2 -> Option A

4. Quick Check:

   Dictionary['b'] = 2 [OK]

Hint: Dictionary keys give values, not keys [OK]

Common Mistakes:

• Confusing key with value
• Expecting the key itself as output
• Thinking it causes an error

4. This code tries to add an element to a tuple:

my_tuple = (1, 2, 3)
my_tuple.append(4)

What is the problem?

medium

A. The syntax for append is incorrect.

B. The variable name is invalid.

C. Tuples can only contain strings.

D. Tuples do not support the append method.

Solution

1. Step 1: Recall tuple properties

   Tuples are fixed-size and immutable; they cannot be changed after creation.

2. Step 2: Understand append method limitation

   Append is a list method; tuples do not have it, so this causes an error.

3. Final Answer:

   Tuples do not support the append method. -> Option D

4. Quick Check:

   Tuples immutable = no append [OK]

Hint: Tuples are fixed; only lists can append [OK]

Common Mistakes:

• Thinking append syntax is wrong
• Believing tuples can be changed
• Confusing variable name issues

5. You need to store a large list of unique user IDs and check quickly if a user ID exists. Which data structure is best and why?

hard

A. List, because it keeps order and is easy to search.

B. Dictionary, because it stores key-value pairs efficiently.

C. Set, because it stores unique items and allows fast membership tests.

D. Tuple, because it is immutable and uses less memory.

Solution

1. Step 1: Identify requirements

   We need to store unique IDs and check existence quickly.

2. Step 2: Match data structure features

   Sets store unique items and allow very fast membership checks.

3. Step 3: Compare other options

   Lists are slower for membership; dictionaries store key-value pairs, not just keys; tuples are immutable but slow for membership tests.

4. Final Answer:

   Set, because it stores unique items and allows fast membership tests. -> Option C

5. Quick Check:

   Unique + fast check = Set [OK]

Hint: Use sets for unique items and fast membership [OK]

Common Mistakes:

• Choosing list for fast membership
• Confusing dictionary use for key-value pairs
• Thinking tuple is best for uniqueness