A CPU scheduling algorithm should try to maximize……
a) Throughput
b) Turnaround time
c) Waiting time
d) Response time
A CPU scheduling algorithm should try to maximize …..
a) Turnaround time
b) Waiting time
c) Response time
d) All of mentioned
Which of the following algorithm the process that requests CPU is allocated CPU first?
a) Shortest job first scheduling
b) First come, first served scheduling
c) Priority scheduling
d) Round-Robin scheduling
Which of the following algorithm is non-preemptive?
a) Shortest job first scheduling
b) First come, first served scheduling
c) Priority scheduling
d) Round-Robin scheduling
Which of the following algorithm is preemptive?
a) Shortest job first scheduling
b) First come, first served scheduling
c) Priority scheduling
d) Round-Robin scheduling
The priority scheduling algorithm ……
a) Preemptive
b) non preemptive
c) both a & b
d) none of these
