Can anyone tell me more about this...I read the lecture note...but totally no idea what's going on to this.....Hasing table and the closed hashing.....
this is one of the question::::
(a) using the hash function H(key) = (key -5000)%9, insert these values to simulate the behaviour of a closed hash table. Draw a diagram of the hash table after all values have been inserted in the given order(use liner probing to reslove collisions)
(b) determine the average number of probes to find a value that is in the table from (a)
(c)determine the average number of probes to establish that a value is not in the table from part(a)
(d)Calculate the load factor of the table.
(e)Explain how 5821 maybe delete from the table
I got no idea about this question..can anyone help..thank very much