Hashing Function in Data Structure

@T-Bone

This question paper focuses on the "Hashing Function" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

This question paper focuses on the "Hashing Function" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

Questions

1. What is a hash table?

Mark the correct option

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?

Mark the correct option

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 ' ?

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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.

Mark the correct option

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

Mark the correct option

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

Mark the correct option

9. What is the load factor?

Mark the correct option

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

Mark the correct option

11. What is direct addressing?

Mark the correct option

12. What is the search complexity in direct addressing?

Mark the correct option

13. What is a hash function?

Mark the correct option

14. What can be the techniques to avoid collision?

Mark the correct option

15. What is simple uniform hashing?

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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?

Mark the correct option

Index of Questions