UGC NET CS 2015 Jun- paper-2
October 20, 2023Data-Interpretation
October 20, 2023GATE 2006
| Question 6 |
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.
| 1 | |
| 2 | |
| 3 | |
| 4 |
Question 6 Explanation:
Total no.of context switches is 2.
Correct Answer: B
Question 6 Explanation:
Total no.of context switches is 2.