Round Robin (RR) scheduling algorithm uses time quantum (Q) that determines the time sl in which a scheduled process can use the CPU. In case the CPU scheduler uses large value (Q), then which of the following applies a. It will be better for the users if the longer cpu burst processes to be scheduled first O b. It will be better for the users if the shorter cpu burst processes to be scheduled first O c. It will make no difference on the performance in case who will be scheduled first O d. The Algorithm will be similar to SJF O e. B and D

Using SRT algorithm Arrival Time 4 Job А C D CPU Cycle 4 3 1 2 Job A Job C Job A Job D Job B 2 3 5 7 10 a) Find the turnaround time for A, B, C and D. b) Find the average turnaround time for A, B, C and D.

DO NOT COPY FROM OTHER WEBSITES Correct and detailed answer will be Upvoted else downvoted. Thank you!

Which of the following CPU Scheduling algorithms might be susceptible to starvation? Assume burst times could be wildly small OR wildly large. For round robin, assume a reasonably small time quantum. Shortest Time First (non-preemptive) Round Robin Priority Scheduling Shortest Time First (preemptive) First Come First Serve