-
A system has n resources R0, ..... Rn - 1, and k processes P0, .... Pk - 1. The implementation of the resources request 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?
-
- n = 40, k = 26
- n = 21, k = 12
- n = 20, k = 10
- n = 41, k = 19
- n = 40, k = 26
Correct Option: B
NA