1 votes 1 votes An example of a non pre-emptive scheduling algorithm is : Round Robin Priority Scheduling Shortest job first 2 level scheduling Operating System ugcnetcse-dec2008-paper2 operating-system scheduling + – rishu_darkshadow asked Sep 25, 2017 • edited Jun 19, 2020 by soujanyareddy13 rishu_darkshadow 1.8k views answer comment Share Follow See 1 comment See all 1 1 comment reply Raghav Khajuria commented Oct 6, 2018 reply Follow Share Shortest job first is a non preemptive,may leads to starvation Priority scheduling is preemptive because sometimes high priority process can prempt the current running process Round robin is simply a preemptive one with fixed time slots Dont know 2 level scheduling 0 votes 0 votes Please log in or register to add a comment.
