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

Question No. 46 CSE | GATE 2010

A system has n resources R0Rn-1, and k processes P0Pk-1. The implementation of the resourcerequest logic of each process Pi. is as follows:
if (i%2==0) {
    if (i<n) request Ri ;
    if (i+2 < n)request Ri+2 ;
}
else {
     if (i<n) request Rn-i ;
     if (i+2<n)request Rn-i-2 ;
}

In which one of the following situations is a deadlock possible?


Answer : (A) n = 40,k = 26


Comments
Iz34gR http://pills2sale.com/ levitra nizagara

Posted on  18/10/2020 20:13:40  by  dobsonz
3sCsuz https://www.quora.com/What-the-top-SEO-keywords-for-essay-you-know/answer/Alan-Smith-1772 write my essay

Posted on  04/12/2020 00:40:47  by  dobson
75aIPW http://xnxx.in.net/ xnxx videos

Posted on  12/12/2020 20:32:17  by  johnan
TFQrcJ https://writemyessayforme.web.fc2.com/

Posted on  13/12/2020 05:23:02  by  dobson
MHxVLQ https://writemyessayforme.web.fc2.com/#writemyessay

Posted on  15/12/2020 06:24:13  by  dobson
ptHMya https://writemyessayforme.web.fc2.com/octavio-paz-essay-day-of-the-dead.html

Posted on  09/01/2021 09:51:45  by  dobson
tVqi6s http://waldorfdollshop.us/ waldorf doll

Posted on  09/01/2021 14:06:38  by  johnanz
SJXQBQ https://beeg.x.fc2.com/

Posted on  26/01/2021 14:50:12  by  markus
i7ShIA https://buyzudena.web.fc2.com/

Posted on  27/01/2021 13:55:34  by  markus
Leave a comment