Why data structure choice affects system performance in Data Structures Theory - See It in Action

Why Data Structure Choice Affects System Performance

📖 Scenario: Imagine you are organizing a small library of books at home. You want to find books quickly, add new books, and sometimes remove old ones. How you arrange your books affects how fast you can do these tasks.

🎯 Goal: Build a simple example showing how choosing different data structures (list and dictionary) affects the speed of finding a book by its title.

📋 What You'll Learn

Create a list of book titles with exact values

Create a dictionary mapping book titles to their authors

Write code to find a book title in the list using a loop

Write code to find a book title in the dictionary using direct access

💡 Why This Matters

🌍 Real World

Choosing the right data structure helps software run faster and use less memory, which is important in apps, websites, and games.

💼 Career

Software developers and data engineers must pick suitable data structures to build efficient and scalable systems.

1

Create a list of book titles

Create a list called book_titles with these exact strings: 'The Hobbit', '1984', 'Pride and Prejudice', 'To Kill a Mockingbird', 'The Great Gatsby'.

Data Structures Theory

# Create the list book_titles with the given book names
# Your code here

Need a hint?

Use square brackets [] to create a list and separate items with commas.

2

Create a dictionary of books and authors

Create a dictionary called books_dict with these exact key-value pairs: 'The Hobbit': 'J.R.R. Tolkien', '1984': 'George Orwell', 'Pride and Prejudice': 'Jane Austen', 'To Kill a Mockingbird': 'Harper Lee', 'The Great Gatsby': 'F. Scott Fitzgerald'.

Data Structures Theory

book_titles = ['The Hobbit', '1984', 'Pride and Prejudice', 'To Kill a Mockingbird', 'The Great Gatsby']
# Create the dictionary books_dict with the given book-author pairs
# Your code here

Need a hint?

Use curly braces {} to create a dictionary with key-value pairs separated by colons.

3

Find a book title in the list using a loop

Write a for loop using variables title to check each item in book_titles. Inside the loop, use an if statement to check if title equals '1984'. If yes, assign found_in_list = True and break the loop. Before the loop, set found_in_list = False.

Data Structures Theory

book_titles = ['The Hobbit', '1984', 'Pride and Prejudice', 'To Kill a Mockingbird', 'The Great Gatsby']
books_dict = {
    'The Hobbit': 'J.R.R. Tolkien',
    '1984': 'George Orwell',
    'Pride and Prejudice': 'Jane Austen',
    'To Kill a Mockingbird': 'Harper Lee',
    'The Great Gatsby': 'F. Scott Fitzgerald'
}

# Search for '1984' in book_titles using a for loop
# Your code here

Need a hint?

Use a for loop to check each title. Use an if statement to compare with '1984'. Use break to stop once found.

4

Find a book title in the dictionary using direct access

Check if '1984' is a key in books_dict using if '1984' in books_dict. If yes, assign found_in_dict = True, else assign found_in_dict = False.

Data Structures Theory

book_titles = ['The Hobbit', '1984', 'Pride and Prejudice', 'To Kill a Mockingbird', 'The Great Gatsby']
books_dict = {
    'The Hobbit': 'J.R.R. Tolkien',
    '1984': 'George Orwell',
    'Pride and Prejudice': 'Jane Austen',
    'To Kill a Mockingbird': 'Harper Lee',
    'The Great Gatsby': 'F. Scott Fitzgerald'
}

found_in_list = False
for title in book_titles:
    if title == '1984':
        found_in_list = True
        break

# Check if '1984' is in books_dict using if statement
# Your code here

Need a hint?

Use the in keyword to check if a key exists in a dictionary.