Match List I (Hashing Collision Handling Method) with List II (Strategy)
| List I | List II |
|---|---|
| A. Chaining | I. Check next slot |
| B. Linear Probing | II. Use the second hash function |
| C. Quadratic Probing | III. Linked list at index |
| D. Double Hashing | IV. Skip slots using quadratic step |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. A-III, B-I, C-IV, D-II
Explanation
Chaining keeps a linked list at each index (A-III). Linear probing checks the next slot (B-I). Quadratic probing skips slots using a quadratic step (C-IV). Double hashing uses a second hash function (D-II).More Data Structures and Algorithms questions
- Maintaining a graph in memory by means of its adjacency matrix is known as
- Match List I with List IIList I List II A. Circular Queue I. Print Queue B. Priority Queue II. CPU Scheduling C. Double Ended Queue III. Di…
- The tight asymptotic bound for the recurrence T(n) = 2T(n/4) + √n is
- When developing a dynamic programming algorithm, the sequence of steps followed is: A. Construct an optimal solution from computed informat…
- The correct sequence of constructing a Huffman tree is A. Repeat until root formed B. Create leaf nodes C. Build priority queue D. Combine…
- Choose the correct statement(s) A. A problem which is NP-Complete will have the property that it can be solved in polynomial time iff all o…