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

Question 7011 – UGC NET June-2019 CS Paper-2

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?

Correct Answer: A

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.
A
5
B
4
C
3
D
6
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
Question 8932 – Compiler-Design
November 15, 2023
Question 1880 – Data-Structures
November 16, 2023

Question 7011 – UGC NET June-2019 CS Paper-2

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?

Correct Answer: A

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.
A
5
B
4
C
3
D
6
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!