Given the list of tasks in Col-A and list of data structure in Col-B. Identify…
2018
Given the list of tasks in Col-A and list of data structure in Col-B. Identify the best match.
- A.
A-(i), B-(iii), C-(ii)
- B.
A-(ii), B-(i), C-(iii)
- C.
A-(iii), B-(ii), C-(i)
- D.
A-(ii), B-(iii), C-(i)
Attempted by 757 students.
Show answer & explanation
Correct answer: D
Answer: Recursion → Stack, Scheduling → Queue, Sorting → Binary tree (binary search tree)
Recursion uses the call stack to store return addresses and local variables for active function calls. Each recursive call pushes state on the stack and pops it on return, so stack is the correct data structure for recursion.
Scheduling in operating systems uses queues (for example, the ready queue). Many scheduling algorithms, such as First-Come-First-Served (FCFS), naturally use queue behavior to manage processes.
Sorting can be implemented using a binary search tree (tree sort): insert elements into a BST and then perform an in-order traversal to obtain sorted order. Note that other structures like binary heaps are also used for specific sorting algorithms (heap sort).
Therefore the correct matching maps recursion to a stack, scheduling to a queue, and sorting to a binary tree (binary search tree).