Consider three processes (process id 0, 1, 2 respectively) with compute time…
GATE · 2006 · CS
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?
- A.
13 units
- B.
14 units
- C.
15 units
- D.
16 units
Attempted by 187 students.
Sign up free to check your answer
Sign up freeLoading lesson…