(Hash Tables)
Q1) Assume you have a hash table composed of 11 slots, using linear probing, show how the table will
look like after the following operations:
(Note: h(key)=key %11.)
(a) (b)
1. Insert an object with key (26).
2. Insert an object with key (15).
3. Insert an object with key (38).
4. Delete an object with key(15).
5. Insert an object with key(4).
1. Insert an object with key (21).
2. Insert an object with key (10).
3. Insert an object with key (32).
4. Delete an object with key(10).
5. Insert an object with key(12).
0
1
2
3
4
5
6
7
8
9
10
0
1
2
3
4
5
6
7
8
9
10
Q2) Assume you have a hash table composed of 11 slots, using quadratic probing, show how the table
will look like after the following operations:
(Note: h(key)=key %11.)
(a) (b)
1. Insert an object with key (26).
2. Insert an object with key (15).
3. Insert an object with key (4).
4. insert an object with key(37).
5. Insert an object with key(48).
1. Insert an object with key (21).
2. Insert an object with key (10).
3. Insert an object with key (32).
4. Insert an object with key(43).
5. Insert an object with key(12).
0
1
2
3
4
5
6
7
8
9
10
0
1
2
3
4
5
6
7
8
9
10
3
