Discussion
Which of the following process scheduling algorithm may lead to starvation ?
Answer: C
The algorithm that may lead to starvation is Shortest Job Next.
Shortest Job Next always runs the waiting job with the shortest CPU burst. If short jobs keep arriving, a long job can be passed over indefinitely, which is starvation.
FIFO serves jobs in order of arrival, so every job eventually runs, and Round Robin gives every process a time slice in turn. Since one option does starve, 'None of the above' is wrong.
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