Discussion
Which of the following algorithms may cause starvation ?
(i) First-come-first-serve
(ii) Round Robin
(iii) Priority
(iv) Shortest process next
(v) Shortest remaining time first
Answer: B
Starvation can occur with (iii), (iv) and (v).
Under priority scheduling, a low-priority process can wait indefinitely if higher-priority processes keep arriving. Shortest process next and shortest remaining time first always favour short jobs, so a long process can be postponed forever if short jobs keep coming.
First-come-first-served and round robin cannot starve a process. FCFS serves every process in arrival order, and round robin gives each ready process a time slice in turn, so every process eventually runs. Options including (i) or (ii) are therefore wrong.
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