Question 13 pts

(TCO 5) _____ is not a search technique.

Hash table

Sequential search

Binary search

Sorted search

Flag this Question

Question 23 pts

(TCO 5) Why can't a binary search be applied on the list below? 17, 22, 31, 19, 39, 43, 16

The list is too small.

The list is not sorted.

The size of the list is not a power of 2.

A binary search can be applied on the list as it appears.

Flag this Question

Question 33 pts

(TCO 5) There are two basic types of hashing, _____.

linear probing and random probing

searching and sorting

open addressing and separate chaining

dynamic and static

Flag this Question

Question 43 pts

(TCO 5) _____ is not an operation of the hash table data structure.

insert

delete

find the maximum

search

Flag this Question

Question 53 pts

(TCO 5) The hash function returns _____.

a location in a matrix

a location in the hash table

the size of the hash table

the number of elements in the hash table

Flag this Question

Question 63 pts

(TCO 5) In hashing, when two keys produce the same value of the hash function, we say that we have a key _____.

identification

assignment

collision

comparison

Flag this Question

Question 73 pts

(TCO 5) Searching for an element based on using a unique key is _____.

slower

faster and more convenient

unusual

inefficient

Flag this Question

Question 83 pts

(TCO 5) One of the main operations associated with the Dictionary ADT is _____.

insert a value as the first item in the dictionary

given a value, insert or add a new entry to the dictionary

given a key and a value, insert or add a new entry to the dictionary

return the hash value of a key

Flag this Question

Question 93 pts

(TCO 5) Given the following dataset stored in an array, which searching method would be recommended? Assume that only one search is to be conducted. 1 6 10 8 14 9

Sequential search on an unsorted array

Sequential search on a sorted array

Binary search on an unsorted array

Binary search on a sorted array

Flag this Question

Question 103 pts

(TCO 8) In C++ STL, use the function _____ to determine if a given value exists in an unordered sequence.

find

binary_search

contain

sort