UTpaper

Free mock tests & test series

Question 7

Consider the following statements about deadlock: A. Existence of a cycle in resource-allocation graph indicates deadlock.

Consider the following statements about deadlock: A. Existence of a cycle in resource-allocation graph indicates deadlock. B. Existence of a cycle in wait-for graph indicates deadlock. C. Mutual-exclusion, hold and wait, no preemption and circular wait conditions, if occur simultaneously, may lead to deadlock. Mark the correct option :
  1. AOnly (b) is correct
  2. BOnly (c) is correct
  3. COnly (a) and (c) are correct
  4. DOnly (b) and (c) are correct
Show answerHide answer

Correct answer: (D) Only (b) and (c) are correct

Explanation

Corrected: the book's key says (c). A cycle in a resource-allocation graph does not always mean deadlock (with multiple instances), so A is false; B and C are correct.

From DSSSB TGT Computer Science Practice Set 5

This is question 7 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.