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 constant (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?
# ANSWER: the output is consists of all unique numbers
# Why do you think Sets are in the same tech talk as Hashmaps/Hashtables?
# ANSWER: Sets may also deal with collisions the same as dictionaries, by making sure values are unique
# --> 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?
# list (genre)
# dictionary (tracks)
# Printing the dictionary
print(lover_album)
print(lover_album.get('tracks'))
# or
print(lover_album['tracks'])
print(lover_album.get('tracks')[4]) # using .get
# or
print(lover_album['tracks'][4]) # using index
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?
# We can make the producers a set instead of a list
# 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?
# note: .update did not work for lists; have to use .append
lover_album["genre"].append("electropop")
# Printing the dictionary
print(lover_album)
def album_print():
for k,v in lover_album.items(): # iterate using a for loop for key and value
if k == "tracks":
print("tracks:")
for track in lover_album['tracks']:
print(lover_album['tracks'][track])
else:
print(str(k) + ": " + str(v))
album_print()
def album_search():
print("1: title")
print("2: artist")
print("3: year")
print("4: genre")
print("5: tracks")
print("6: producer(s)")
search = input("What would you like to know about the album: Lover?")
if search == "1":
print("")
print("TITLE:")
print(lover_album.get('title'))
elif search == "2":
print("")
print("ARTIST")
print(lover_album.get('artist'))
elif search == "3":
print("")
print("YEAR")
print(lover_album.get('year'))
elif search == "4":
print("")
print("GENRE")
print(lover_album.get('genre'))
elif search == "5":
print("")
print("TRACKS:")
for track in lover_album['tracks']:
print(lover_album['tracks'][track])
elif search == "6":
print("")
print("PRODUCERS")
print(lover_album.get('producer'))
album_search()
# This is a very basic code segment, how can you improve upon this code?
#
Hacks
- Answer ALL questions in the code segments
done - 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
done -
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
new_album = {
"title": "Heatwave",
"artist": "HARBOUR",
"year": 2017,
"genre": ["Indie Rock"],
"tracks": {
1: "Waittyn",
2: "Ily",
3: "Get You High",
4: "Obvious",
5: "Float",
6: "Soco",
7: "Judy You Hung the Moon",
8: "Radiate",
9: "With Love",
10: "Saddest Game",
11: "Undone",
}
}
print(new_album)
def new_album_search():
print("1: title")
print("2: artist")
print("3: year")
print("4: genre")
print("5: tracks")
print("6: producer(s)")
search = input("What would you like to know about the album: Heatwave?")
if search == "1":
print("")
print("TITLE:")
print(new_album.get('title'))
elif search == "2":
print("")
print("ARTIST")
print(new_album.get('artist'))
elif search == "3":
print("")
print("YEAR")
print(new_album.get('year'))
elif search == "4":
print("")
print("GENRE")
print(new_album.get('genre'))
elif search == "5":
print("")
print("TRACKS:")
for track in new_album['tracks']:
print(new_album['tracks'][track])
elif search == "6":
print("")
print("PRODUCERS")
print(new_album.get('producer'))
new_album_search()