GATE CS 2019 (Forenoon) — Question 49

Operating Systems (OS)Deadlock Prevention, Avoidance, Detection, RecoveryMCQ2 marks · −2/3 if wrongHard

Consider the following snapshot of a system running \( n \) concurrent processes. Process \( i \) is holding \( X_i \) instances of a resource R, \( 1 \le i \le n \). Assume that all instances of R are currently in use. Further, for all \( i \), process \( i \) can place a request for at most \( Y_i \) additional instances of R while holding the \( X_i \) instances it already has. Of the \( n \) processes, there are exactly two processes \( p \) and \( q \) such that \( Y_p = Y_q = 0 \). Which one of the following conditions guarantees that no other process apart from \( p \) and \( q \) can complete execution?
  1. A
    \( X_p + X_q < \min \{Y_k \mid 1 \le k \le n, k \neq p, k \neq q\} \)
  2. B
    \( X_p + X_q < \max \{Y_k \mid 1 \le k \le n, k \neq p, k \neq q\} \)
  3. C
    \( \min (X_p, X_q) \ge \min \{Y_k \mid 1 \le k \le n, k \neq p, k \neq q\} \)
  4. D
    \( \min (X_p, X_q) \le \max \{Y_k \mid 1 \le k \le n, k \neq p, k \neq q\} \)
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Deadlock Prevention, Avoidance, Detection, RecoveryTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group