Q40

MCQ2 marks, −0.67

Consider a hash table with $9$ slots. The hash function is $h(k)= k \mod 9$ . The collisions are resolved by chaining. The following $9$ keys are inserted in the order: $5, 28, 19, 15, 20, 33, 12, 17, 10$ . The maximum, minimum, and average chain lengths in the hash table, respectively, are

(A)

$3, 0,$ and $1$

(B)

$3, 3,$ and $3$

(C)

$4, 0,$ and $1$

(D)

$3, 0,$ and $2$

Loading…