4 votes 4 votes Which of the following statements about CPU scheduling algorithms is/are TRUE? (Mark all the appropriate choices) Shortest Job First (SJF) algorithm is optimal with respect to the average turn around time. SJF algorithm is optimal with respect to the average waiting time. SJF algorithm may lead to starvation. SJF algorithm guarantees a better or same average turn around time, as First Come First Served algorithm Operating System go2025-os-1 process-scheduling multiple-selects + – gatecse asked Nov 15, 2020 gatecse 397 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes SJF algorithm is optimal with respect to the average waiting time and average turn around time. But there is a possibility for a long process to starve. So, all options are TRUE. gatecse answered Nov 15, 2020 • selected Oct 30, 2021 by Arjun gatecse comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments DebRC commented Nov 18, 2022 reply Follow Share @gatecse Sir, can you please recheck the solution. For non-preemptive SJF not all of them seems to be true. 0 votes 0 votes gatecse commented Nov 18, 2022 reply Follow Share @DebSujit The question doesn't say anything about non-preemptive SJF right? 0 votes 0 votes DebRC commented Nov 18, 2022 reply Follow Share Okay sir, got it. 1 votes 1 votes Please log in or register to add a comment.