Operating-Systems
December 11, 2023Question 14128 – NIC-NIELIT Scientist-B 2020
December 11, 2023GATE 1998
|
Question 32
|
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?
|
6
|
|
|
5
|
|
|
4
|
|
|
3
|
Question 32 Explanation:
Each process needs 2 drives. So for deadlock just give each process one drive. So total 6 process can be given 1 drive each and can cause deadlock. So to break deadlock just reduce 1 process.
So maximum no. of process for the system to be deadlock free is 5.
So maximum no. of process for the system to be deadlock free is 5.
Correct Answer: B
Question 32 Explanation:
Each process needs 2 drives. So for deadlock just give each process one drive. So total 6 process can be given 1 drive each and can cause deadlock. So to break deadlock just reduce 1 process.
So maximum no. of process for the system to be deadlock free is 5.
So maximum no. of process for the system to be deadlock free is 5.