|
21. Hashing9 Questions
Created by Y. Daniel Liang
- http://www.cs.armstrong.edu/liang/index.html
Free
|
A hashing function __________.
If each key is mapped to a different index in the hash table, it is called _______.
A collision occurs _____________.
Two objects have the same hash Codes if they are equal.
If two strings are equal, the two strings have the same hash Codes.
_____________ is to find an open location in the hash table in the event of collision.
When a collision occurs during the insertion of an entry to a hash table, ______ finds the next available location sequentially.
The __________ places all entries with the same hash index into the same location, rather than finding new locations.
_______ measures how full the hash table is.
