What is the formula to find the expected number of probes for an unsuccessful search in linear probing?
A. $$\frac{1}{2}\,\,\frac{{1 + 1}}{{\left( {1 - \lambda } \right)}}$$
B. $$\frac{1}{2}\,\,\frac{{1 + 1}}{{{{\left( {1 - \lambda } \right)}^2}}}$$
C. $$\frac{1}{2}\,\,\frac{{1 + 1}}{{\left( {1 + \lambda } \right)}}$$
D. $$\frac{1}{2}\,\,\frac{{1 + 1}}{{\left( {1 + \lambda } \right)\left( {1 - \lambda } \right)}}$$
Answer: Option B
This Question Belongs to Data Structure >> Hashing
What is the primary purpose of hashing in data structures?
A. To provide constant time complexity for searches.
B. To sort elements in ascending order.
C. To balance binary search trees.
D. To implement priority queues.
In hashing, what is a "collision"?
A. When two elements are stored in the same slot.
B. When a hash table exceeds its capacity.
C. When a hash function fails to produce a unique index.
D. When two keys hash to the same index.
Which of the following is a common method to handle collisions in hashing?
A. Inorder traversal
B. Depth-first search
C. Linear probing
D. Binary search
What is a hash function primarily used for in hashing?
A. To balance a binary search tree.
B. To map data to a fixed-size value.
C. To find the maximum element in a set.
D. To balance a binary search tree.
Join The Discussion