Question 20Asked in DSSSB PGT Computer Science (Technical), 11 Jul 2021

Match the following. A. Disk scheduling — i. Shortest Job First

Match the following. A. Disk scheduling — i. Shortest Job First B. CPU scheduling — ii. Banker's Algorithm C. Page replacement — iii. Shortest Seek Time D. Deadlock — iv. Least Recently Used
  1. AA-iii, B-i, C-iv, D-ii
  2. BA-i, B-iv, C-ii, D-iii
  3. CA-iii, B-iv, C-i, D-ii
  4. DA-iv, B-i, C-ii, D-iii
Show answerHide answer

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

Explanation

Shortest Seek Time First is disk scheduling, Shortest Job First is CPU scheduling, Least Recently Used is page replacement, and the Banker's algorithm is deadlock avoidance.

From DSSSB PGT Computer Science PYQ (Technical), 11 Jul 2021

This is question 20 of DSSSB PGT Computer Science PYQ (Technical), 11 Jul 2021. 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.