Open In App
Related Articles

Data Structures | Hash | Question 2

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

How many different insertion sequences of the key values using the hash function h(k) = k mod 10 and linear probing will result in the hash table shown below? 

 

(A)

10

(B)

20

(C)

30

(D)

40



Answer: (C)

Explanation:

In a valid insertion sequence, the elements 42, 23 and 34 must appear before 52 and 33, and 46 must appear before 33. 

Total number of different sequences = 3! x 5 = 30 

In the above expression, 3! is for elements 42, 23 and 34 as they can appear in any order, and 5 is for element 46 as it can appear at 5 different places.



Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 05 Jan, 2020
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads