###### Question 8932 – Compiler-Design
November 15, 2023
###### Question 1880 – Data-Structures
November 16, 2023
###### Question 8932 – Compiler-Design
November 15, 2023
###### Question 1880 – Data-Structures
November 16, 2023

A computer has six tapes 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?

Question 3 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.
5
4
3
6
Article Rating
Subscribe
Notify of
Inline Feedbacks
###### Question 8932 – Compiler-Design
November 15, 2023
###### Question 1880 – Data-Structures
November 16, 2023

A computer has six tapes 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?

Question 3 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.
5
4
3
6