Register

Recent questions tagged deadlock-prevention-avoidance-detection

7 votes
2 answers
278
ISRO2009-16
Consider a system having "n" resources of same type. These resources are shared by 3 processes, A, B, C. These have peak demands of 3, 4, and 6 respectively. For what value of "n" deadlock won't occur 15 9 10 13
Consider a system having "n" resources of same type. These resources are shared by 3 processes, A, B, C. These have peak demands of 3, 4, and 6 respectively. For what val...
User Avatar
6 votes
4 answers
279
ISRO-2013-57
Which of the following is not a necessary condition for deadlock? Mutual exclusion Reentrancy Hold and wait No pre-emption
Which of the following is not a necessary condition for deadlock?Mutual exclusionReentrancyHold and waitNo pre-emption
User Avatar
1 votes
4 answers
281
Which of the following is not a necessary condition for a deadlock among processes?
Which of the following is not a necessary condition for a deadlock among processes? (a) Shared Resources (b) No Preemption (c) Acyclic condition among processes (d) None of the above
Which of the following is not a necessary condition for a deadlock among processes?(a) Shared Resources(b) No Preemption(c) Acyclic condition among processes(d) None of t...
User Avatar
1 votes
3 answers
283
Deadlock
A computer has six tape drivers, with n processes competing for them. Each process may need two drivers. What is the maximum value of n for the system to be deadlock free? a] 6 b] 5 c] 4 d] 3
A computer has six tape drivers, with n processes competing for them. Each process may need two drivers. What is the maximum value of n for the system to be deadlock free...
User Avatar
1 votes
1 answer
286
deadlock
if system is in unsafe state then deadlock may or may not occur but in bankers algorithm if system found in unsafe state how to check further for deadlock. explain with example
if system is in unsafe state then deadlock may or may not occurbut in bankers algorithm if system found in unsafe state how to check further for deadlock. explain with e...
User Avatar
1 votes
1 answer
287
deadlock
what is meant by satisfy deadlock? free from deadlock OR not free from deadlock
what is meant by satisfy deadlock?free from deadlockORnot free from deadlock
User Avatar
3 votes
2 answers
288
deadlock
It the Resource-Allocation Graph contains $'m'$ types of resource and $'n'$ processes, then the time complexity of the algorithm for deciding whether the system is safe or unsafe is $O(n^2 \times m)$ $O(n \times m)$ $O(n^2 \times m^2)$ $O(n \times m^2)$
It the Resource-Allocation Graph contains $'m'$ types of resource and $'n'$ processes, then the time complexity of the algorithm for deciding whether the system is safe o...
User Avatar
1 votes
1 answer
290
Not a necessary condition of deadlock.
Which of the following is not a necessary condition(s) for a deadlock? 1.Mutual Exclusion 2.Hold and wait 3.No pre-emption 4.Re-entrancy
Which of the following is not a necessary condition(s) for a deadlock?1.Mutual Exclusion2.Hold and wait3.No pre-emption4.Re-entrancy
User Avatar
1 votes
2 answers
291
If the available no of resources are unable to meet the future need of any of the processes then what is the state ?
Just wanted to know that if none of the needs of a process is met so can we directly say that it is unsafe state as well as will lead to deadlock since none of the needs ...
User Avatar
1 votes
1 answer
294
DEADLOCK
in which system deadlock exists ?
in which system deadlock exists ?
User Avatar
8 votes
4 answers
295
ISRO2009-77
When a process is rolled back as a result of deadlock the difficulty which arises is Starvation System throughput Low device utilization Cycle stealing
When a process is rolled back as a result of deadlock the difficulty which arises isStarvationSystem throughputLow device utilizationCycle stealing
User Avatar
10 votes
3 answers
296
ISRO2008-62
In which of the following four necessary conditions for deadlock processes claim exclusive control of the resources they require? no preemption mutual exclusion circular wait hold and wait
In which of the following four necessary conditions for deadlock processes claim exclusive control of the resources they require?no preemptionmutual exclusioncircular wai...
User Avatar
2 votes
4 answers
297
which of the following is not a necessary condition for deadlock?
which of the following is not a necessary condition for deadlock? a)Mutual exclusion b)Reentrancy c)Hold and Wait d)No pre-emption
which of the following is not a necessary condition for deadlock?a)Mutual exclusionb)Reentrancyc)Hold and Waitd)No pre-emption
User Avatar
5 votes
4 answers
300
'm' processes share 'n' resources of same type. The maximum need of each process does not exceed 'n' and the sum all their maximum needs is always less than m+n. In this setup deadlock can occur or not?
This is a question from Operating System concepts by Silberschatz, Gagne and Galvin. On very first go I could make that in such a situation deadlock can never occur. But ...
User Avatar
Page: