Discussion
In the Banker's algorithm, what does the "safe state" represent ?
Answer: B
A safe state means the system can allocate resources to processes without deadlock.
In the Banker's algorithm a state is safe if there is at least one order (a safe sequence) in which every process can be given its remaining maximum need and run to completion, releasing its resources for the next. A request is granted only if the resulting state is still safe.
Being outside a critical section, having equal priorities, or having no page faults has nothing to do with the algorithm, which is about avoiding deadlock in resource allocation.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development