GATE CS 2010

Question 61

A system has n resources R₀,...,R_n-1,and k processes P₀,....P_k-1.The implementation of the resource request logic of each process P_i 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

Question 62

Consider the data given in above question. Suppose the weights of all unused links in the previous question are changed to 2 and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused?

• 0
• 1
• 2
• 3

Question 63

Choose the most appropriate word from the options given below to complete the following sentence: If we manage to ____________ our natural resources, we would leave a better planet for our children.

• uphold
• restrain
• cherish
• conserve