Concept drill
maximum processes
GATE CSE & IT · Deadlocks · 1992-1998
2
PYQs
100%
keyed
0
elite explanations
2
years appeared
Study anchor
Galvin — Operating System Concepts
Processes, scheduling, memory, files, deadlocks
Practice action
Start latest PYQPYQs in this concept
All concepts →1998 PYQ
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?
easyanswer key
1992 PYQ
A computer system has 6 tape drives, with n process completing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlo...
easyanswer key