In hashing, elements are stored in a hash table, with their _________ in the table
determined by a hashing function.
A. Order
The situation where two elements or keys map to the same location in the table
is called a __________.
D. None of the above
A hashing function that maps each element to a unique position in the table is
said to be a _________ hashing function.
A. Good
Extraction involves using _________ of the element’s value or key to compute
the location at which to store the element.
A. All
The __________ method is very effective when dealing with an unknown set of
D. Length Dependent
In the shift folding method, the parts of the key are _______ together to create
the index.
D. None of the above
The _____________ method and the mid-square method may also be effectively
used with strings by manipulating the binary representations of the characters in
the string.
A. Division
The chaining method for handling __________ simply treats the hash table
conceptually as a table of collections rather than as a table of individual cells.
A. Division
The open addressing method for handling collisions looks for another open
position in the table other than the one to which the element is originally hashed.
A. Chained
The ____________ is the maximum percentage occupancy allowed in the hash
table before it is resized.
D. None of the above
The situation where two elements or keys map to the same location in the table
table is said to be a perfect hashing function.
compute the location at which to store the element.
of key values.
create the index.
conceptually as a table of collections rather than as a table of individual cells.
open position in the table other than the one to which the element is originally
hashed.
hash table before it is resized.
the table determined by a hashing function.
True/False. The situation where two elements or keys map to the same location
in the table is called a collision.
the table is said to be an ideal hashing function.
compute the location at which to store the element.
unknown set of key values.
to create the index.
be used with strings.
table conceptually as a table of individual cells rather than as a table of
collections.
another open position in the table other than the one to which the element is
originally hashed.
the hash table before it is resized.
What is the difference between a hash table and the other collections we have
discussed?
What is a collision in a hash table?
What is a perfect hashing function?
What is our goal for a hashing function?
What is the consequence of not having a good hashing function?
What is the extraction method?
What is the division method?
What is the shift folding method?
What is the boundary folding method?
What is the radix transformation method?
What is the digit analysis method?
What is the length-dependent method?
What is chaining?
What is open addressing?
What are linear probing, quadratic probing, and double hashing?
Why is deletion from an open addressing implementation a problem?
What is the load factor and how does it affect table size?