Test
10. Hashing Collision
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 (16)
1Which probing applies a hash function until it finds an empty space or the key that is sought for?
- ALinear
- Bnone of the above
2What does separate chaining allow for in the case of collisions?
- AAllows the hash table to accommodate more than one item in the same location
- Bnone of the above
3Pick a correct example of Quadratic Probing increments:
- AA) 1, 2^2, 3^3, etc
- BB) 2^0, 2^1, 2^2, etc
- CC) 1^2, 2^2, 3^2, etc
- DD) 1^1, 2^2, 3^3, etc
4What are two ways to handle hashing collisions?
- A1.Move down one at a time till a free space is found.
2.Move down n^2 where n is how many times you have collided and moved. - Bnone of the above
- A1.Move down one at a time till a free space is found.
5what is a hash collision?
- AA,two distinct pieces of data have the same hash value
- BB.two distinct pieces of data have the different hash value
- CC.it hold 3 values at once
- DD.none of the above
6Separate Chaining allows the hash table to accommodate more than one item in the same location.
- AVerdadero
- BFalso
7Double Hasing uses two has functions what does each do?
- Aone specifies the first location, the other gives the step size.
- Bnone of the above
8Which type of probing searches the hash table at the beginning at the
original specified by the hash function and continuing at increments
of 1^2, 2^2, 3^2, ...?- AA) Linear Probing
- BB) Square Probing
- CC) Polynomial Probing
- DD) Quadratic Probing
9What does Separate Chaining do?
- AAllows the hash table to accommodate more than one item in the same location (each location is a linked list). This makes the hash table dynamic
- Bnone of the above
10What searches the hash table sequentially, starting from the original locatiom specified by the hash function?
- AA. Linear Probing
- BB. Bilinear Probing
- CC. Circular Probing
- DD. Alien Probing
11What is separate chaining?
- AA) Each location in a hash table is a linked list. Effectively, it's dynamic.
- BB) Making each has table a linked list
- CC) None of the above
12Which of the following is NOT a type of collision handling?
- AA. Separate chaining
- BB. Linear probing
- CC. Double Hashing
- DD. Trigonometic probing
13In separate chaining, what is the load factor?
- AA. the load factor is the average length of all the lists, including the lists with the length of zero
- BB. the load factor is the shortest length of all the lists, including the lists with the length of zero
- CC. the load factor is the longest length of all the lists, including the lists with the length of zero
- DD. the load factor is the average length of all the lists, excluding the lists with the length of zero
14When using separate chaining for collision handling in a hash table the load factor is the average length of all of the list.
- AVerdadero
- BFalso
15collision resolution schemes that probe for an empty, or open, location in the hash table
- AVerdadero
- BFalso
16What is the difference between separate chaining and open addressing?
- ASeparate chaining uses linked lists as each index of the has table, and pushes older entries back from the front when new entries are provided. Open adressing uses two types of probing (linear and quadratic) to find an open location within the hash table.
- 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
- 423
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test