GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes
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.
asked in Operating System by gate

1 Answer

0 votes

4 Context Switches will come.

0 P1 2 P1 6 P1 10 P2 30 P3 60

answered by Nowshad C V

Related questions

The best answer to any question