GATE Papers >> CSE >> 2010 >> Question No 46

A system has n resources R₀…R_n-1, and k processes P₀…P_k-1. The implementation of the resourcerequest logic of each process P_i. is as follows:
if (i%2==0) {
    if (i<n) request R_i ;
    if (i+2 < n)request R_i+2 ;
}
else {
     if (i<n) request R_n-i ;
     if (i+2<n)request Rn-i-2 ;
}
In which one of the following situations is a deadlock possible?

• (A)  n = 40,k = 26   
• (B)  n = 21,k = 12   
• (C)  n = 20,k = 10   
• (D)  n = 41,k = 19