Suppose we have an open addressing hash table (with linear probing to avoid collision) as given in the figure below, whe

[answerhappygod]

Suppose We Have An Open Addressing Hash Table With Linear Probing To Avoid Collision As Given In The Figure Below Whe 1 (42.29 KiB) Viewed 29 times

Suppose we have an open addressing hash table (with linear probing to avoid collision) as given in the figure below, where the hash function is h (K) = K mod 12. Fill in each answer with a single integer (e.g. 6) or a decimal number (e.g. 6.5) with NO spaces before or after. Note: checking a Null value/empty cell is not counted as a key comparion. a) The number of key comparisons required to find key K = 53 is b) If we insert key K = 68 and then key K 37 into the table, then the average number of key comparisons for a successful search will be After inserting keys 68 and 37, we remove key 80. The number of key. comparisons to find key 53 now is 0 1 2 3 4 5 6 7 8 9 10 11 25 27 29 42 65 80 53 30 c) Suppose we build a separate chaining hashing table instead for the sequence 25, 27, 29, 42, 80, 65, 53, 30 (in the given order). The maximum number of key comparisons required for an unsuccessful search is