Accessing Dictionary Values

From Positions to Labels

Suppose you need to store information about a person: their name, age, email, and phone number. A list could hold these pieces of information, but you would need to remember that position 0 contains the name, position 1 contains the age, and so on. Anyone reading the data would have to memorize what each number means.

A dictionary solves this organization problem by using meaningful labels called keys. Instead of remembering that position 0 contains a name, you can associate the value with the key name. To retrieve the value, you provide the label that identifies what you want.

Two Access Systems

A list is a sequence accessed by position. Its indices must be integers, so an expression such as my_list[0] asks for the item at the first position. A dictionary is a mapping accessed by key. An expression such as my_dict['name'] asks for the value associated with the key name. The key directly identifies the requested data instead of making you count positions.

Following a Key

Think of a dictionary as a collection of links from keys to values. When you provide a key, the dictionary follows the mapping and returns the value connected to that key. The dictionary does not treat the key as a position to count toward. It uses the key itself to locate the associated value.

Key-Value Pairs

The phone-book analogy makes this relationship clear. A person's name acts as the key, and the person's phone number acts as the value. You use the name to look up the phone number. The dictionary stores that key and value as one connected relationship.

A Translation Lookup

This example demonstrates why a dictionary is more natural than a list for the task. A list would require a position and would not make the English-to-Spanish relationship visible. A dictionary makes the relationship explicit: each English word is a key, and each Spanish word is the value mapped to it.

Why Non-Integer Keys Help

Dictionary keys can be almost any type, including strings, numbers, and tuples. This differs from list indices, which must be integers. Because a dictionary key can describe what a value represents, the data becomes easier to read and retrieve. Examples include using name, age, and email for person information or student_id and grade for student information.

Meaningful keys also avoid a specific problem with lists: finding information when you do not know its position. With a list, you may need to search through the entire list to find an email. With a dictionary, the email key directly identifies the value to retrieve. The source material describes this direct lookup as more readable and faster than searching by position.

Mistakes to Avoid

• Treating a dictionary like a list

  A dictionary is not a sequence indexed by position. Its lookup uses a key.

  Fix: Identify the key that labels the value you want, such as name or email.

• Confusing a key with its value

  In a key-value pair, email is the key and the associated email address is the value.

  Fix: Separate the lookup label from the data returned by that lookup.

• Assuming every key must be an integer

  Dictionary keys can be almost any type, including strings, numbers, and tuples.

  Fix: Choose a key that meaningfully identifies the value.

• Forgetting that a key maps to one value

  Each key maps to exactly one value in the dictionary relationship described here.

  Fix: Think of each key and its associated value as one key-value pair.

Practice the Lookup

Key Ideas

1. A list is accessed by integer position, while a dictionary is accessed by key.
2. A dictionary is a mapping between keys and values rather than a sequence indexed by position.
3. A key-value pair is the fundamental unit of a dictionary: one key maps to exactly one value.
4. Keys can be almost any type, including strings, numbers, and tuples, so they can serve as meaningful labels.
5. Direct key lookup makes data retrieval more readable and faster than searching through a list by position.