This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 3 months ago.

  • Author
    Posts
  • #572956 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    Which of the following conditions is required for a resource allocation graph to avoid deadlocks?

    Options :-

    1. The graph must provide resources to processes simultaneously.
    2. The processes should not wait in a ready queue.
    3. The resource allocation must not have a cycle.
    4. The resources must not be provided to the processes.
    5. The resources must be busy with single process only.
    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: Which of the following conditions is required for a resource allocation graph to avoid deadlocks?….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account