Register

Recent questions tagged bankers-algorithm

0 votes
2 answers
3
UGC NET CSE | June 2005 | Part 2 | Question: 38
Banker's algorithm is for Dead lock Prevention Dead lock Avoidance Dead lock Detection Dead lock creation
Banker's algorithm is forDead lock PreventionDead lock AvoidanceDead lock DetectionDead lock creation
User Avatar
1 votes
1 answer
6
ISI2017-PCB-CS-5(a)
An operating system contains three resource classes. The number of resource units in these classes are $7, 7\ \text{and} \ 10$ ... safe? Justify. If process $P_1$ now requests $(1,1,0)$ resources, then what will be the status of the new state?
An operating system contains three resource classes. The number of resource units in these classes are $7, 7\ \text{and} \ 10$ respectively. The current resource allocati...
User Avatar
9 votes
1 answer
7
operating system (deadlock)
The time complexity of banker's algorithm to avoid deadlock having $n$ processes and $m$ resources is?
The time complexity of banker's algorithm to avoid deadlock having $n$ processes and $m$ resources is?
User Avatar
7 votes
6 answers
9
deadlock
If a process is in unsafe state, then: (a) It is in deadlock (b) It might successfully complete (c) It will lead to deadlock (d) None of the above
If a process is in unsafe state, then:(a) It is in deadlock (b) It might successfully complete(c) It will lead to deadlock (d) None of the above
User Avatar
8 votes
2 answers
10
ISRO2017-48
What problem is solved by Dijikstra banker' algorithm? Mutual exclusion Deadlock recovery Deadlock avoidance Cache coherence
What problem is solved by Dijikstra banker' algorithm?Mutual exclusionDeadlock recoveryDeadlock avoidanceCache coherence
User Avatar
3 votes
2 answers
14
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
To see more, click for the full list of questions or popular tags.