Which of the following CPU scheduling algorithm tries to reduce the waiting time of the processes and at the same time avoids starvation?
Question 3
Consider the following table:
(All time in ms)
Processes are scheduled with non preemptive priority scheduler. The average waiting Time ________ (ms).
[upto 2 decimal]
Question 4
Consider the following set of processes with the arrival times and burst times. Processes are scheduled using highest response ratio next. What is the average waiting time of processes?
Question 5
Consider the following table:
Assume all process arrived at same time. Every process completes its CPU request then get I/O service. If any two processes need same amount of CPU time, then prefer the process which has less amount of I/O service request. Process is scheduled using SJF for CPU service and I/O scheduling is done using FCFS scheduling, the time at which process P1 completes both CPU and I/O requests is _______.
Question 6
Consider the following set of processes with the arrival times and burst times. Processes are scheduled using highest response ratio next.
(All time in milliseconds)
The average waiting time of processes are ________ (ms). (Upto 1 decimal place)
Question 7Multiple Correct Options
Consider a system with a single CPU core and three processes A, B, C. Process A arrives at t = 0 and runs on the CPU for 10-time units before it finishes. Process B arrives at t = 6 and requires an initial CPU time of 3 units, after which it blocks to perform I/O for 3-time units. After returning from I/O wait, it executes for a further 5 units before terminating. Process C arrives at t = 8 and runs for 2 units of time on the CPU before terminating. Recall that only the size of the current CPU burst (excluding the time spent for waiting on I/O) is considered as the "job size" in these schedulers.
