Gate CS-2015-3 Question Paper With Solutions

Q. 52 Consider the following policies for preventing deadlock in a system with mutually
exclusive resources.

I. Processes should acquire all their resources at the 
   beginning of execution.  If any resource is not  
   available, all resources acquired so far are released.
II. The resources are numbered uniquely, and processes are 
    allowed to request for resources only in increasing 
    resource numbers.
III. The resources are numbered uniquely, and processes are
     allowed to request  for resources only in decreasing 
     resource numbers.
IV. The resources are numbered uniquely. A process is allowed
    to request only for a resource with resource number larger
    than its currently held resources.

When of the above policies can be used for preventing deadlock?

(A) Any one of I and III but not II or IV

(B) Any one of I, III and IV but not II

(C) Any one of II and III but not I or IV

(D) Any one of I, II, III and IV

Learn More:   CS-2002 Question Paper With Solutions

Answer: (D)

Explanation:

Gate CS-2015-3 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here