Register

MadeEasy Test Series: Programming & DS - Hashing

• recategorized by
397 views

1 Answer

Best answer
5 votes
5 votes

Sequence of records(k) = 43, 63, 84, 11, 5, 72, 15 16.

Hash function ,      h(k) = k mod 12.

Linear probing is used in case of a collision.

Hash table-  

Index 0 1 2 3 4 5 6 7 8 9 10 11
                         
keys 84 72   63 15 5 16 43       11

So, Index of the last element(16) inserted = 6.

• selected by
User Avatar
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,308 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!