UTpaper

Free mock tests & test series

Question 118

In the Banker's algorithm, a state is safe if:

  1. ANo process is waiting
  2. BEvery process holds at least one resource
  3. CAll resources are free
  4. DThere exists a sequence in which all processes can finish
Show answerHide answer

Correct answer: (D) There exists a sequence in which all processes can finish

Explanation

Need = Max − Allocation must be satisfiable in some order.

From DSSSB TGT Computer Science Full Mock Test 4

This is question 118 of DSSSB TGT Computer Science Full Mock Test 4. 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.