See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Data structure with table/array & key for storing key/value pairs
Key combined with its associated data
Creates unique index from key data to locate storage position
When algorithm produces same index for different keys
Adding key/value pair to linked list at same index when collision
Running hashing algorithm again when collision occurs
Abstract data type that maps keys to data (associative array)
High-speed temporary storage area for frequently accessed data
Ratio of occupied indices to total indices available
Verify whether data has been corrupted during transmission
Select your subjects, and get access to A+ resources today.