Exam 9: Searching and Hashing Algorithms

The unique member of an item is called the ____ of the item.

The sequential search is also called a ____ search.

In linear probing, starting at location t, we search the array sequentially to find the next available array slot.

Associated with each item in a data set is a special member that uniquely identifies the item in the data set.

In the random probing method, the ith slot in the probe sequence is ____.

The binary search algorithm uses the ____ technique to search the list.

A new item can be inserted at the beginning of the linked list because the data in a linked list is in no particular order.

When performing a sequential search, we assume all list elements are equally likely to be the target.

The sequential search always starts at the last element in the list and continues until either the item is found in the list or the entire list is searched.

You cannot write a recursive algorithm to implement a sequential search algorithm.

A binary search can be performed only on ____.

From the binary search algorithm, it follows that every iteration of the while loop cuts the size of the search list by half.

In ____, the data is stored within the hash table.

When an item is added to the hash table indexStatusList at position, say i, we set indexStatusList[i] to ____.

Open addressing can be implemented in several ways.

The elements of a list are usually in descending order.

One way to improve linear probing is to skip array positions by a ____.

In hashing, the data is organized with the help of a table, called the ____.

When analyzing a search algorithm, we count the number of key comparisons because this number gives us the most useful information.

In a sequential search, if the search item is the first element of a list, we make ____ comparison(s).