1 Using Closed Hashing Double Hashing Resolve Collisions Insert Following Keys Table 11 Sl Q37102638

1. Using closed hashing with double hashing to resolvecollisions insert the following keys into a table with 11 slots,numbered 0 through 10. The hash functions to be used areH1(k)k(mod11) and H2(k)- Rev(k + 1) (mod11) The function REVreverses the decimal digits like Rev(376) 673. Show the hash tableafter all nine keys have been inserted. Be sure to indicate how H1and H2 are used. Keys: 4, 3, 2, 8, 33, 17, 24, 35, 46


Answer


Kes: 3 2 r4G 2 3 7 35 8 2. 0 63 med) 3 S る5. (rt («s) +1,,. (4.Jfn= @ttJr. ,1 10 C.uam)

Kes:

OR
OR

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.