## Discussion Forum

Que. | Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue? |

a. | Shortest remaining time first |

b. | Round-robin with time quantum less than the shortest CPU burst |

c. | Uniform random |

d. | Highest priority first with priority proportional to CPU burst length |

Answer:Shortest remaining time first |