Friday, 22 November 2019

UGC NET PAPER 2 June 2019 Question 45 (Shift-I)

45. Consider three intensive processes, which requires 10,20 and 30 units of time 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 ad at the end
A4
B 2
C 3
D 1

ANS. B

PreviousNext
UGC NET CS 2018 July - II Question 44UGC NET CS 2018 July - II Question 46

No comments:

Post a Comment