Data Structures- Hashmaps, Sets, Hash Tables, Hashing and Collisions
Observing hashmaps with python dictionaries
- What is a Hashtable/Hashmap?
- What is Hashing and Collision?
- What is a Set?
- Dictionary Example
- Hacks
- Own album + expanding on methods
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 ___.
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 ___.
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?
# There are no duplicates
# In order of defines
# Why do you think Sets are in the same tech talk as Hashmaps/Hashtables?
# Hashmaps unordered and unsorted values
# Sets are ordered values
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
# Keys and values
# 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"] = ['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 instead
# Edit the keys
# 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?
# .update
# add it manually
# Printing the dictionary
print(lover_album)
import json
# Own printing method
print(json.dumps(lover_album, indent = 4))
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?
# Add a options menu with advanced search functions
# Within the menu, have an option to search for a second key
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
import json
her_loss_album = {
"title": "Her Loss",
"artist": "Drake",
"year": 2022,
"genre": ["Rap", "Pop"],
"tracks": {
1: "Rich Flex",
2: "Major Distribution",
3: "On BS",
4: "BackOutsideBoyz",
5: "Privileged Rappers",
6: "Spin Bout U",
7: "Hours In Silence",
8: "Treacherous Twins",
9: "Circo Loco",
10: "P**** & Millions",
11: "Broke Boys",
12: "Middle of the Ocean",
13: "Jumbotron S*** Poppin",
14: "More M's",
15: "3AM on Glenwood",
16: "I Guess It's F*** Me",
}
}
the_goat_album = {
"title": "THE GOAT",
"artist": "Polo G",
"year": 2020,
"genre": ["Rap", "Pop"],
"tracks": {
1: "Don't Believe the Hype",
2: "Heartless (feat. Mustard)",
3: "Martin & Gina",
4: "Flex (feat. Juice WRLD)",
5: "Go Stupid",
6: "21",
7: "33",
8: "I Know",
9: "Beautiful Pain",
10: "No Matter What",
11: "Be Something",
12: "Relentless",
13: "DND",
14: "Chinatown",
15: "Trials & Tribulations",
16: "Whishing For A Hero (feat. BJ The Chicago Kid)",
}
}
favoriteAlbums = [her_loss_album, the_goat_album]
# Own printing method
print(json.dumps(favoriteAlbums, indent = 4))