UTpaper

Free mock tests & test series

Question 40

Given the list of tasks in Col-A and list of data structure in Col-B. Identify the best match.

Given the list of tasks in Col-A and list of data structure in Col-B. Identify the best match. Col-A | Col-B A. Recursion | (i) Binary tree B. Scheduling | (ii) Stack C. Sorting | (iii) Queue
  1. AA-(i), B-(iii), C-(ii)
  2. BA-(ii), B-(i), C-(iii)
  3. CA-(iii), B-(ii), C-(i)
  4. DA-(ii), B-(iii), C-(i)
Show answerHide answer

Correct answer: (D) A-(ii), B-(iii), C-(i)

Explanation

Recursion uses a stack of activation records, scheduling uses a queue (first come, first served), and sorting can use a binary tree (as in a BST or heap).

From DSSSB TGT Computer Science Practice Set 5

This is question 40 of DSSSB TGT Computer Science Practice Set 5. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.