Register

hashing

1,560 views
0 votes
0 votes

given keys:

224562,137456,214562

140145,214576,162145

144467,199645,234534

Using the digit-extraction method (first, third and fifth digits) and quadratic probing, stores the keys shown above in an array with 19 elements. What is the indexes of bin into which all the  records are inserted?

hint : digit extraction(1,3,5) for 224562->246 mod 19 = 18 and soon.

User Avatar

1 Answer

0 votes
0 votes

Indexes of bin in order of given keys : -

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

Related questions

1 votes
1 votes
1 answer
1
Kaluti asked Nov 9, 2017
542 views
data structure
In a hash table of size 6, currently the locations 0, 2, 4 and 5 are occupied. The probability of a new record going into location 1, with a hash function resolving collisions by linear probing is (assume uniform hashing). (A) 2/3 (B) 1/3 (C) 1 (D) 1/6
In a hash table of size 6, currently the locations 0, 2, 4 and 5 are occupied. The probability of a new record going into location 1, with a hash function resolving colli...
User Avatar
0 votes
0 votes
0 answers
2
rsansiya111 asked Mar 12, 2022
373 views
NPTEL Assignment of Hashing Techniques
Canadian postal codes have the format LDL DLD, where L is always a letter (between A-Z), D is always a digit (0-9), and is always a single space. For example, the postal code for the University of Waterloo is N2L 3G1. Devise a suitable hash function for this system.
Canadian postal codes have the format LDL DLD, where L is always a letter (between A-Z), D is always a digit (0-9), and is always a single space. For example, the postal ...
User Avatar
0 votes
0 votes
1 answer
4
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
Link Copied!