engineering recuitment GATE CSE 2023-24 Test Series Operating Systems CPU Scheduling Process Scheduling
Consider four processes P1, P2, P3, and P4 arrived at a time 0, 1, 2, 1 with computation time 5, 7, 3, and 1 respectively. In the case of the same arrival time, the process with the lowest subscript is given the highest priority if the scheduling algorithm used is First Come First Serve (FCFS) or shortest Job First (SJF). Round robin (RR) is having a time slice value of 2. SJF is non-primitive while the pre-emptive version of SJF is SRTF.
Which of the following is/are FALSE about the total average waiting time of the processes for the SJF, SRTF, RR, FCFS scheduling algorithms?
1
Average waiting time for RR is same SRTF
2
Average waiting time for FCFS is same as RR
3
Average waiting time for SJF is same RR
4
SJF is having the smallest average waiting time