Questão 1
Questão
What symbol is used to represent Load Factor and give the equation for determining Load Factor?
Questão 2
Questão
What is the hash function's (h(x)) functionality?
Questão 3
Questão
A good hash function places items ____ throughout the
the hash table.
Questão 4
Questão 5
Questão
what is not good thing for hash function to have?
Questão 6
Questão
a Hash table is an array that contains items, assigned by a hash function
Questão 7
Questão
what is Hash table?
Questão 8
Questão
How do you determine the load factor of a hash table?
Questão 9
Questão
Which of the following is not a requirement for a good hash function?
Responda
-
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
Questão 10
Questão
Which one is NOT a requirement for a good has function?
Responda
-
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
Questão 11
Questão
An array that contains items, assinged by a hash function is called
Responda
-
A. Hash function
-
B. Hash table
-
C. Hash Brown
-
D. None of the above
Questão 12
Questão
What is a hash table?
Responda
-
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.
Questão 13
Questão
Which of the following is NOT a good requirement for a hash function?
Questão 14
Questão
What are the requirements for a good hash function?
Responda
-
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
Questão 15
Questão
Which of the following is a requirement for a good hash function?
Questão 16
Questão
Which statement is NOT true?
Responda
-
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
Questão 17
Questão
What is the difference between a Perfect hash function and a Unifrom hash function?