Register

MadeEasy Test Series: Programming & DS - Hashing

• edited by
647 views
0 votes
0 votes
Consider the following keys that are hashed into the hash table in the order given using the hash function H(i) = (3i+5)mod11.

12,44,13,88,23,94,11,39,20,16,5

where to handle the collision chaining is used, after inserting all the above keys in table if 2 new keys inserted into table, what is the probability new items hashed into empty slot?(upto 2 decimal places)
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Ram Swaroop asked Jan 27, 2019
1,305 views
MadeEasy Test Series 2019: Programming & DS - Hashing
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 is_ Answer 1.647
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...
User Avatar
0 votes
0 votes
1 answer
3
Anusha Motamarri asked Dec 6, 2016
558 views
MadeEasy Test Series: Programming & DS - Hashing
anybody give detailed explnation please
anybody give detailed explnation please
User Avatar
1 votes
1 votes
1 answer
4
Vishal Goyal asked Dec 6, 2016
693 views
MadeEasy Test Series: Programming & DS - Hashing
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of element...
User Avatar
Link Copied!