Dictionaries and key-value pairs in Intro to Computing - Real World Applications

Real World Mode - Dictionaries and key-value pairs

Real-World Analogy: Dictionaries as a Filing Cabinet with Labeled Drawers

Imagine you have a filing cabinet at home or in an office. This cabinet has many drawers, and each drawer has a label on the front. Inside each drawer, you keep important papers or items related to that label. For example, one drawer might be labeled "Bills" and contain all your utility bills, another labeled "Receipts" with shopping receipts, and another labeled "Warranties" with product warranty papers.

When you want to find a specific paper, you don't have to search through every drawer. You just look at the labels, find the right drawer, and open it to get what you need quickly. This is exactly how a dictionary works in computing: it stores data in pairs where each key (the label) points to a value (the content inside the drawer).

Mapping Table: Computing Concept to Real-World Equivalent

Computing Concept	Real-World Equivalent	Explanation
Dictionary	Filing Cabinet	A container that holds many labeled compartments for easy organization and retrieval.
Key	Drawer Label	The unique name or tag on each drawer that identifies what is inside.
Value	Contents inside the Drawer	The actual papers or items stored inside the drawer, associated with the label.
Adding a Key-Value Pair	Adding a new labeled drawer with contents	Creating a new drawer with a label and putting items inside it.
Looking up a Value by Key	Finding a drawer by its label and opening it	Using the label to quickly find and access the contents without searching all drawers.
Updating a Value	Replacing or adding papers inside a drawer	Changing the contents inside a labeled drawer without changing the label.
Deleting a Key-Value Pair	Removing a drawer and its contents	Taking out a drawer completely from the cabinet.

Day-in-the-Life Scenario: Using the Filing Cabinet

Imagine you come home after shopping and want to organize your receipts. You walk to your filing cabinet and see the drawer labeled "Receipts." You open it and put the new receipts inside. Later, when you need to find a receipt for a return, you don't have to look everywhere; you just open the "Receipts" drawer and find it quickly.

One day, you decide to add a new drawer labeled "Coupons" to keep all your discount coupons. You create the drawer and place your coupons inside. If you ever want to update the coupons, you just add or remove papers inside that drawer without changing the label.

If you no longer need the "Warranties" drawer, you can remove it entirely from the cabinet, freeing up space.

Where the Analogy Breaks Down

• Uniqueness of Keys: In a dictionary, keys must be unique and cannot be duplicated. In a real filing cabinet, sometimes labels might be similar or confusing, but in computing, keys are strictly unique.
• Speed of Access: Looking up a key in a dictionary is almost instant because of how computers store data, while physically finding a drawer takes more time.
• Dynamic Size: A dictionary can grow or shrink easily in memory, but a physical filing cabinet has a fixed number of drawers unless you buy a new cabinet.
• Data Types: In computing, keys and values can be many types of data (numbers, text, objects), but in the analogy, drawers and papers are physical objects.

Self-Check Question

In our filing cabinet analogy, what would be equivalent to the key in a dictionary?

Answer: The label on the drawer that identifies what is inside.

Key Result

Dictionaries are like filing cabinets with labeled drawers where each label (key) points to stored contents (value).

Practice

1. What is a dictionary in computing fundamentals?

easy

A. A sequence of characters forming a word

B. A list of numbers sorted in order

C. A type of loop used for iteration

D. A collection of key-value pairs for storing data

Solution

1. Step 1: Understand the definition of a dictionary

   A dictionary stores data as pairs where each key is linked to a value.

2. Step 2: Compare with other data types

   Unlike lists or strings, dictionaries use keys to quickly find values.

3. Final Answer:

   A collection of key-value pairs for storing data -> Option D

4. Quick Check:

   Dictionary = key-value pairs [OK]

Hint: Remember: dictionary = keys + values [OK]

Common Mistakes:

• Confusing dictionary with list or string
• Thinking dictionary is a type of loop
• Believing dictionary stores only numbers

2. Which of the following is the correct way to create a dictionary with keys 'name' and 'age'?

easy

A. ['name' = 'Alice', 'age' = 30]

B. {'name': 'Alice', 'age': 30}

C. {'name' -> 'Alice', 'age' -> 30}

D. ('name': 'Alice', 'age': 30)

Solution

1. Step 1: Identify correct dictionary syntax

   Dictionaries use curly braces {} with key:value pairs separated by commas.

2. Step 2: Check each option

   {'name': 'Alice', 'age': 30} uses correct syntax with colons and curly braces; others use wrong symbols or brackets.

3. Final Answer:

   {'name': 'Alice', 'age': 30} -> Option B

4. Quick Check:

   Dictionary syntax = curly braces + colons [OK]

Hint: Use curly braces and colons for dictionaries [OK]

Common Mistakes:

• Using square brackets instead of curly braces
• Using '=' or '->' instead of ':'
• Using parentheses instead of braces

3. What will be the output of the following code?

person = {'name': 'Bob', 'age': 25}
print(person['age'])

medium

A. Bob

B. Error

C. 25

D. 'age'

Solution

1. Step 1: Understand dictionary access by key

   Accessing person['age'] retrieves the value linked to key 'age'.

2. Step 2: Identify the value for key 'age'

   The value stored is 25, so print(person['age']) outputs 25.

3. Final Answer:

   25 -> Option C

4. Quick Check:

   person['age'] = 25 [OK]

Hint: Keys fetch their values directly from dictionary [OK]

Common Mistakes:

• Printing the key name instead of value
• Confusing key with value
• Expecting the whole dictionary to print

4. Identify the error in this dictionary code:

data = {'x': 10, 'y': 20, 'x': 30}
print(data['x'])

medium

A. Duplicate keys cause the last value to overwrite earlier ones

B. Syntax error due to missing comma

C. Keys must be numbers, not strings

D. Cannot print dictionary values directly

Solution

1. Step 1: Check for duplicate keys in dictionary

   The key 'x' appears twice; dictionaries keep only the last value for duplicates.

2. Step 2: Understand output of print statement

   Printing data['x'] shows 30, the last assigned value, overwriting 10.

3. Final Answer:

   Duplicate keys cause the last value to overwrite earlier ones -> Option A

4. Quick Check:

   Duplicate keys overwrite previous values [OK]

Hint: Duplicate keys keep only last value [OK]

Common Mistakes:

• Thinking duplicate keys cause syntax error
• Expecting both values to be stored
• Believing keys must be numbers

5. Given a list of students and their scores:

students = [('Anna', 85), ('Ben', 92), ('Cara', 85), ('Dan', 92)]

Which dictionary comprehension creates a dictionary mapping each student to their score?

hard

A. {name: score for name, score in students}

B. {score: name for name, score in students}

C. {name: score if score > 90 else 0 for name, score in students}

D. {score: name if name.startswith('A') else 'Unknown' for name, score in students}

Solution

1. Step 1: Understand the goal

   Create a dictionary with student names as keys and scores as values.

2. Step 2: Analyze each comprehension

   {name: score for name, score in students} correctly maps name: score. {score: name for name, score in students} reverses keys and values, causing score keys to overwrite. Options C and D add conditions changing values or keys incorrectly.

3. Final Answer:

   {name: score for name, score in students} -> Option A

4. Quick Check:

   Keys = names, Values = scores [OK]

Hint: Keys are unique; use names as keys to avoid overwriting [OK]

Common Mistakes:

• Using scores as keys causing overwrites
• Adding conditions that change keys incorrectly
• Confusing key-value order in comprehension