Suppose that there are two resource types (R1 and R2) with five resources each available to four processes. At time 0, the following data is collected. The table indicates the process, the number of resources of each type currently allocated to the processes, and the current request of each resource type by each process. Process Allocation Request
R1 R2 R1 R2
P0 2 0 3 2
P1 1 1 1 0
P2 0 1 1 1
P3 1 1 3 2
Which of the following sentences is correct?
A) All four processes are currently deadlocked.
B) The system is not deadlocked.
C) Processes P0 and P3 are deadlocked.
D) Processes P0, P1 and P3 are deadlocked.
Correct Answer:
Verified
Q10: One necessary condition for deadlock is _,
Q11: One necessary condition for deadlock is _,
Q12: Which of the following is not a
Q13: In a resource allocation graph, when a
Q14: One necessary condition for deadlock is _,
Q16: Deadlock prevention using preempting allocated resources cannot
Q17: In a system that uses deadlock detection
Q18: A _ could be preempted from a
Q19: Which of the following data structures in
Q20: A system will never enter a deadlocked
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents