Quis 1

1. Daftar kunci primer berikut :

A. 24, 15, 26, 25, 36, 11, 13, 46, 54, 29
B. 25, 16, 27, 26, 37, 12, 14, 47, 55, 30
C. 26, 17, 28, 27, 38, 13, 15, 48, 56, 31
D. 27, 18, 29, 28, 39, 14, 16, 49, 57, 32
E. 28, 19, 30, 29, 40, 15, 17, 50, 58, 33
F. 29, 20, 31, 30, 41, 16, 18, 51, 59, 34
G. 30, 21, 32, 31, 42, 17, 19, 52, 60, 35
H. 31, 22, 33, 32, 43, 18, 20, 53, 61, 36
I. 32, 23, 34, 33, 44, 19, 21, 54, 62, 37
Akan ditransformasikan ke alamat index memori dengan fungsi Hash (K) = K
mod P dan fungsi Inc(K)=(K div P) mod P
Tentukan alamat setiap kunci dengan
a. metode hash Linear Quotient
b. algoritma Binary Tree Insertion dan jelaskan langkah serta pohon yg
terbentuk secara detail
2. Daftar kunci primer berikut :
A. 24, 15, 26, 25, 36, 11, 13, 43, 54, 52
B. 25, 16, 27, 26, 37, 12, 14, 44, 55, 53
C. 26, 17, 28, 27, 38, 13, 15, 45, 56, 54
D. 27, 18, 29, 28, 39, 14, 16, 46, 57, 55
E. 28, 19, 30, 29, 40, 15, 17, 47, 58, 56
F. 29, 20, 31, 30, 41, 16, 18, 48, 59, 57
G. 30, 21, 32, 31, 42, 17, 19, 49, 60, 58
H. 31, 22, 33, 32, 43, 18, 20, 50, 61, 59
I. 32, 23, 34, 33, 44, 19, 21, 51, 62, 60
Tentukan alamat tiap kunci dengan metode penempatan Computed
Chaining dengan fungsi Hash (K) = K mod P dan fungsi Inc(K)=(K div P) mod
P