7136252
Description
Quiz by Mena Sargios, updated more than 1 year ago
|
Created by Mena Sargios
over 7 years ago
|
|
Question 1
Question
What symbol is used to represent Load Factor and give the equation for determining Load Factor?
Answer
-
Alpha, (current number of hash items) / (table size)
-
none of the above
Question 2
Question
What is the hash function's (h(x)) functionality?
Answer
-
Maps the search key of an item to a location
-
none of the above
Question 3
Question
A good hash function places items ____ throughout the
the hash table.
Answer
-
A) every other level
-
B) at every odd position
-
C) evenly
-
D) The hash function does not place items on the table.
Question 4
Question
What is hashing?
Answer
-
The use of a hash table to determine whether variables have been stored/accesed and allows for quicker searching.
-
none of the above
Question 5
Question
what is not good thing for hash function to have?
Answer
-
A.places items evenly throughtout the hash table
-
B.use a prime base
-
C,has no search key
-
D.none of the above
Question 6
Question
a Hash table is an array that contains items, assigned by a hash function
Answer
- True
- False
Question 7
Question
what is Hash table?
Answer
-
An array that contains items, assigned by a hash function.
-
none of the above
Question 8
Question
How do you determine the load factor of a hash table?
Answer
-
(current number of hash items)/(table size)
-
none of the above
Question 9
Question
Which of the following is not a requirement for a good hash function?
Answer
-
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
Question 10
Question
Which one is NOT a requirement for a good has function?
Answer
-
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
Question 11
Question
An array that contains items, assinged by a hash function is called
Answer
-
A. Hash function
-
B. Hash table
-
C. Hash Brown
-
D. None of the above
Question 12
Question
What is a hash table?
Answer
-
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.
Question 13
Question
Which of the following is NOT a good requirement for a hash function?
Answer
-
A. Fast and easy to compute
-
B. O(nlogn) lookup time
-
C. places items evenly
-
D. involves the entire search key
Question 14
Question
What are the requirements for a good hash function?
Answer
-
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
Question 15
Question
Which of the following is a requirement for a good hash function?
Answer
-
A.Fast to compute
-
B.Places items randomly throughout the hash table
-
C.Involves parts of the search key
-
D.All of the above
Question 16
Question
Which statement is NOT true?
Answer
-
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
Question 17
Question
What is the difference between a Perfect hash function and a Unifrom hash function?
Answer
-
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
Want to create your own Quizzes for free with GoConqr? Learn more.