Consider the hash table that results after the letters ALGORITHMIC have been ins

Question

Consider the hash table that results after the letters ALGORITHMIC have been inserted, in that order, into an initially empty table with 13 slots using quadratic probing. (Assume we're implementing a multi-set, so duplicate entries are permitted.) For your hash function, use h(k) = k % 13 where k is assigned as follows: A: 1 B: 2 C: 3 D: 4 E: 5 F: 6 G: 7 H 8 I: 9 J: 10 K: 11 L: 12 M: 13 N: 14 O: 15 P: 16 Q: 17 R: 18 S: 19 T: 20 U: 21 V: 22 W: 23 X: 24 Y: 25 Z: 26 What letter will be in position 4 of the array used to store the table? A L G O R I T H M C That slot is empty

Explanation / Answer

Answer : That slot is empty

Hash table with positions:

M     -> 0
A     -> 1
O     -> 2
C     -> 3
NULL    -> 4
R   -> 5
NULL   -> 6
G   -> 7
T   -> 8
I   -> 9
H   -> 10
I   -> 11
L   -> 12

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.