Hash table applications in Data Structures Theory - Mini Project: Build & Apply

Hash Table Applications

📖 Scenario: You are organizing a small library's book collection. You want to quickly find if a book is available by its title and also count how many times each author appears in the collection.

🎯 Goal: Build a simple hash table application using a dictionary to store book titles and authors, then count the number of books per author.

📋 What You'll Learn

Create a dictionary called books with exact book titles as keys and author names as values

Create a variable called author_counts to store the count of books per author

Use a for loop with variables title and author to iterate over books.items()

Update author_counts to count how many books each author has

Add a final step to complete the author_counts dictionary with all authors and their counts

💡 Why This Matters

🌍 Real World

Libraries, bookstores, and inventory systems use hash tables to quickly find and count items like books or products.

💼 Career

Understanding hash table applications is important for roles in software development, data analysis, and database management where fast data lookup and counting are common tasks.

1

Create the books dictionary

Create a dictionary called books with these exact entries: 'The Hobbit': 'J.R.R. Tolkien', '1984': 'George Orwell', 'Pride and Prejudice': 'Jane Austen', 'The Silmarillion': 'J.R.R. Tolkien', 'Animal Farm': 'George Orwell'.

Data Structures Theory

# Create the books dictionary with titles and authors
# Your code here

Hint

Use curly braces {} to create a dictionary with the exact book titles as keys and authors as values.

2

Create the author_counts dictionary

Create an empty dictionary called author_counts to store the count of books per author.

Data Structures Theory

books = {
    'The Hobbit': 'J.R.R. Tolkien',
    '1984': 'George Orwell',
    'Pride and Prejudice': 'Jane Austen',
    'The Silmarillion': 'J.R.R. Tolkien',
    'Animal Farm': 'George Orwell'
}
# Create an empty dictionary called author_counts
# Your code here

Hint

Use {} to create an empty dictionary named author_counts.

3

Count books per author

Use a for loop with variables title and author to iterate over books.items(). Inside the loop, update author_counts to add 1 to the count for each author. If the author is not yet in author_counts, add them with a count of 1.

Data Structures Theory

books = {
    'The Hobbit': 'J.R.R. Tolkien',
    '1984': 'George Orwell',
    'Pride and Prejudice': 'Jane Austen',
    'The Silmarillion': 'J.R.R. Tolkien',
    'Animal Farm': 'George Orwell'
}
author_counts = {}
# Use a for loop to count books per author
# Your code here

Hint

Use for title, author in books.items(): to loop through the dictionary. Use an if statement to check if the author is already in author_counts.

4

Complete the author_counts dictionary

Add a final line to ensure author_counts contains all authors from books with their correct counts. This completes the hash table application for counting books per author.

Data Structures Theory

books = {
    'The Hobbit': 'J.R.R. Tolkien',
    '1984': 'George Orwell',
    'Pride and Prejudice': 'Jane Austen',
    'The Silmarillion': 'J.R.R. Tolkien',
    'Animal Farm': 'George Orwell'
}
author_counts = {}
for title, author in books.items():
    if author in author_counts:
        author_counts[author] += 1
    else:
        author_counts[author] = 1
# Finalize the author_counts dictionary
# Your code here

Hint

The counting logic is complete. This final step confirms the dictionary is ready for use.

Practice

1. What is the main advantage of using a hash table in data storage?

easy

A. It encrypts data for security

B. It stores data in a sorted order automatically

C. It compresses data to save space

D. It allows very fast data lookup using keys

Solution

1. Step 1: Understand hash table purpose

   Hash tables use keys to quickly find stored data without searching all items.

2. Step 2: Compare options with hash table features

   Only fast lookup matches hash table's main advantage; sorting, compression, encryption are unrelated.

3. Final Answer:

   It allows very fast data lookup using keys -> Option D

4. Quick Check:

   Fast lookup = It allows very fast data lookup using keys [OK]

Hint: Hash tables are all about quick key-based access [OK]

Common Mistakes:

• Confusing hash tables with sorted data structures
• Thinking hash tables compress or encrypt data
• Assuming hash tables store data in order

2. Which of the following is the correct way to check if a key exists in a hash table?

easy

A. if hash_table.has_key(key):

B. if key in hash_table:

C. if key.exists(hash_table):

D. if hash_table.contains(key):

Solution

1. Step 1: Recall common syntax for key existence

   In many languages like Python, 'if key in hash_table:' is the standard way.

2. Step 2: Evaluate other options

   Methods like has_key() are outdated or language-specific; others are incorrect syntax.

3. Final Answer:

   if key in hash_table: -> Option B

4. Quick Check:

   Standard syntax = if key in hash_table: [OK]

Hint: Use 'in' keyword to check keys in hash tables [OK]

Common Mistakes:

• Using outdated methods like has_key()
• Trying non-existent methods like exists() or contains()
• Confusing key existence with value checks

3. Consider a hash table used to count word occurrences in a text. After processing the text, what will be the value of counts['apple'] if the word 'apple' appears 3 times?

medium

A. 3

B. 1

C. 0

D. undefined

Solution

1. Step 1: Understand counting with hash tables

   Each time 'apple' appears, the count increments by 1 in the hash table.

2. Step 2: Calculate final count for 'apple'

   Since 'apple' appears 3 times, the count stored is 3.

3. Final Answer:

   3 -> Option A

4. Quick Check:

   Count of 'apple' = 3 [OK]

Hint: Count increments match word occurrences [OK]

Common Mistakes:

• Assuming count starts at 0 and stays 0
• Confusing count with boolean existence
• Thinking the value is undefined if key exists

4. A hash table implementation is returning incorrect results when two different keys produce the same hash value. What is the likely problem?

medium

A. The hash function is too slow

B. Keys are not strings

C. Collision handling is missing or incorrect

D. The table size is too large

Solution

1. Step 1: Identify issue with same hash values

   When two keys have the same hash, it's called a collision.

2. Step 2: Understand collision handling importance

   If collisions are not handled properly, data can overwrite or be lost, causing errors.

3. Final Answer:

   Collision handling is missing or incorrect -> Option C

4. Quick Check:

   Collision handling = missing or incorrect [OK]

Hint: Collisions need special handling to avoid errors [OK]

Common Mistakes:

• Blaming hash function speed instead of collision handling
• Thinking key type causes collisions
• Assuming larger table size fixes collisions alone

5. You want to find all unique items from a large list quickly. Which hash table application is best suited for this task?

hard

A. Using a hash table to store items as keys and ignore duplicates

B. Using a hash table to count occurrences of each item

C. Using a hash table to sort the list items

D. Using a hash table to encrypt the list items

Solution

1. Step 1: Understand the goal of finding unique items

   We want to keep only one copy of each item, ignoring duplicates.

2. Step 2: Choose hash table usage that stores keys uniquely

   Storing items as keys automatically ignores duplicates because keys are unique.

3. Step 3: Eliminate other options

   Counting occurrences is extra work; sorting or encrypting does not find unique items efficiently.

4. Final Answer:

   Using a hash table to store items as keys and ignore duplicates -> Option A

5. Quick Check:

   Unique items = store as keys ignoring duplicates [OK]

Hint: Store items as keys to keep only unique entries [OK]

Common Mistakes:

• Using counting when only uniqueness is needed
• Thinking sorting helps find unique items faster
• Confusing encryption with uniqueness