Q18
How is a hash table implemented in the case of open addressing?
A.
Using a linked list at each slot.
B.
Using multiple hash functions.
C.
Using a secondary hash table.
D.
Using probing techniques to find an open slot.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board