## Discussion Forum

Que. | Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. |

a. | 1 |

b. | 2 |

c. | 3 |

d. | 4 |

Answer:2 |