[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

Operating System :: Process Management - Discussion

Home > Operating System > Process Management > MCQs Questions Discussion

11 / 41

Choose the correct option.

An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.

AFCFS scheduling algorithm

BRound robin scheduling algorithm

CShortest job first scheduling algorithm

DNone of these

Answer: Option (Login/Signup)

Show Explanation

In the case of Round Robin(RR), if the time quantum is large, it will result to starvation, because other processes will have to wait for a long time to execute.

Only SJF or Shortest Job First  scheduling algorithm is optimal in terms of average waiting time for a given set of processes i.e., average waiting time is minimum in this scheduling algorithm. In SJF, processes which have the shortest burst time are scheduled first. It is a non-preemptive scheduling algorithm.  

Asked In :: Wipro

Post Your Answer Here:     

Reply    
Rate This: +0 -0
    Report


Report Error

Please Login First Click Here