☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch8 雜湊
第 18 題／共 37 題
◀
DS 18/37
錯題回報
00:00
18. Hash Table、Open Addressing
#DS-08-018
易
Hash Table
Open Addressing
📝
☆
Assume we have N keys stored in an open-addressing hash table with N slots, which of the following statements are true? (the hash function can be computed in O(1) time)
A
(A) Finding the largest key can be done in
O
(
N
)
O(N)
O
(
N
)
time in the worst-case
B
(B) Finding the successor key (the smallest key that is larger than a given key) in the table can be done in
O
(
N
lg
N
)
O(N\lg N)
O
(
N
l
g
N
)
time in the worst-case
C
(C) With proper selection of hash function, the worst-case search time can be
O
(
1
)
O(1)
O
(
1
)
D
(D) It is not possible to store N keys in an open-addressing hash table with N slots
E
(E) None of the above are true
📝 寫筆記
📄 交大111
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 資料結構》Ch8 雜湊
‹
本章題號 · 1–20 / 37
›
全部 37
易 27
中 9
難 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
