GATE - 2006 | OS | Consider three processes (process id 0, 1, 2 respectively) with

GATE - 2006 | OS | Consider three processes (process id 0, 1, 2 respectively) with
Posted on 18-02-2022

GATE - 2006 [Operating System]

Question:

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

Solution:

Option (A) is Correct.

Algorithm: LRTF (Longest Remaining Time First)

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:

Avg TAT = 12+13+14/3 = 39/3 = 13 units

Thank You

Latest Jobs

Also Read About

GovtVacancy.Net updates latest government vacancies to help the new aspirants to know about the new government jobs and upcoming government jobs. we update the daily latest government vacancies on our portal for all government job aspirants of all the states of India. govtvacancy.net is not affiliated with any government website. All information provided here is for education purposes only. Govt Exam Preparation like SSC UPSC Railways. We Teach Subjects like Science, Maths, History, Geography, Psychology, Economics. We do not claim any facts and figure stated here. Read more on the disclaimer.

©2022 GovtVacancy. All rights reserved

Developed by Om Prakash

Funded by OJB FRP

Email-: [email protected], [email protected]