Data Structures- Hashmaps, Sets, Hash Tables, Hashing and Collisions
Observing hashmaps with python dictionaries
What is a Hashtable/Hashmap?
A hashtable is a data structure that with a collection of key-value pairs, where each key maps to a value, and the keys must be unique and hashable.
- In Python there is a built in hashtable known as a dictionary.
The primary purpose of a hashtable is to provide efficient lookup, insertion, and deletion operations. When an element is to be inserted into the hashtable, a hash function is used to map the key to a specific index in the underlying array that is used to store the key-value pairs. The value is then stored at that index. When searching for a value, the hash function is used again to find the index where the value is stored.
The key advantage of a hashtable over other data structures like arrays and linked lists is its average-case time complexity for lookup, insertion, and deletion operations.
- The typical time complexity of a hashtable is O(n).
What is Hashing and Collision?
Hashing is the process of mapping a given key to a value in a hash table or hashmap, using a hash function. The hash function takes the key as input and produces a hash value or hash code, which is then used to determine the index in the underlying array where the value is stored. The purpose of hashing is to provide a quick and efficient way to access data, by eliminating the need to search through an entire data structure to find a value.
However, it is possible for two different keys to map to the same hash value, resulting in a collision. When a collision occurs, there are different ways to resolve it, depending on the collision resolution strategy used.
Python's dictionary implementation is optimized to handle collisions efficiently, and the performance of the dictionary is generally very good, even in the presence of collisions. However, if the number of collisions is very high, the performance of the dictionary can degrade, so it is important to choose a good hash function that minimizes collisions when designing a Python dictionary.
What is a Set?
my_set = set([1, 2, 3, 2, 1])
print(my_set)
# What do you notice in the output?
# Took out all duplicate values
# Why do you think Sets are in the same tech talk as Hashmaps/Hashtables?
# Because both sets and dictionaries have no duplicates
lover_album = {
"title": "Lover",
"artist": "Taylor Swift",
"year": 2019,
"genre": ["Pop", "Synth-pop"],
"tracks": {
1: "I Forgot That You Existed",
2: "Cruel Summer",
3: "Lover",
4: "The Man",
5: "The Archer",
6: "I Think He Knows",
7: "Miss Americana & The Heartbreak Prince",
8: "Paper Rings",
9: "Cornelia Street",
10: "Death By A Thousand Cuts",
11: "London Boy",
12: "Soon You'll Get Better (feat. Dixie Chicks)",
13: "False God",
14: "You Need To Calm Down",
15: "Afterglow",
16: "Me! (feat. Brendon Urie of Panic! At The Disco)",
17: "It's Nice To Have A Friend",
18: "Daylight"
}
}
# What data structures do you see?
# Dictionary with strings and integers
# Printing the dictionary
print(lover_album)
print(lover_album.get('tracks'))
# or
print(lover_album['tracks'])
print(lover_album.get('tracks')[4])
# or
print(lover_album['tracks'][4])
lover_album["producer"] = set(['Taylor Swift', 'Jack Antonoff', 'Joel Little', 'Taylor Swift', 'Louis Bell', 'Frank Dukes'])
# What can you change to make sure there are no duplicate producers?
# Make it a set
# Printing the dictionary
print(lover_album)
lover_album["tracks"].update({19: "All Of The Girls You Loved Before"})
# How would add an additional genre to the dictionary, like electropop?
# instead of doing ["tracks"].update(), do ["genre"].update()
# Printing the dictionary
print(lover_album)
# for k,v in lover_album.items(): # iterate using a for loop for key and value
# print(str(k) + ": " + str(v))
# Write your own code to print tracks in readable format
print("Album Title:", lover_album["title"])
print("Artist:", lover_album["artist"])
print("Year:", lover_album["year"])
print("Genre:", ", ".join(lover_album["genre"]))
print("\nTracklist:")
for track_num, track_title in lover_album["tracks"].items():
print(track_num, "-", track_title)
# def search():
# search = input("What would you like to know about the album?")
# if lover_album.get(search.lower()) == None:
# print("Invalid Search")
# else:
# print(lover_album.get(search.lower()))
# search()
# This is a very basic code segment, how can you improve upon this code?
import random
random_track_num = random.choice(list(lover_album["tracks"].keys()))
random_track_title = lover_album["tracks"][random_track_num]
print("Randomly chosen track from the album:")
print(random_track_num, "-", random_track_title)
aewss = {
"title": "An Evening With Silk Sonic",
"artist": "Silk Sonic",
"year": 2022,
"genre": ["R&B", "Soul"],
"tracks": {
1: "Silk Sonic Intro",
2: "Leave the Door Open",
3: "Fly As Me",
4: "After Last Night (with Thundercat and Bootsy Collins)",
5: "Smokin Out The Window",
6: "Put On A Smile",
7: "777",
8: "Skate",
9: "Blast Off",
}
}
# Print the whole dictionary
print(aewss)
# Print just the tracks
print(aewss['tracks'])
# Print only the 3rd track (my personal favorite song)
print(aewss['tracks'][3])
# Add the deluxe bonus track
aewss["tracks"].update({10: "Love's Train"})
print("Added Deluxe Song: Love's Train")
print(" ")
print("Printing Complete Album:\n")
# for k,v in aewss.items(): # iterate using a for loop for key and value
# print(str(k) + ": " + str(v))
print("Album Title:", aewss["title"])
print("Artist:", aewss["artist"])
print("Year:", aewss["year"])
print("Genre:", ", ".join(aewss["genre"]))
print("\nTracklist:")
for track_num, track_title in aewss["tracks"].items():
print(track_num, "-", track_title)
random_track_number = random.choice(list(aewss["tracks"].keys()))
random_track = aewss["tracks"][random_track_number]
print(" ")
print("Here's a song recommendation:")
print(random_track_number, "-", random_track)
Hacks
- Answer ALL questions in the code segments
- Create a diagram or comparison illustration (Canva).
- What are the pro and cons of using this data structure?
- Dictionary vs List
- Expand upon the code given to you, possible improvements in comments
-
Build your own album showing features of a python dictionary
-
For Mr. Yeung's class: Justify your favorite Taylor Swift song, answer may effect seed
In my humble opinion, I think that You Belong with me is the greatest Taylor Swift song to ever be created. While all of her songs are absolute masterpieces, there's just something else about the storyline and plot of the music video which will always stick with me. The music video and lyrics are so relatable as it shows Taylor going through something which can happen to anyone. She's dealing with rejection and is seen as an absolute nerd, while having a crush on the popular football player. But as the song progresses, it shows how the football player gets cheated on by his girlfriend, and that's when he truly realizes Taylor's true beauty. The character development is equisite, and it's just overall an unbelievable song. It was #11 on my spotify wrapped in 2021, and is probably one of my favorite songs ever.