3 votes 3 votes A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given 'n' processes to be scheduled on one processor, how many possible different schedules are there? $n$ $n^{2}$ $n!$ $2^{n}$ Combinatory isro2013 process-scheduling combinatory + – makhdoom ghaya asked May 2, 2016 retagged Jun 25, 2017 by Arjun makhdoom ghaya 7.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 12 votes 12 votes preemptive= infinite way non preemptive=n! option=C asu answered Jun 8, 2016 selected Jun 8, 2016 by Arjun asu comment Share Follow See all 3 Comments See all 3 3 Comments reply sarbesh commented May 10, 2017 reply Follow Share In all case n! Only 0 votes 0 votes srestha commented Apr 19, 2018 reply Follow Share no , only for nonpreemptive it will be n! because, it takes 1 process at a time and completes it So, 1st process can executes n ways 2nd process can execute (n-1) ways 3rd process can executes (n-2) ways...... So, n process can executes n! ways 2 votes 2 votes dr_Jackal commented Jan 3, 2020 reply Follow Share I did n't get why in case of pre-emption allowed , Why there can be infinite combination , assuming that time quantum tends to 0 and Burst time tending to NP hard problems (a silly way to say infinte) , still if one of the process is scheduled by CPU then , if suspended it is not the responsiblity of CPU again (long term schedular) to schedule it again, rather the duty of Middle term schedular. 0 votes 0 votes Please log in or register to add a comment.