In priority scheduling algorithm…..
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) Equal priority processes cannot be scheduled
d) None of the mentioned
Shortest job first scheduling falls under the category of……
a) non-preemptive scheduling
b) Preemptive scheduling
c) All of the mentioned
d) None of the mentioned
The strategy of making process that are logically runnable to be suspended is called….
a) Non preemptive scheduling
b) preemptive scheduling
c) shortest job first
d) first come first served
…is sometimes called shortest remaining time first
a) Round-robin scheduling
b) Preemptive SJF scheduling
c) priority scheduling
d) First come, first served scheduling
In which following scheduling algorithm a priority is associated with each process
a) Shortest job first scheduling
b) Priority scheduling
b) First come, first served scheduling
d) Round robin scheduling
In which following scheduling algorithm the ready queue is treated as circular queue and we again treat the ready queue as a FCFS of processes….
a) Round robin scheduling
b) priority scheduling
c) shortest first scheduling
d) First come, first served scheduling
