7136582
Beschreibung
Quiz von Mena Sargios, aktualisiert more than 1 year ago
|
Erstellt von Mena Sargios
vor etwa 8 Jahre
|
|
Frage 1
Frage
What does the efficiency of a hash table search depend on?
Antworten
-
Hashing efficiency for a particular search depends on whether the search is successful or not
-
none of the above
Frage 2
Frage
Find min and max values (Range Query) ______ be done in a hash table.
Antworten
-
A) cannot
-
B) can
-
C) generally cannot
-
D) generally can
Frage 3
Frage
Which way is more efficient,linear or quadratic probing?
Antworten
-
Quadratic
-
none of the above
Frage 4
Frage
what is the first thing you do when deleteing something from the hash?
Antworten
-
A,find it
-
B.check to make sure its not holding a key
-
C. A and B
-
D.none of the above
Frage 5
Frage
to insert using open addressing, we need to find a closed location.
Antworten
- True
- False
Frage 6
Frage
name of the of the hashing disadvantages
Antworten
-
finding the item that has the smallest of largest search key.
-
none of the above
Frage 7
Frage
As the load factor increases, what happens to the number of unsuccessful searches
in linear and quadratic probing?
Antworten
-
A) They decrease
-
B) They increase rapidly
-
C) They linearly
-
D) They stay the same
Frage 8
Frage
Disadvantage of hash tables is that they are not a general purpose data structure for storage and retrieval.
Antworten
- True
- False
Frage 9
Frage
What are the two steps in inserting into a hash insert?
Antworten
-
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
Frage 10
Frage
What is a disadvantage of hash tables?
Antworten
-
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
Frage 11
Frage
Which of the following is NOT a disadvantage of hash tables? (ie: which of the following are hash tables NOT bad at?)
Antworten
-
A. traversing in sorterd order
-
B. finding the mininmum or maximum value in a search key
-
C. insertion is very inefficient
-
D. range query
Frage 12
Frage
Which of the following are disadvantages of hash tables?
Antworten
-
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
Frage 13
Frage
which of the following is a disadvantage of using a hash table?
Antworten
-
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
Frage 14
Frage
Hashing efficiency for a particular search also depends on whether the search is successful.
Unsuccessful searches generally require more time than successful searches.
Antworten
- True
- False
Frage 15
Frage
What is the efficency of insertion into a hash table?
Antworten
-
O(1)!
-
none of the above
Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.