Which of the following best describes searching in a linear probing hash table?

Question

Which of the following best describes searching in a linear probing hash table? calculate index (i) based on hash code of the key if the element is on index i it is found otherwise it is not in the hash table calculate index (i) based on hash code of the key if the element is on index i it is found otherwise check the next index until the element is found or an empty index is reached calculate index (i) based on hash code of the key if the element is on index i it is found otherwise check the elements in the linked list until the key is found or the end of the list is reached (in that case the key is not in the hash table) Caveat: The letters might not be listed in order B C A

Explanation / Answer

The answer is B , calculate index(i) based on hash code of the key if element is on index(i) it is found otherwise check the next index until element is found or an empty index is reached. As when the hash element is empty this means search is failed else we need to locate a match between seach and data key and when the match is not found we need to look until either we find one or we get completly empty hash element.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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