Consider a system with five processes P0 through P4 and three resource types A, B and C, with 7, 2 and 6 total instances respectively. At time T0 the system state is:
Process Allocation (A,B,C) Request (A,B,C) P0 0 1 0 0 0 0 P1 2 0 0 2 0 2 P2 3 0 3 0 0 0 P3 2 1 1 1 0 0 P4 0 2 2 0 0 2
Available = (0, 0, 0). Applying the deadlock detection algorithm, the system is:
| Process | Allocation (A,B,C) | Request (A,B,C) | ||||
|---|---|---|---|---|---|---|
| P0 | 0 | 1 | 0 | 0 | 0 | 0 |
| P1 | 2 | 0 | 0 | 2 | 0 | 2 |
| P2 | 3 | 0 | 3 | 0 | 0 | 0 |
| P3 | 2 | 1 | 1 | 1 | 0 | 0 |
| P4 | 0 | 2 | 2 | 0 | 0 | 2 |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. (D) Not in deadlock state
More System Software and Operating System questions
- The Bounded Buffer problem is also known as the ________.
- Two atomic operations permissible on semaphores are ________ and ________.
- Three processes share a single counting semaphore S whose initial value is 1. All three execute wait(S) one after another, in the order P2,…
- In the UNIX operating system, when a process creates a child process using the fork() system call, which of the following is genuinely shar…
- A system has 12 instances of a resource R shared among four processes. The maximum need and current allocation of each process are: Process…
- Given 4 GB (≈ 4.3 × 10⁹ bytes) of virtual address space and a page size of 4 KB (= 4 × 10³ bytes), with each page table entry 5 bytes: how…