7136252
Descripción
Test por Mena Sargios, actualizado hace más de 1 año
|
Creado por Mena Sargios
hace alrededor de 8 años
|
|
Pregunta 1
Pregunta
What symbol is used to represent Load Factor and give the equation for determining Load Factor?
Respuesta
-
Alpha, (current number of hash items) / (table size)
-
none of the above
Pregunta 2
Pregunta
What is the hash function's (h(x)) functionality?
Respuesta
-
Maps the search key of an item to a location
-
none of the above
Pregunta 3
Pregunta
A good hash function places items ____ throughout the
the hash table.
Respuesta
-
A) every other level
-
B) at every odd position
-
C) evenly
-
D) The hash function does not place items on the table.
Pregunta 4
Pregunta
What is hashing?
Respuesta
-
The use of a hash table to determine whether variables have been stored/accesed and allows for quicker searching.
-
none of the above
Pregunta 5
Pregunta
what is not good thing for hash function to have?
Respuesta
-
A.places items evenly throughtout the hash table
-
B.use a prime base
-
C,has no search key
-
D.none of the above
Pregunta 6
Pregunta
a Hash table is an array that contains items, assigned by a hash function
Respuesta
- True
- False
Pregunta 7
Pregunta
what is Hash table?
Respuesta
-
An array that contains items, assigned by a hash function.
-
none of the above
Pregunta 8
Pregunta
How do you determine the load factor of a hash table?
Respuesta
-
(current number of hash items)/(table size)
-
none of the above
Pregunta 9
Pregunta
Which of the following is not a requirement for a good hash function?
Respuesta
-
A) Fast (and easy) to compute
-
B) Places items evenly throughout the hash table
-
C) Involves the entire search key
-
D) Uses a non-prime base, if it uses modulo arithmetic
Pregunta 10
Pregunta
Which one is NOT a requirement for a good has function?
Respuesta
-
a. Fast and easy to compute
-
b. Involves entire search key
-
c. Use a prime base if it uses any arithmetic
-
d. Items placed evenly throughout the hash table
Pregunta 11
Pregunta
An array that contains items, assinged by a hash function is called
Respuesta
-
A. Hash function
-
B. Hash table
-
C. Hash Brown
-
D. None of the above
Pregunta 12
Pregunta
What is a hash table?
Respuesta
-
A) An array that contains items, assigned by a hash function.
-
B) A perfectly cooked pile of potatoes
-
C) A table of hash signs (#)
-
D) None of the above.
Pregunta 13
Pregunta
Which of the following is NOT a good requirement for a hash function?
Respuesta
-
A. Fast and easy to compute
-
B. O(nlogn) lookup time
-
C. places items evenly
-
D. involves the entire search key
Pregunta 14
Pregunta
What are the requirements for a good hash function?
Respuesta
-
A. fast and easy to compute
-
B. places items evenly throughout the hash table
-
C. involves the entire search key and uses a prime base, if it uses modular arithmetic
-
D. All of the above
Pregunta 15
Pregunta
Which of the following is a requirement for a good hash function?
Respuesta
-
A.Fast to compute
-
B.Places items randomly throughout the hash table
-
C.Involves parts of the search key
-
D.All of the above
Pregunta 16
Pregunta
Which statement is NOT true?
Respuesta
-
a. hash table : an array that contains items, assigned by a hash function
-
b. perfect hash function : maps each search key to a unique location
-
c. collision : occurs when the hash function maps 2+ items to the same location
-
d. collision : occurs when the hash function maps not 2+ items to the same location
Pregunta 17
Pregunta
What is the difference between a Perfect hash function and a Unifrom hash function?
Respuesta
-
A Perfect hash function maps each key to a unique location. While a Uniform hash function is equally likely to map a key to any index in the table.
-
none of the above
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.