Computer Sciences > Gate 2019 > Process
Consider the following snapshot of a system running n concurrent processes. Process i is holding Xi instances of a resource R, 1 ≤ i ≤ n. Assume that all instances of R arecurrently in use. Further, for all i, process i can place a request for at most Yi additional instances of R while holding the Xt instances it already has. Of the n processes, there are exactly two processes p and q such that Yp = Yq = 0. Which one of the following conditions guarantees that no other process apart from p and q can complete execution?
A
Xp + Xq < Min {Yk ⏐ 1 ≤ k ≤ n, k ≠ p, k ≠ q}
B
Xp + Xq < Min {Yk ⏐ 1 ≤ k ≤ n, k ≠ p, k ≠ q}
C
Min (Xp , Xq ) ≤ Max {Yk ⏐ 1 ≤ k ≤ n, k ≠ p, k ≠ q}
D
Min (Xp , Xq ) ≤ Max {Yk ⏐ 1 ≤ k ≤ n, k ≠ p, k ≠ q}

Correct : a

Similar Questions

The maximum number of processes that can be in Ready state for a computer system with n CPUs is
#41 MCQ
The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently. P1() { &nbsp; &nbsp; C = B – 1; &nbsp; &...
#538 Fill in the Blanks
A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From...
#1 MCQ

Related Topics

resource allocation deadlock prevention GATE computer science 2019 process resource allocation concurrent processes deadlock Min Max condition for deadlock deadlock prevention algorithm resource allocation theory gate GATE CS 2019 question 2

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: