Explore BrainMass
Share

Hush table

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

See attached file for full problem description. - Advanced Associative Structures

Please provide a complete program if it makes sense.
Exercise 12.13

Assume that a hash function has the following characteristics:

Keys 257 and 567 hash to 3.
Keys 987 and 313 hash to 6.
Keys 734, 189, and 575 hash to 5.
Keys 122, 391 hash to 8.

Assume that we perform insertions in the order 257, 987, 122, 575, 189, 734, 567, 313, 391.
(a) Indicate the position of the data if we use linear probe addressing to resolve collisions.

(b) Indicate the position of the data if we use chaining with separate lists to resolve collisions.

© BrainMass Inc. brainmass.com March 21, 2019, 2:52 pm ad1c9bdddf
https://brainmass.com/computer-science/cpp/data-structures-with-c-using-stl-135210

Attachments

Solution Preview

Please see the attached file.

Exercise 12.13

Assume that a hash function has the following characteristics:

Keys 257 and 567 hash to 3.
Keys 987 and 313 hash to 6.
Keys 734, 189, and 575 hash to 5.
Keys 122, 391 hash to 8.

Assume that we ...

Solution Summary

In the given hush function, the postions of data are found using two different methods to solve collision.

$2.19