Register

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 38

• retagged by
733 views
4 votes
4 votes
Consider the following jobs along with their arrival and execution time.
$$
\begin{array}{c|c|c}
\textbf{Job} & \textbf{Arrival time} & \textbf{Execution time} \\
\hline \mathrm{A} & 0 & 45 \\
\mathrm{B} & 19 & 15 \\
\mathrm{C} & 40 & 30 \\
\mathrm{D} & 79 & 50 \\
\mathrm{E} & 89 & 30
\end{array}
$$
What is the average turnaround time for these processes with the preemptive shortest remaining processing time first (SRPT) algorithm?
• retagged by
User Avatar

2 Answers

6 votes
6 votes
Average Turnaround time = 49.4
• edited by
User Avatar
3 votes
3 votes

In the question it is given preemptive SRPT, hence when B arrives at 19 seconds CPU preempts from executing A and starts executing process B as it has shorter Burst time and in the same manner the remaining process gets executed. 

  AT BT CT TAT =(CT-AT)
A 0 45 60 60
B 19 15 34 15
C 40 30 90 50
D 79 50 170 91
E 89 30 120 31

Therefore, Average TAT = 49.4

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
3
GO Classes asked Jan 21
460 views
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 31
How many binary trees with $3$ nodes, $\text{A, B},$ and $\text{C}$ when traversed in post-order will give the sequence $\text{A, B, C}?$ (It is NOT a search tree)
How many binary trees with $3$ nodes, $\text{A, B},$ and $\text{C}$ when traversed in post-order will give the sequence $\text{A, B, C}?$ (It is NOT a search tree)
User Avatar
Link Copied!