Discussion
Which of the following scheduling algorithms selects the process that has been waiting the longest?
Answer: C
The algorithm is First-Come, First-Served (FCFS).
FCFS runs processes in the order they arrive in the ready queue, so the next process chosen is always the one that has waited longest.
Shortest Job First picks the process with the shortest burst, priority scheduling the highest priority, and round robin gives each process a time slice in turn, so none of them chooses by waiting time alone.
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