Consider the process details given in the following table. A new pre-emptive…
PYQ Coal India Management Trainee CBT 2017Modified — slightly modified from the official paper; see the solution
Consider the process details given in the following table.

A new pre-emptive scheduling algorithm is proposed, i.e., the Longest Remaining Time Next (LRTN), wherein ties are broken by giving priority to the process with the highest priority. Calculate the following:
For the priority values, assume that 1 denotes the highest priority and 4 denotes the lowest priority.
i) Turnaround time for Process P2
ii) Response time for Process P3
- A.
(i) 20, (ii) 3
- B.
(i) 19, (ii) 3
- C.
(i) 19, (ii) 8
- D.
(i) 20, (ii) 7
Attempted by 289 students.
Sign up free to check your answer
Sign up freeLoading lesson…

