What symbol is used to represent Load Factor and give the equation for determining Load Factor?
Alpha, (current number of hash items) / (table size)
none of the above
What is the hash function's (h(x)) functionality?
Maps the search key of an item to a location
A good hash function places items ____ throughout the the hash table.
A) every other level
B) at every odd position
C) evenly
D) The hash function does not place items on the table.
What is hashing?
The use of a hash table to determine whether variables have been stored/accesed and allows for quicker searching.
what is not good thing for hash function to have?
A.places items evenly throughtout the hash table
B.use a prime base
C,has no search key
D.none of the above
a Hash table is an array that contains items, assigned by a hash function
what is Hash table?
An array that contains items, assigned by a hash function.
How do you determine the load factor of a hash table?
(current number of hash items)/(table size)
Which of the following is not a requirement for a good hash function?
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
Which one is NOT a requirement for a good has function?
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
An array that contains items, assinged by a hash function is called
A. Hash function
B. Hash table
C. Hash Brown
D. None of the above
What is a hash table?
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.
Which of the following is NOT a good requirement for a hash function?
A. Fast and easy to compute
B. O(nlogn) lookup time
C. places items evenly
D. involves the entire search key
What are the requirements for a good hash function?
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
Which of the following is a requirement for a good hash function?
A.Fast to compute
B.Places items randomly throughout the hash table
C.Involves parts of the search key
D.All of the above
Which statement is NOT true?
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
What is the difference between a Perfect hash function and a Unifrom hash function?
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.
