ISRO | CS ISRO 2015 | Pregunta 14

En la siguiente figura se muestra una tabla hash con diez cubos con una ranura por cubo. Los símbolos S1 a S7 ingresados ​​inicialmente usando una función hash con sondeo lineal. El número máximo de comparaciones necesarias para buscar un elemento que no está presente es

(A) 4
(B) 5
(C) 6
(D) 3

Answer: (B)
Explanation:

We have to consider different cases to find the maximum number
 of comparisons needed in searching an item that is not present.
If searching starts at 0 index : 3 comparisons will be made at
 index 0, index 1 and finally at index 2 and terminate searching 
when index 2 found empty.
Similarly after checking on different indexes, the maximum number
of comparisons will be required if searching starts from index 8,
as in this case, total 5 comparisons will be made at index 8, 9, 0, 1 and 2.
So, correct option is (B).

Cuestionario de esta pregunta