Questão 1
Questão
What does the efficiency of a hash table search depend on?
Questão 2
Questão
Find min and max values (Range Query) ______ be done in a hash table.
Responda
-
A) cannot
-
B) can
-
C) generally cannot
-
D) generally can
Questão 3
Questão
Which way is more efficient,linear or quadratic probing?
Responda
-
Quadratic
-
none of the above
Questão 4
Questão
what is the first thing you do when deleteing something from the hash?
Questão 5
Questão
to insert using open addressing, we need to find a closed location.
Questão 6
Questão
name of the of the hashing disadvantages
Questão 7
Questão
As the load factor increases, what happens to the number of unsuccessful searches
in linear and quadratic probing?
Responda
-
A) They decrease
-
B) They increase rapidly
-
C) They linearly
-
D) They stay the same
Questão 8
Questão
Disadvantage of hash tables is that they are not a general purpose data structure for storage and retrieval.
Questão 9
Questão
What are the two steps in inserting into a hash insert?
Responda
-
A. Hash the key, insert the item
-
B. Insert the item, hash the key
-
C. Hash the item, insert the key
-
D. Insert the key, remove the item
Questão 10
Questão
What is a disadvantage of hash tables?
Questão 11
Questão
Which of the following is NOT a disadvantage of hash tables? (ie: which of the following are hash tables NOT bad at?)
Responda
-
A. traversing in sorterd order
-
B. finding the mininmum or maximum value in a search key
-
C. insertion is very inefficient
-
D. range query
Questão 12
Questão
Which of the following are disadvantages of hash tables?
Questão 13
Questão
which of the following is a disadvantage of using a hash table?
Questão 14
Questão
Hashing efficiency for a particular search also depends on whether the search is successful.
Unsuccessful searches generally require more time than successful searches.
Questão 15
Questão
What is the efficency of insertion into a hash table?