Question:medium
Match List-I with List-II.
List-I List-II A. Breadth First Search I. Shortest paths B. Sparse Graph II. Adjacency list representation C. Collision Resolution III. Open addressing D. Linked list IV. Self referential structures
Choose the correct answer from the options given below:
Match List-I with List-II.
| List-I | List-II |
|---|---|
| A. Breadth First Search | I. Shortest paths |
| B. Sparse Graph | II. Adjacency list representation |
| C. Collision Resolution | III. Open addressing |
| D. Linked list | IV. Self referential structures |
Choose the correct answer from the options given below:
Show Hint
BFS → shortest path, Sparse → adjacency list, Hashing → open addressing, Linked list → self-referential.
Updated On: Jun 5, 2026
- A-I, B-II, C-III, D-IV
- A-I, B-III, C-IV, D-II
- A-II, B-I, C-III, D-IV
- A-IV, B-II, C-I, D-III
Show Solution
The Correct Option is A
Solution and Explanation
Was this answer helpful?
0
Top Questions on Searching, Sorting and Hashing
- The pseudocode of a function \( fun() \) is given below:
fun(int A[0, ..., n-1]) { for i = 0 to n-2 for j = 0 to n - i - 2 if (A[j] > A[j+1]) then swap A[j] and A[j+1] }Let \( A[0, \ldots, 29] \) be an array storing 30 distinct integers in descending order. The number of swap operations that will be performed, if the function \( fun() \) is called with \( A[0, \ldots, 29] \) as argument, is __________ (Answer in integer).- GATE CS - 2025
- Programming and Data Structures
- Searching, Sorting and Hashing
- The state graph shows the action cost along the edges and the heuristic function \( h \) associated with each state. Suppose the A algorithm is applied on this state graph using a priority queue to store the frontier. In what sequence are the nodes expanded?
- GATE DA - 2025
- Programming and Data Structures
- Searching, Sorting and Hashing
Consider game trees Tree-1 and Tree-2 as shown. The first level is a MAX agent and the second level is a MIN agent. The value in the square node is the output of the utility function.
For what ranges of \( x \) and \( y \), the right child of node B and the right child of node E will be pruned by the alpha-beta pruning algorithm?- GATE DA - 2025
- Programming and Data Structures
- Searching, Sorting and Hashing
- Suppose that insertion sort is applied to the array \( [1, 3, 5, 7, 9, 11, x, 15, 13] \) and it takes exactly two swaps to sort the array. Select all possible values of \( x \).
- GATE DA - 2025
- Programming and Data Structures
- Searching, Sorting and Hashing
- Want to practice more? Try solving extra ecology questions todayView All Questions