Multiple Choice
With round robin scheduling algorithm in a time shared system___________
A) using very large time slices converts it into first come first served scheduling algorithm
B) using very small time slices converts it into first come first served scheduling algorithm
C) using extremely small time slices increases performance
D) using very small time slices converts it into shortest job first algorithm
Correct Answer:

Verified
Correct Answer:
Verified
Q8: The real difficulty with SJF in short
Q9: What is Response time?<br>A)the total time taken
Q10: Round robin scheduling falls under the category
Q11: Which is the most optimal scheduling algorithm?<br>A)fcfs
Q12: Scheduling is done so as to<br>A)increase the
Q14: Scheduling is done so as to<br>A)increase the
Q15: In the following cases non - preemptive
Q16: An I/O bound program will typically have<br>A)a
Q17: Scheduling is done so as to<br>A)increase the
Q18: The portion of the process scheduler in