Test
11. Hashing Eficiency
Crea una cuenta gratis para terminar este test
Guarda tu progreso y consulta tu resultado final.
¿Ya tienes cuenta? Inicia sesión
Preguntas del test (15)
1What does the efficiency of a hash table search depend on?
- AHashing efficiency for a particular search depends on whether the search is successful or not
- Bnone of the above
2 Find min and max values (Range Query) ______ be done in a hash table.
- AA) cannot
- BB) can
- CC) generally cannot
- DD) generally can
3Which way is more efficient,linear or quadratic probing?
- AQuadratic
- Bnone of the above
4what is the first thing you do when deleteing something from the hash?
- AA,find it
- BB.check to make sure its not holding a key
- CC. A and B
- DD.none of the above
5to insert using open addressing, we need to find a closed location.
- AVerdadero
- BFalso
6name of the of the hashing disadvantages
- Afinding the item that has the smallest of largest search key.
- Bnone of the above
7As the load factor increases, what happens to the number of unsuccessful searches
in linear and quadratic probing?- AA) They decrease
- BB) They increase rapidly
- CC) They linearly
- DD) They stay the same
8Disadvantage of hash tables is that they are not a general purpose data structure for storage and retrieval.
- AVerdadero
- BFalso
9What are the two steps in inserting into a hash insert?
- AA. Hash the key, insert the item
- BB. Insert the item, hash the key
- CC. Hash the item, insert the key
- DD. Insert the key, remove the item
10What is a disadvantage of hash tables?
- AA) Not a general purpose storage/retrieval data structure
- BB) It is not stable
- CC) It is not efficient
- DD) All of the above
- EE) None of the above
11Which of the following is NOT a disadvantage of hash tables? (ie: which of the following are hash tables NOT bad at?)
- AA. traversing in sorterd order
- BB. finding the mininmum or maximum value in a search key
- CC. insertion is very inefficient
- DD. range query
12Which of the following are disadvantages of hash tables?
- AA. traversal in sorted order
- BB. finding the item that has the smallest or largest search key
- CC. range query
- DD. all of the above
13which of the following is a disadvantage of using a hash table?
- AA. Traversal in sorted order
- BB. Finding the item that has the smallest or largest search key
- CC. Range Query
- DD. All of the above
- EE. A and C
14Hashing efficiency for a particular search also depends on whether the search is successful.
Unsuccessful searches generally require more time than successful searches.- AVerdadero
- BFalso
15What is the efficency of insertion into a hash table?
- AO(1)!
- Bnone of the above
Información
- Descripción
- Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
- Autor
- Mena Sargios
- Idioma
- English
- Visitas
- 41
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test