1. Starvation Occurs In Which Scheduling Algorithm

SJF has the best average turnaround time, followed by FCFS.RR has the worst turnaround time, in comparison.Explanation:FCFS scheduling is the simplest scheduling algorithm,but it can cause short processes to wait for very long processes (convoy effect).SJF scheduling is an improvement over FCFS, taking into account the length of time a process needs to complete (CPU burst). SJF is provably optimal, providing the shortest average waiting time. Implementing SJF scheduling is difficult, however, because predicting the length of the next CPU burst is difficult. Furthermore, processes that have long running times may starve under SJF, if there are too many short ones.RR offers a solution to the fairness issue, providing better average response time.

Starvation Occurs In Which Scheduling Algorithm

That typically comes at the cost of a higher average turnaround time though.At the end of the day, it is a tradeoff between average turnaround time and fairness in terms of response time.Here is another link to help you out:Alternatively, you could check out Chapter 6 CPU Scheduling of the following book:Operating System Concepts, 9th Editionby Silberschatz, Galvin, and Gagne.