Log In

Recent questions tagged bankers-algorithm

2 votes
1 answer
Banker algorithm is used by OS to avoid the deadlock. Following table shows the current allocation and maximum demand by process $P_{1}$,$P_{2}$,$P_{3}$ and $P_{4}$ for the instances $A,B,C$ Process Max Demand (A,B,C) Current Allocation(A,B,C) $P_{1}$ $8,2,3$ ... $A,B,C$ respectively Req2: $P_{4}$ requests $1,0,1$ of $A,B,C$ respectively Which of these two requests will be granted?
asked Mar 2, 2019 in Operating System srestha 338 views
1 vote
1 answer
An operating system contains three resource classes. The number of resource units in these classes are $7, 7\ \text{and} \ 10$ ... state safe? Justify. If process $P_1$ now requests $(1,1,0)$ resources, then what will be the status of the new state?
asked Sep 20, 2018 in Operating System jothee 168 views
2 votes
1 answer
The time complexity of banker's algorithm to avoid deadlock having $n$ processes and $m$ resources is?
asked May 28, 2018 in Operating System Nancy Pareta 508 views
4 votes
4 answers
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
asked Jul 16, 2017 in Operating System Sunil8860 1.4k views
5 votes
1 answer
An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of allocation of devices as follows: State 1 ... State 1 is safe and State 2 is unsafe Both State 1 and State 2 are safe Both State 1 and State 2 are unsafe
asked Jul 19, 2016 in Operating System jothee 2.1k views
3 votes
2 answers
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)$
asked Nov 15, 2015 in Operating System asu 1.3k views
To see more, click for the full list of questions or popular tags.