☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch8 雜湊
第 33 題／共 37 題
◀
DS 33/37
錯題回報
00:00
33. Hash Function
#DS-08-033
易
Hash Function
📝
☆
Which of the following statements about hashing algorithms are incorrect?
A
A good hash function should distribute the keys uniformly into the slots of the table.
B
The load factor of a hash table is the average number of keys per slot.
C
Assume all keys are integers, and define
h
(
k
)
=
k
m
o
d
m
h(k) = k \bmod m
h
(
k
)
=
k
mod
m
. If
m
m
m
has a divisor
d
d
d
, a preponderance of keys that are congruent modulo
d
d
d
can favorably affect uniformity.
D
If open addressing is used for resolving collisions, the probe sequence
h
(
k
,
0
)
,
h
(
k
,
1
)
,
⋯
,
h
(
k
,
m
−
1
)
h(k, 0), h(k, 1), \cdots, h(k, m-1)
h
(
k
,
0
)
,
h
(
k
,
1
)
,
⋯
,
h
(
k
,
m
−
1
)
should be a permutation of
{
1
,
2
,
⋯
,
m
}
\{1,2,\cdots,m\}
{
1
,
2
,
⋯
,
m
}
.
E
Theoretically speaking, there is no perfect hashing.
📝 寫筆記
📄 中央114
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 資料結構》Ch8 雜湊
‹
本章題號 · 21–37 / 37
›
全部 37
易 27
中 9
難 1
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
