☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch8 雜湊
第 17 題／共 37 題
◀
DS 17/37
錯題回報
00:00
17. Hash Table、Collision Resolution
#DS-08-017
易
Hash Table
Collision Resolution
📝
☆
The hash function [h(key) = key mod m] is used to map any integer key to one of the slots, indexed 0, ..., m-1, of a hash table of m slots.
A
(A) If m is 7, there is just one occurrence of collision among these keys: 1, 2, 4, 6, 8, 12, 15.
B
(B) Consider using chaining to handle collisions. The table is initially empty. After inserting the keys 1, 2, 4, 6, 8, 12 into the table in the given order, key 12 is in the slot indexed 5.
C
(C) Consider using open dressing with linear probing to handle collisions. The table is initially empty. After we insert the keys 1, 2, 4, 6, 8, 12, 15 into the table in the given order, key 15 is in the slot indexed 0.
D
(D) Let using quadratic probing to handle collisions. The table is initially empty. After we insert the keys 1, 2, 4, 6, 8, 12, 15 into the table in the given order, key 12 is in the slot indexed 0.
📝 寫筆記
📄 交大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
