Hashing Quiz

What are the two approaches to data storage/access that have been studied so far?

• Contiguous and Non-contiguous

• Array and Linked List

• Hashing and Binary Search

• Sequential and Sorted

In the 'perfect' hashing example, how is each employee's idNum mapped to the array index?

• Using linear probing

• Using a hash function

• Using double hashing

• Directly

What is the hash function used in the 'perfect' hashing example?

• h(key) = key % 100

• h(key) = key

• h(key) = key * key

• h(key) = key * 2

What is the range of idNum in the more realistic hashing example?

• 0-9999

• 0-999

• 0-99999

• 0-99

What is the purpose of a hash function in hashing?

• To store data sequentially

• To access data using linear search

• To manipulate the key of an element

• To sort the data in the hash table

What is the condition resulting when two or more keys produce the same hash location?

• Chaining

• Collision

• Clustering

• Probing

What is the name of the collision-handling algorithm that resolves collisions by sequentially searching the hash table?

• Mid-square Hashing

• Double Hashing

• Chaining

• Linear Probing

What happens when a key hashes to the last index of the array and there is a collision?

• The key is stored in a random location

• The key is stored in the first index of the array

• The key is stored in the next available location

• The key is not stored in the array

What is the main disadvantage of linear probing?

• It causes clustering

• It cannot handle collisions

• It has a slow search speed

• It requires the array to be sorted

What is the most common technique to avoid clustering in hashing?

• Mid-square Hashing

• Linear Probing

• Chaining

• Double Hashing