Exam 9: Searching and Hashing Algorithms

When we check the array locations t, (t + 1) % HTSize, (t + 2) % HTSize, . . ., (t + j) % HTSize it is called the ____ of the hash table.

The keys of the items in a data set are used in such operations as searching, sorting, insertion, and deletion.

In ____, we assume that the array is circular so that if the lower portion of the array is full, we can continue the search in the top portion of the array.

Sequential and binary search algorithms are called ____ search algorithms.

All insertions and searches in the random probing method use a different sequence of random numbers.

The search item is called the ____.

If the sequential search is unsuccessful, -1 is returned.

A list is ordered if its elements are ordered according to some criteria.

The analysis of algorithms enables programmers to decide which algorithm to use for a specific application.