UGC NET CS 2014 June-paper-3
October 3, 2023UGC NET CS 2014 June-paper-3
October 3, 2023Process-Scheduling
| Question 10 |
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:
| 13 units | |
| 14 units | |
| 15 units | |
| 16 units
|
Question 10 Explanation:
Algorithm: LRTF (Longest Remaining Time First)
Avg TAT = 12+13+14/3 = 39/3 = 13 units
Avg TAT = 12+13+14/3 = 39/3 = 13 units
Correct Answer: A
Question 10 Explanation:
Algorithm: LRTF (Longest Remaining Time First)
Avg TAT = 12+13+14/3 = 39/3 = 13 units
Avg TAT = 12+13+14/3 = 39/3 = 13 units
Subscribe
Login
0 Comments