Hash-based structures
1. What is a hash table?
A.  A structure that maps values to keys B.  A structure that maps keys to values C.  A structure used for storage D.  A structure used to implement stack and queue
2. If several elements are competing for the same bucket in the hash table, what is it called?
A.  Diffusion B.  Replication C.  Collision D.  None of the mentioned
3. What is a hash function?
A.  A function has allocated memory to keys B.  A function that computes the location of the key in the array C.  A function that creates an array D.  None of the mentioned
4. What can be the techniques to avoid collision?
A.  Make the hash function appear random B.  Use the chaining method C.  Use uniform hashing D.  All of the mentioned
5. What is the load factor?
A.  Average array size B.  Average key size C.  Average chain length D.  None of the mentioned
6. What is simple uniform hashing?
A.  Every element has equal probability of hashing into any of the slots B.  A weighted probabilistic method is used to hash elements into the slots C.  All of the mentioned D.  None of the mentioned
7. In simple uniform hashing, what is the search complexity?
A.  O(n) B.  O(logn) C.  O(nlogn) D.  O(1)