Question 1

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

Accepted Answer

A)   index
B)   primacy
C)   primitive
D)   key D

Question 2

The sequential search is also called a ____ search.

Accepted Answer

A)   non-linear
B)   quadratic
C)   linear
D)   binomial C

Question 3

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

Accepted Answer

A) True 
 B)False  True

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

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

Accepted Answer

A)   (h(X)  % HTSize)  + ri
B)   (h(X)  + HTSize)  % ri
C)   (h(X)  % ri)  + HTSize
D)   (h(X)  + ri)  % HTSize

Question 6

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

Accepted Answer

A)   divide-and-conquer
B)   divide-and-divide
C)   conquer-and-resign
D)   divide-and-resign

Question 7

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.

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

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.

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

A binary search can be performed only on ____.

Accepted Answer

A)   unordered lists
B)   arrays
C)   comparable lists
D)   ordered lists

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

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

Accepted Answer

A)   closed addressing
B)   open addressing
C)   inverted addressing
D)   converted addressing

Question 14

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

Accepted Answer

A)   -1
B)   0
C)   1
D)   2

Question 15

Open addressing can be implemented in several ways.

Accepted Answer

A) True 
 B)False

Question 16

The elements of a list are usually in descending order.

Accepted Answer

A) True 
 B)False

Question 17

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

Accepted Answer

A)   fixed constant
B)   random constant
C)   dynamic value
D)   key-relative value

Question 18

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

Accepted Answer

A)   key table
B)   index table
C)   hash table
D)   relative table

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

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

Accepted Answer

A)   one
B)   two
C)   three
D)   n

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) .