Question:
Consider the following process information for Shortest Remaining Time First (SRTF) scheduling:
\[
\begin{array}{|c|c|c|}
\hline
\textbf{Process} & \textbf{Arrival Time (AT)} & \textbf{Burst Time (BT)} \\
\hline
P1 & 0 & 10 \\
P2 & 1 & 13 \\
P3 & 2 & 6 \\
P4 & 8 & 9 \\
\hline
\end{array}
\]
Find the turnaround time for each process.
Consider the following process information for Shortest Remaining Time First (SRTF) scheduling:
\[ \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time (AT)} & \textbf{Burst Time (BT)} \\ \hline P1 & 0 & 10 \\ P2 & 1 & 13 \\ P3 & 2 & 6 \\ P4 & 8 & 9 \\ \hline \end{array} \]Find the turnaround time for each process.
Show Hint
In SRTF scheduling, always pick the process with the shortest remaining burst time. This helps minimize the turnaround time for processes.
Updated On: Jan 8, 2026
- 19
- 20
- 18
- 15
Show Solution
Verified By Collegedunia
The Correct Option is A
Solution and Explanation
Step 1: Calculate the completion time for each process using the Shortest Remaining Time First (SRTF) scheduling algorithm.
SRTF is a preemptive version of the Shortest Job First (SJF) scheduling algorithm. It executes the process with the shortest remaining burst time.
1. Initially, process \( P1 \) starts executing at time 0.
2. Process \( P3 \) arrives at time 2, and has a burst time of 6, which is shorter than the remaining burst time of \( P1 \). Thus, \( P3 \) executes next.
3. After \( P3 \) completes at time 8, \( P1 \) resumes execution as it has the shortest remaining burst time.
4. Process \( P2 \) arrives at time 1, but \( P1 \) continues since it has less remaining burst time than \( P2 \).
5. After \( P1 \) completes at time 10, process \( P2 \) executes.
6. Process \( P4 \) arrives at time 8 but starts after \( P2 \) as it has a larger burst time.
Step 2: Calculate the turnaround time.
Turnaround time is the difference between the completion time and the arrival time.
\[ \text{Turnaround Time for } P1 = 10 - 0 = 10 \] \[ \text{Turnaround Time for } P2 = 19 - 1 = 18 \] \[ \text{Turnaround Time for } P3 = 8 - 2 = 6 \] \[ \text{Turnaround Time for } P4 = 19 - 8 = 11 \]
Thus, the average turnaround time is:
\[ \frac{10 + 18 + 6 + 11}{4} = 19 \, \text{units}. \]
Thus, the correct answer is \( 19 \).
SRTF is a preemptive version of the Shortest Job First (SJF) scheduling algorithm. It executes the process with the shortest remaining burst time.
1. Initially, process \( P1 \) starts executing at time 0.
2. Process \( P3 \) arrives at time 2, and has a burst time of 6, which is shorter than the remaining burst time of \( P1 \). Thus, \( P3 \) executes next.
3. After \( P3 \) completes at time 8, \( P1 \) resumes execution as it has the shortest remaining burst time.
4. Process \( P2 \) arrives at time 1, but \( P1 \) continues since it has less remaining burst time than \( P2 \).
5. After \( P1 \) completes at time 10, process \( P2 \) executes.
6. Process \( P4 \) arrives at time 8 but starts after \( P2 \) as it has a larger burst time.
Step 2: Calculate the turnaround time.
Turnaround time is the difference between the completion time and the arrival time.
\[ \text{Turnaround Time for } P1 = 10 - 0 = 10 \] \[ \text{Turnaround Time for } P2 = 19 - 1 = 18 \] \[ \text{Turnaround Time for } P3 = 8 - 2 = 6 \] \[ \text{Turnaround Time for } P4 = 19 - 8 = 11 \]
Thus, the average turnaround time is:
\[ \frac{10 + 18 + 6 + 11}{4} = 19 \, \text{units}. \]
Thus, the correct answer is \( 19 \).
Was this answer helpful?
3
0
Top GATE CS Programming and Data Structures Questions
- Which of the following sequences when stored in an array at locations A[1],..., A[10] forms a max-heap?
- Given N distinct elements in an array, determine the number of comparisons required to find the element which is not the largest:
Consider the following code:
main() { int x = 126, y = 105; { if (x > y) x = x - y; else y = y - x; } while (x != y) printf("%d", x); }- In a binary search tree with the following elements: \( 10, -4, 15, 13, 20, 5, 16, 19 \), the number of edges from node 19 to the root is?
Consider the following code:
int a; int arr[] = {30, 50, 10}; int *ptr = arr[10] + 1; a = *ptr; (*ptr)++; ptr = ptr + 1; printf("%d", a + arr[1] + *ptr);
View More Questions
Top GATE CS Programming in C Questions
- Given N distinct elements in an array, determine the number of comparisons required to find the element which is not the largest:
Consider the following code:
main() { int x = 126, y = 105; { if (x > y) x = x - y; else y = y - x; } while (x != y) printf("%d", x); }- Bird: Nest :: Bee: ............ ?
Given the following cache parameters:
\[ \begin{array}{|c|c|} \hline \textbf{Tag} & 4 \, \text{bits} \\ \textbf{Index} & 12 \, \text{bits} \\ \textbf{Block Size} & 1 \, \text{byte} \\ \hline \end{array} \]Find the size of the main memory and the size of the cache memory.
- In the case of a 4-bit ripple counter, if the time period of the waveform at the last flip-flop is 64 microseconds, what is the input frequency?
View More Questions
Top GATE CS Questions
- Which of the following sequences when stored in an array at locations A[1],..., A[10] forms a max-heap?
- The Lucas sequence Ln is defined by the recurrence relation: Ln = Ln−1 + Ln−2, for n ≥ 3, with L1 = 1 and L2 = 3. Which one of the options given is TRUE?
- Which of the following fields of IP header is/are always modified by any router before it forwards to IP Packet ?
- Which one of the following CIDR profix exactly represent the range of IP addresses 10.12.2.0 to 10.12.3.255?
- Consider an ethernet segment whose transmission is \(10^8\) bits per second. Maximum segment length \(500\ m\), speed of the provocation media velocity is \(2 × 10^8\) meter per second. What is the minimum frame size in bits ?
View More Questions