Progress of Q Release A Pand Q want A A Release Required Get A 3 Deadlock inevitable Pand Q want B B Required Get B 4 Progress of P Get Al Get B Release A Release B = Both Pand Q want resource A Both...

Extracted text: Progress of Q Release A Pand Q want A A Release Required Get A 3 Deadlock inevitable Pand Q want B B Required Get B 4 Progress of P Get Al Get B Release A Release B = Both Pand Q want resource A Both Pand Q want resource B A Required B Required - Deadlock-inevitable region - Possible progress palth of Pand Q Horizontal pontion of path indicates Pis executing nd Q is waiting. Vertical portion of path indicates Qis executing and Pis waiting. 1. Describe the deadlock scenario illustrated above based on your understanding. (5 points) 2. What do you think would happen if both Process Pand Q need to get the same resource? (5 points) 3. Which concurrency mechanism would you suggest that might prevent the deadlock situation above? Rationalize your answer. (5 points) 4. Define in detail the Execution Paths 2 to 6. (5 items x 3 points) Example: Execution Path 1- Process Q acquires Resource B and then Resource A. Process Q then releases Resource B and A, respectively. 5. Do Execution Paths 3 and 4 encompass the first three conditions for a deadlock to occur? Explain your answer. (5 points)


Extracted text: 6. If you are to implement deadlock prevention before the processes above reach the critical section, would it be an indirect method or an indirect method? Why? (5 points) 7. Which deadlock avoidance approach would you suggest for the given situation above and why? (5 points) 8. Would you agree that deadlock is relative to the number of processes and available resources in an operating system? Why or why not? (5 points) 9. If you are asked to reconstruct the progress diagram above to eliminate the critical section, which is the deadlock-inevitable region, which aspect(s) or area(s) would you modify? Explain how the modification eliminates the deadlock. (5 points)