Which one or more of the following CPU scheduling algorithms can potentially cause starvation?
Shortest Job First
Question 1 Explanation:
Consider four processes P, Q, R, and S scheduled on a CPU as per round robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time t = 0. There is exactly one context switch from S to Q, exactly one context switch from R to Q, and exactly two context switches from Q to R. There is no context switch from S to P. Switching to a ready process after the termination of another process is also considered a context switch. Which one of the following is NOT possible as CPU burst time (in time units) of these processes?
P = 4, Q = 10, R = 6, S = 2
P = 2, Q = 9, R = 5, S = 1
P = 4, Q = 12, R = 5, S = 4
P = 3, Q = 7, R = 7, S = 3
Question 2 Explanation:
Which of the following statement(s) is/are correct in the context of CPU scheduling?
Turnaround time includes waiting time
The goal is to only maximize CPU utilization and minimize throughput
Round-robin policy can be used even when the CPU time required by each of the processes is not known apriori
Implementing preemptive scheduling needs hardware support
Question 3 Explanation:
Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.
Question 4 Explanation:
Three CPU-bound tasks, with execution times of 15, 12 and 5 time units respectively arrive at times 0, t and 8, respectively. If the operating system implements a shortest remaining time first scheduling algorithm, what should be the value of t to have 4 context switches? Ignore the context switches at time 0 and at the end.
0 < t < 3
t <= 3
3 < t < 8
Question 5 Explanation:
There are 5 questions to complete.