1. What is a hash table?

2. How many different insertion sequences of the key values using the same hash function and linear probing will result in the hash table shown above?

3. If ' h ' is a hashing function and it is used to hash ' n ' keys into a table of size ' m ' where n <= m . What is the expected number of collisions involving a particular key ' x ' ?

4. Hashing technique which allocates fixed number of buckets is classified as

5. If several elements are competing for the same bucket in the hash table, what is it called?

6. Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.

7. What is the advantage of using a dynamic set in direct addressing?

8. In linear hashing, formula used to calculate number of records if blocking factor, loading factor and file buckets are known is as

9. What is the load factor?

10. Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is __________

11. What is direct addressing?

12. What is the search complexity in direct addressing?

13. What is a hash function?

14. What can be the techniques to avoid collision?

15. What is simple uniform hashing?

16. In simple uniform hashing, what is the search complexity?

17. In simple chaining, what data structure is appropriate?

18. Which of these are core interfaces in the collection framework. Select the one correct answer.

19.

Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are true?

i. 9679, 1989, 4199 hash to the same value
ii. 1471, 6171 hash to the same value
iii. All elements hash to the same value
iv. Each element hashes to a different value