Back to marketplace
Hashing š„
No description yet. This curated deck is ready for daily study.
Total cards: 7ā¢Content version: v3ā¢Public deckā¢Updated: 8/1/2026
Card preview (7)
#1
Front (Question)
what is hashing
Back (Answer)
Given a key we apply an algorithm which returns an index to store the data at
#2
Front (Question)
A basic example of a hashing algorithm
Back (Answer)
mod 7 when there is 7 different data locations
#3
Front (Question)
Whats a collision
Back (Answer)
When the hashing algorithm outputs the same index for 2 or more keys
#4
Front (Question)
1st solution to collisions
Back (Answer)
store multiple values at the same index using a linked list
#5
Front (Question)
2nd solution to collisions
Back (Answer)
Use the next free available memory location
#6
Front (Question)
solution 3
Back (Answer)
Use a bigger table and different hash function
#7
Front (Question)
What is a dictionary?
Back (Answer)
It like a hash table it contains a set of keys and each key has a single associated value