19. Consider an empty hash table with 10 buckets and each bucket has 2 slots. Suppose that linear probing is used to handle overflow and the following is used as the hash function: h(n) =n % 10.
Now we sequentially insert the following numbers into the hash table:
5 15 23 44 3 53 6 4 109 What is the summation of the numbers in the full buckets of the hash table?
(A) 153
(B) 150
(C) 262
(D) 43
(E) none of the above
詳解 (共 1 筆)
未解鎖
1. 題目解析 本題涉及一個哈希表（ha...
阿摩線上測驗
登入
