中科新闻网法国卢浮宫门票在哪里:【高手请进】跪求数据结构难题之二
来源：百度文库 编辑：中科新闻网 时间：2024/04/28 07:24:23
A hash table with hash function
H1(k)=k mod 13 is shown below.
0 1 2 3 4 5 6 7 8 9 10 11 12
26 38 17 33 48 35 25
Collision is resolved using the hash function H2(k)=(k mod 11)+1
(59)How many key comparisons occur in serching for key 35 in the given hash table?
A)0 B)1 C)2 D)3
(60)If a new key 67 is inserted into the given hash table,what will be its address?
A)3 B)4 C)5 D)6
H1(k)=k mod 13 is shown below.
0 1 2 3 4 5 6 7 8 9 10 11 12
26 38 17 33 48 35 25
Collision is resolved using the hash function H2(k)=(k mod 11)+1
(59)How many key comparisons occur in serching for key 35 in the given hash table?
A)0 B)1 C)2 D)3
(60)If a new key 67 is inserted into the given hash table,what will be its address?
A)3 B)4 C)5 D)6