Question 168Asked in CIL MT Systems, 26 Mar 2017 (12:30 PM)

Consider the process details given in the following table. Process ID – CPU Burst – Arrival Time – Priority

Consider the process details given in the following table. Process ID – CPU Burst – Arrival Time – Priority P0 – 3 – 0 – 1 P1 – 9 – 2 – 4 P2 – 7 – 4 – 3 P3 – 6 – 3 – 2 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. i. Turnaround time for Process P2 ii. Response time for Process P3
  1. A(i) 20, (ii) 6
  2. B(i) 19, (ii) 3
  3. C(i) 19, (ii) 8
  4. D(i) 20, (ii) 7
Show answerHide answer

Correct answer: (A) (i) 20, (ii) 6

From CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM)

This is question 168 of CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.