Understanding Lists: Creation and Modification

A Sequence That Stays Fixed

Tuples look similar to lists because both are sequences of values that can be accessed by integer positions. Their important difference is what happens after creation: a list can have items added, removed, or modified, while a tuple keeps its elements fixed. That fixed structure is useful when changing the sequence would be an error.

Tuple Creation and Structure

A tuple groups related values into one ordered sequence. In the notation used in this lesson, the values are separated by commas and surrounded by parentheses. For example, (10, 20) represents a two-element tuple: the first element is 10 and the second element is 20. The order matters because each value occupies a particular integer position.

Integer Positions and Access

Tuple elements are accessed with the bracket operator and integer indices. Index 0 identifies the first element, and index -1 identifies the last element. Positive positions move from the beginning of the tuple; negative positions count from the end. An index must identify an existing position. If it does not, the requested element cannot be accessed.

Why Tuple Contents Cannot Change

Immutability means that a tuple's elements cannot be changed after creation. Attempting to replace an element, add an element, or remove an element conflicts with the tuple's fixed structure. This is different from a list, whose contents can be modified after creation.

Tuples as Dictionary Keys

Tuples are hashable because they are immutable. This allows an entire tuple to be used as a dictionary key. Lists do not have this capability. A tuple can therefore represent a fixed group of values used to identify one dictionary entry, such as a coordinate-like pair or another grouping whose contents should not change.

Useful Tuple Operations

Immutability does not prevent every operation on a tuple. Most sequence operators also work with tuples. Tuples can be concatenated, repeated, sliced, and checked for membership. They can also be compared element by element from left to right. Two tuples are equal when they have the same length and corresponding elements are equal. For ordering comparisons, Python examines the first elements; if those are equal, it continues to the next positions.

Mistakes with Tuple Modification

• Treating a tuple like a list after it has been created.

  A tuple is immutable, so its elements cannot be changed after creation.

  Fix: Choose a list when the sequence must be modified frequently. Choose a tuple when its contents should remain fixed.

• Forgetting that tuple positions are integer-based.

  Tuple elements are accessed using integer indices and the bracket operator.

  Fix: Use index 0 for the first element and -1 for the last element, while ensuring the requested position exists.

• Assuming that every sequence can be a dictionary key.

  Immutability makes tuples hashable, while lists do not have this dictionary-key capability.

  Fix: Use a tuple when the complete sequence needs to serve as a dictionary key.

Practice and Summary

1. Tuples are immutable, integer-indexed sequences. Create them as ordered groups of values, access their elements with integer indices, and remember that their elements cannot be replaced, added, or removed after creation. Their immutability makes them hashable, so tuples can be used as dictionary keys. Use tuples for fixed structures and lists when the sequence must remain flexible.