Which of the following scheduling algorithms gives minimum average waiting time?

Related MCQs

• In Operating Systems, which of the following is/are CPU scheduling algorithms?
• Segment replacement algorithms are more complex than page replacement algorithms because                          
• Complex scheduling algorithms
• There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
• What is Waiting time?
• Which of the following algorithms tends to minimize the process flow time?
• Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
• If the number of cycles spent busy – waiting is not excessive, then                          
• With round robin scheduling algorithm in a time shared system                          
• Which of the following page replacement algorithms suffers from Belady’s Anomaly?