A computer has six tape drives with (n) processes competing for them. Each process may need two drives. What is the maximum value of (n) for the system to be deadlock free?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. 5
Explanation
Deadlock is impossible if n(2 − 1) + 1 ≤ 6, so n ≤ 5.
More System Software and Operating System questions
- Which of the following UNIX/Linux pipes will ⋅c count the number of lines in all the files having h and as their extension in the current w…
- Which of the following statement/s is/are true? (i) Windows XP supports both peer-peer and client-server networks. (ii) Windows XP implemen…
- In Linux operating system environment _______ command is used to print a file.
- To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true? (i) Writers are given exclusive access…
- Suppose a system has 12 instances of some resource with n processes competing for that resource. Each process may require 4 instances of th…
- Dirty bit is used to show the