Exam 9: Searching and Hashing Algorithms

Quadratic probing reduces primary clustering and probes all the positions in the table.

If you have 1000 items, each requiring 1 word of storage, chaining requires a total of 4000 words of storage.

The number of key comparisons in a sequential search depends on the value of the search item.

Linear probing that uses the increment value as a function of the key is called ____.

In double hashing, if a collision occurs at h(X), the probe sequence is generated by using the rule: ____

In the ____ method, if a collision occurs with the hash function h, we use a series of hash functions, h₁, h₂, . . ., h_s.

The same probe sequence is used for two nonidentical keys because random probing and quadratic probing are functions of the original key.

If two nonidentical keys are hashed to the same home position then the same probe sequence is followed for both keys.

In the analysis of an algorithm, the key comparisons refer to comparing the key of the search item with the position of an item in the list.

If the search item is the last element in the list, the algorithm makes ____ comparison(s).

Linear probing causes clustering that is called ____.

To implement hashing, we use four arrays.

When an item is deleted from the hash table indexStatusList at position, say k, we set indexStatusList[k] to ____.

Both random and quadratic probings eliminate primary clustering.

If the hash function causes a cluster at a particular home position and the cluster remains under these probings, it is called ____.

The ____ is an item's location in the array.

The best and worst cases are likely to occur most of the time that we apply the sequential search on a list.

____ is when more and more new keys would likely be hashed to the array slots that are already occupied.

The ____ method uses a random number generator to find the next available slot.

The most important operation performed on a list is the ____.