Discussion
Which one of the following CPU scheduling algorithms cannot be preemptive?
Answer: B
The algorithm that cannot be preemptive is First Come First Serve (FCFS).
FCFS runs processes in arrival order, and each process keeps the CPU until it finishes or blocks. Taking the CPU away from a running process would break the first-come order, so FCFS is non-preemptive by definition.
SRTF is the preemptive version of shortest job first: a newly arrived process with a shorter remaining time takes over the CPU. Round robin preempts each process when its time quantum expires. Priority scheduling can be implemented either way; in its preemptive form a higher-priority arrival takes over the CPU.
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