Consider three processes (process id 0, 1, 2 respectively) with compute time…

PYQ GATE 2006

Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turnaround time is?

  1. A.

    13 units

  2. B.

    14 units

  3. C.

    15 units

  4. D.

    16 units

Attempted by 249 students.

Sign up free to check your answer

Sign up free

Explore the full course: Operating System

Loading lesson…