Hash function concept in Data Structures Theory - Mini Project: Build & Apply

Understanding Hash Function Concept

📖 Scenario: You are learning how computers quickly find information using a method called hashing. Imagine a library where each book has a special number that helps you find it fast on the shelves.

🎯 Goal: Build a simple example that shows how a hash function assigns a number to a word, helping to find it quickly.

📋 What You'll Learn

Create a list of words to store

Define a simple hash function that converts a word to a number

Apply the hash function to each word to get its hash value

Show how the hash values relate to the original words

💡 Why This Matters

🌍 Real World

Hash functions are used in computer systems to quickly find data, like passwords, files, or database entries.

💼 Career

Understanding hashing is important for jobs in software development, cybersecurity, and data management.

1

Create a list of words

Create a list called words with these exact words: "apple", "banana", "cherry", "date", and "elderberry".

Data Structures Theory

# Create the list called words with the given words
# Your code here

Hint

Use square brackets to create a list and separate words with commas.

2

Define a simple hash function

Define a function called simple_hash that takes a word and returns the sum of the Unicode values of its letters using ord().

Data Structures Theory

words = ["apple", "banana", "cherry", "date", "elderberry"]
# Define the function simple_hash(word) below
# Your code here

Hint

Use a for loop to add the Unicode values of each letter in the word.

3

Apply the hash function to each word

Create a dictionary called hashes that stores each word from words as a key and its hash value from simple_hash(word) as the value using a for loop.

Data Structures Theory

words = ["apple", "banana", "cherry", "date", "elderberry"]
def simple_hash(word):
    total = 0
    for letter in word:
        total += ord(letter)
    return total

# Create the dictionary hashes with word: hash pairs
# Your code here

Hint

Start with an empty dictionary and fill it by looping through each word.

4

Complete the hash example

Add a comment explaining that the dictionary hashes shows how each word is linked to a number by the hash function.

Data Structures Theory

words = ["apple", "banana", "cherry", "date", "elderberry"]
def simple_hash(word):
    total = 0
    for letter in word:
        total += ord(letter)
    return total

hashes = {}
for word in words:
    hashes[word] = simple_hash(word)

# Add a comment explaining the purpose of the hashes dictionary
# Your code here

Hint

Write a clear comment describing what the hashes dictionary represents.

Practice

1. What is the main purpose of a hash function in data structures?

easy

A. To encrypt data for security

B. To sort data in alphabetical order

C. To compress data into smaller files

D. To convert data into a fixed-size number for quick access

Solution

1. Step 1: Understand the role of a hash function

   A hash function takes input data and produces a fixed-size number called a hash code.

2. Step 2: Identify the purpose in data structures

   This fixed-size number helps quickly find or organize data, improving access speed.

3. Final Answer:

   To convert data into a fixed-size number for quick access -> Option D

4. Quick Check:

   Hash function = fixed-size number for quick access [OK]

Hint: Hash functions create quick lookup numbers [OK]

Common Mistakes:

• Confusing hashing with sorting
• Thinking hash functions compress data
• Assuming hash functions encrypt data

2. Which of the following is a correct property of a good hash function?

easy

A. It always produces the same output for the same input

B. It changes output randomly each time for the same input

C. It produces outputs larger than the input size

D. It sorts the input data before hashing

Solution

1. Step 1: Recall the determinism property of hash functions

   A good hash function must always produce the same output for the same input to be reliable.

2. Step 2: Evaluate other options

   Random outputs or sorting inputs are not properties of hash functions; output size is fixed, not necessarily larger.

3. Final Answer:

   It always produces the same output for the same input -> Option A

4. Quick Check:

   Deterministic output = same input same output [OK]

Hint: Good hash functions are consistent, not random [OK]

Common Mistakes:

• Thinking hash outputs change each time
• Believing hash functions sort data
• Assuming output size varies unpredictably

3. Consider a hash function that sums the ASCII values of characters in a string and then takes modulo 10. What is the hash value of "abc"?

medium

A. 4

B. 3

C. 5

D. 6

Solution

1. Step 1: Calculate ASCII values of each character

   'a' = 97, 'b' = 98, 'c' = 99; sum = 97 + 98 + 99 = 294.

2. Step 2: Apply modulo 10 to the sum

   294 % 10 = 4.

3. Final Answer:

   4 -> Option A

4. Quick Check:

   (97+98+99) mod 10 = 4 [OK]

Hint: Sum ASCII codes then mod 10 for hash [OK]

Common Mistakes:

• Adding character positions instead of ASCII
• Forgetting to apply modulo operation
• Calculating modulo with wrong divisor

4. A hash function is defined as hash(x) = (3 * x + 7) % 5. What is the error if the function returns values outside 0 to 4?

medium

A. The multiplication factor should be negative

B. The function should add 5 instead of 7

C. The modulo operation is missing or incorrect

D. The input x must be a string, not a number

Solution

1. Step 1: Understand modulo operation range

   Modulo 5 should limit output to 0 through 4 only.

2. Step 2: Identify cause of out-of-range values

   If outputs are outside 0-4, the modulo operation is either missing or applied incorrectly.

3. Final Answer:

   The modulo operation is missing or incorrect -> Option C

4. Quick Check:

   Modulo ensures output range 0-4 [OK]

Hint: Modulo keeps hash values in range [OK]

Common Mistakes:

• Ignoring modulo effect on output range
• Changing constants without reason
• Confusing input type requirements

5. You want to design a hash function for a phone book that minimizes collisions. Which approach is best?

hard

A. Use the length of the phone number as the hash value

B. Use the sum of digits in the phone number modulo a prime number

C. Use only the first digit of the phone number as the hash

D. Use the phone number reversed without modulo

Solution

1. Step 1: Understand collision minimization

   Minimizing collisions means spreading hash values evenly across possible outputs.

2. Step 2: Evaluate each option's effectiveness

   Using sum of digits modulo a prime number distributes values better than using only first digit, length, or reversed number without modulo.

3. Final Answer:

   Use the sum of digits in the phone number modulo a prime number -> Option B

4. Quick Check:

   Sum digits mod prime reduces collisions [OK]

Hint: Sum digits mod prime spreads hash values well [OK]

Common Mistakes:

• Using only part of input causing many collisions
• Ignoring modulo operation
• Choosing non-prime modulo numbers