Exam 14: Multi-Way Search Trees

What is the boundary folding method?

The __________ method is very effective when dealing with an unknown set of key values.

In the shift folding method, the parts of the key are added together to create the index.

What is the mid-square method?

In the ______ method, the parts of the key are added together to create the index.

______ involves using only a part of the element's value or key to compute the location at which to store the element.

The chaining method for handling collisions simply treats the hash table conceptually as a table of individual cells rather than as a table of collections.

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.

The load factor is the ______ percentage occupancy allowed in the hash table before it is resized.

What is the radix transformation method?

What is chaining?

What is our goal for a hashing function?

A hashing function that maps each element to a unique position in the table is said to be a _________ hashing function.

What is a collision in a hash table?

A hashing function that maps each element to a unique position in the table is said to be an ideal hashing function.

The load factor is the minimum percentage occupancy allowed in the hash table before it is resized.

Extraction involves using only a part of the element's value or key to compute the location at which to store the element.

What is the shift folding method?

What is the consequence of not having a good hashing function?

The ______ method for handling collisions simply treats the hash table conceptually as a table of collections rather than as a table of individual cells.