Question: A hash table T has 13 memory locations and the collection C consists of 6 records with keys K = {529,436, 129, 320,615, 259). Compute

A hash table T has 13 memory locations and the collection C consists of 6 records with keys K = {529,436, 129, 320,615, 259). Compute load factor and then construct a hash table by inserting the above records in the given order using a) linear probing algorithm. b) Quadratic probing algorithm The hash function H(k) = (sum of the three digits in hash key) modulo 13. Also calculate the average number of probes S, S4, U and U, for successful and unsuccessful searches in each case and comment on the outcomes
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
