GATE 2024 Operating System Foundation Quiz 62

Consider arrival time and execution time for the following processes.

What is the waiting time for P₂ using SRTF scheduling algorithm?

Consider arrival time and execution time for the following processes that need to be scheduled on a single CPU.

Assume X is the total number of contexts switching and Y is the throughput of the system using SRTF scheduling algorithm then find the value of (X + Y)? (Exclude start and end context switching and round-off up to 2 decimal).

Consider the following set of processes with the arrival times and the CPU burst times given in milliseconds:

What does the average turnaround time for these processes with the shortest remaining process time first (SRTF) algorithm? (If burst time is matching them follow lowest arrival time).

Which of the following scheduling algorithms does not discriminate in favour of short processes?

Match List I with List II select the correct answer using the code given below: