• edited by
1 flag 320 views
0 0 votes

Which of the following is/are True about the Bankers algorithm?

  1. Banker’s algorithm implements the deadlock avoidance strategy. 
  2. If a resource request is not approved and the resource request is still processed, then the system may enter into  deadlock. 
  3. A system always causes deadlock if no safe sequence exists. 
  4. A process having request >= available resources is always granted by Banker’s algorithm.

1 Answer

1 1 vote
  • A  Banker’s algorithm is a deadlock avoidance algorithm.

  • B  If an unsafe request is still granted, the system may enter deadlock.

  • C  No safe sequence ⇒ unsafe state, not guaranteed deadlock.

  • D  Requests are granted only if request ≤ available AND system remains safe (not “always”).

Answer:
Position:
Show:

Related questions

2 2 votes
1 1 answer
479
479 views
GO Classes asked Sep 15, 2025
479 views
Void main() { int a = 0; for (int i = 0; i < 4; i++) { if (fork() == 0) { a++; return ; } else { a++; ...
2 2 votes
2 2 answers
205
205 views
GO Classes asked Sep 15, 2025
205 views
A system is composed of four processes, $\{\mathrm{P} 1, \mathrm{P} 2, \mathrm{P} 3, \mathrm{P} 4\}$, and two types of consumable resources, $\{\mathrm{R} 1, \mathrm{R} 2...
3 3 votes
1 1 answer
186
186 views
GO Classes asked Sep 15, 2025
186 views
Which of the following statements are FALSE about threading?Threads share an address space with other threads in the same process.Threads share register state and stack i...
2 2 votes
1 1 answer
270
270 views
GO Classes asked Sep 15, 2025
270 views
Which of the following problems are associated with spin locks?DeadlockStarvation due to lack of fairnessPriority inversion cannot occurContext-switch overhead is elimina...