Register

NIELIT 2017 July Scientist B (IT) - Section B: 44

• retagged by
1,668 views
2 votes
2 votes

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 turn around time is

  1. $13$ units
  2. $14$ units
  3. $15$ units
  4. $16$ units
• retagged by
User Avatar

2 Answers

0 votes
0 votes
Answer is 13 units as the scheduling is preemptive type and Gantt chart for it clarifies the solution.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
3
admin asked Mar 30, 2020
1,410 views
NIELIT 2017 July Scientist B (IT) - Section B: 47
Which of the following process scheduling algorithm may lead to starvation? FIFO Round Robin Shortest Job Next None of the option
Which of the following process scheduling algorithm may lead to starvation?FIFORound RobinShortest Job NextNone of the option
User Avatar
Link Copied!