What does the efficiency of a hash table search depend on?
Hashing efficiency for a particular search depends on whether the search is successful or not
none of the above
Find min and max values (Range Query) ______ be done in a hash table.
A) cannot
B) can
C) generally cannot
D) generally can
Which way is more efficient,linear or quadratic probing?
Quadratic
what is the first thing you do when deleteing something from the hash?
A,find it
B.check to make sure its not holding a key
C. A and B
D.none of the above
to insert using open addressing, we need to find a closed location.
name of the of the hashing disadvantages
finding the item that has the smallest of largest search key.
As the load factor increases, what happens to the number of unsuccessful searches in linear and quadratic probing?
A) They decrease
B) They increase rapidly
C) They linearly
D) They stay the same
Disadvantage of hash tables is that they are not a general purpose data structure for storage and retrieval.
What are the two steps in inserting into a hash insert?
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
What is a disadvantage of hash tables?
A) Not a general purpose storage/retrieval data structure
B) It is not stable
C) It is not efficient
D) All of the above
E) None of the above
Which of the following is NOT a disadvantage of hash tables? (ie: which of the following are hash tables NOT bad at?)
A. traversing in sorterd order
B. finding the mininmum or maximum value in a search key
C. insertion is very inefficient
D. range query
Which of the following are disadvantages of hash tables?
A. traversal in sorted order
B. finding the item that has the smallest or largest search key
C. range query
D. all of the above
which of the following is a disadvantage of using a hash table?
A. Traversal in sorted order
B. Finding the item that has the smallest or largest search key
C. Range Query
D. All of the above
E. A and C
Hashing efficiency for a particular search also depends on whether the search is successful. Unsuccessful searches generally require more time than successful searches.
What is the efficency of insertion into a hash table?
O(1)!
