Question:
Match the items in Column 1 with the items in Column 2 in the following table :Column 1 Column 2 (p) First In First Out (i) Stacks (q) Lookup Operation (ii) Queues (r) Last In First Out (iii) Hash Tables
Match the items in Column 1 with the items in Column 2 in the following table :
| Column 1 | Column 2 | ||
| (p) | First In First Out | (i) | Stacks |
| (q) | Lookup Operation | (ii) | Queues |
| (r) | Last In First Out | (iii) | Hash Tables |
Updated On: Jan 30, 2026
- (p) - (ii), (q) - (iii), (r) - (i)
- (p) - (ii), (q) - (i), (r) - (iii)
- (p) - (i), (q) - (ii), (r) - (iii)
- (p) - (i), (q) - (iii), (r) - (ii)
Hide Solution
Verified By Collegedunia
The Correct Option is A
Solution and Explanation
The correct option is (A) : (p) - (ii), (q) - (iii), (r) - (i).
Was this answer helpful?
0
0
Top Questions on Hashing
- Consider performing uniform hashing on an open address hash table with load factor \(α = \frac{n}{m}< 1\), where n elements are stored in the table with m slots. The n m expected number of probes in an unsuccessful search is at most \(\frac{1}{1-\alpha}\)
Inserting an element in this hash table requires at most ______ probes, on average. - If on applying a hash function, every items of a list maps to unique index in the hash table it is called.
- Match the following:
List I List II 1 FIFO a Stack 2 Look up op. b Queue 3 Last-In first out c Hash table
Questions Asked in GATE DA exam
- Which of the following statements is/are correct?
- GATE DA - 2025
- Linear Algebra
- Choose the most appropriate word to complete the analogy:
Courage : Bravery :: Yearning :- GATE DA - 2025
- Analogies
- When does the worst case of binary search occur?
- GATE DA - 2025
- Algorithm
- Suppose that insertion sort is applied to the array \([1,2,3,5,7,9,11,x,15,13]\) and it takes exactly 2 swaps to sort the array. Select all possible values of \( x \).
- GATE DA - 2025
- Algorithm
- Given the lists: \[ A = [1,2,3], \quad B = [4,5,6] \] Which of the following statements will result in \[ A = [1,2,3,4,5,6]? \]
- GATE DA - 2025
- Programming in Python
View More Questions