Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

M

Mr. Dubey

🎓 Coach ⭐ 104.60K Points

📊 Database Management System (DBMS)

Q. Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

(A) all keys hash to same index
(B) all keys hash to diﬀerent indices
(C) all keys hash to an even-numbered index
(D) all keys hash to diﬀerent even-numbered indices

💬 Discuss

✅ Correct Answer: (A) all keys hash to same index

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

938

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

82%

Success Rate