1. . (TCO 6) Which of the following is a search algorithm or technique? (Points : 3)
Recursive search
Binary search
Fibonacci sequence
Divide and conquer

2. (TCO 6) In a binary search, the main loop executes approximately _____. (Note: Below, n is the number of elements in the array.) (Points : 3)
log(n) times
once
n times
1,000 times

3. (TCO 6) Which of the following are two basic types of hashing? (Points : 3)
Linear probing and random probing
Searching and sorting
Open addressing and separate chaining
Dynamic and static

4. (TCO 6) In open addressing, data are stored in a(n) _____. (Points : 3)
class
queue
array
linked list

5. (TCO 6) The hash table ADT supports the operations of _____. (Points : 3)
insert, find minimum, and sort
delete minimum, find maximum, and search
insert, delete, and search
None of the above

6. (TCO 6) A scheme that can be used to look for an available entry in a hash table when there is a key collision is _____. (Points : 3)
linear search
sorted search
binary search
linear probing

7. (TCO 6) A _____ is a value that uniquely identifies an element in a collection. (Points : 3)
search key
node
number
link

8. (TCO 6) One of the main operations associated with the dictionary ADT is _____. (Points : 3)
given a value, remove the entry that contains the value
given a key, remove the entry that contains the key
remove the first item in the dictionary
return the hash value of a key