Discussion
Indicate which is a pre-emptive scheduling algorithm
Answer: A
Correct answer: Round-robin
Round robin is preemptive by definition: a process still running when its time slice expires is interrupted by the timer and moved to the back of the queue. Shortest-job-next and simple priority scheduling let the chosen process run to completion or to a block, so they are not preemptive.
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