Suppose a system has 12 instances of some resource with n processes competing for that resource. Each process may require 4 instances of the resource. The maximum value of n for which the system never enters into deadlock is
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. 3
Explanation
Deadlock is impossible if n(4 − 1) + 1 ≤ 12, i.e. 3n ≤ 11, so n ≤ 3.
More System Software and Operating System questions
- Dirty bit is used to show the
- Suppose for a process P, reference to pages in order are (1,2,4,5,2,1,2,4). Assume that main memory can accomodate 3 pages and the main mem…
- Consider the following processes with CPU burst times in milliseconds (table below). The processes are scheduled with Round-Robin schedulin…
- Suppose P, Q, and R are cooperating processes satisfying Mutual Exclusion conditions. Then, if Q the process is executing in its critical s…
- A process residing in Main Memory and Ready and Waiting for execution is kept on?
- ______ system call creates new process in Unix.