問題詳情
8. A symbol table is implemented using a Hash Table of table size 11 with hash function h (k)=k mod 11, where k is the key of a record.
【題組】(22) The records with keys :13, 14, 2, 11, 18, 3, 36, 28 , 21 are inserted in sequential order into the hash using linear probing method for collision resolution. What is the total number of identifier comparisons if each key value is searched once.
(A) 14
(B)16
(C)18
(D)20
(E) None of the above
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增