recategorized by
943 views
1 votes
1 votes
The keys 44, 63, 29, 78, 23, 6, 81, 14, 13, 12 and 52 are inserted into an initially empty hash table of length 12 using linear probing with hash function h(k)= k mod 12. What is the probability that the 10th slot will be filled next?

i. 11/12

ii. 1/12

iii. 10/12

iv. 1

The answer given is i but according to me it should be iv because after we insert all the given numbers in the hash table only one slot  is left which have a probability of filling as 1 because no matter what index we get for the next insert we are going to fill 10th slot only.
recategorized by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Magma asked Dec 27, 2018
519 views
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
0 votes
0 votes
1 answer
2
Ram Swaroop asked Jan 27, 2019
1,334 views
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search...
0 votes
0 votes
0 answers
3
Jyoti Kumari97 asked Nov 25, 2018
590 views
What is the number of collisions while doing insert operation on the hash table? Options are 3456Answer is 4Can anyone tell me how? ​​