Discussion
Which of the following scheduling algorithms is non-preemptive ?
Answer: B
The non-preemptive algorithm is First-In First-Out.
Under FIFO (first come, first served) a process, once given the CPU, keeps it until it finishes or blocks for I/O; nothing takes the CPU away from it.
Round Robin preempts a process when its time quantum ends. Multilevel queue scheduling preempts lower-priority queues when a higher-priority process arrives, and the feedback version also moves processes between queues, typically using time slices.
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