Question:
Processes \( P_1, P_2, P_3, P_4 \) arrive in that order at times 0, 1, 2, and 8 milliseconds
respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively.
Shortest Remaining Time First (SRTF) algorithm is used as the CPU scheduling
policy. Ignore context switching times.
Which ONE of the following correctly gives the average turnaround time of the four
processes in milliseconds?
Processes \( P_1, P_2, P_3, P_4 \) arrive in that order at times 0, 1, 2, and 8 milliseconds
respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively.
Shortest Remaining Time First (SRTF) algorithm is used as the CPU scheduling
policy. Ignore context switching times.
Which ONE of the following correctly gives the average turnaround time of the four
processes in milliseconds?
Show Hint
Shortest Remaining Time First (SRTF) scheduling preempts the currently executing process if a newly arrived process has a shorter remaining execution time. Calculating turnaround time requires tracking completion times carefully.
Updated On: Jan 30, 2026
- 22
- 15
- 37
- 19
Show Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
To determine the average turnaround time using the Shortest Remaining Time First (SRTF) algorithm, we analyze the execution of processes:
- Arrival Times: \( P_1 = 0 \), \( P_2 = 1 \), \( P_3 = 2 \), \( P_4 = 8 \)
- Burst Times: \( P_1 = 10 \), \( P_2 = 13 \), \( P_3 = 6 \), \( P_4 = 9 \)
Step-by-step execution:
- P1 starts at \( t = 0 \).
- P2 arrives at \( t = 1 \), but since P1 has a shorter remaining time, it continues.
- P3 arrives at \( t = 2 \) with a shorter burst time (6), so it preempts P1.
- P3 finishes at \( t = 8 \).
- P4 arrives at \( t = 8 \), but has a longer remaining time than P1, so P1 resumes.
- P1 completes at \( t = 12 \).
- P2 executes next, followed by P4.
Turnaround Times:
- TAT(P1) = 12 - 0 = 12
- TAT(P2) = 26 - 1 = 25
- TAT(P3) = 8 - 2 = 6
- TAT(P4) = 35 - 8 = 27
Average Turnaround Time:
\[
\frac{12 + 25 + 6 + 27}{4} = \frac{70}{4} = 19
\]
Thus, the correct answer is (D) 19.
Was this answer helpful?
0
0
Top GATE CS Operating System Questions
- With respect to deadlocks in an operating system, which of the following statements is/are FALSE?
- Consider a system consisting of \(k\) instances of a resource \(R\), being shared by 5 processes. Assume that each process requires a maximum of two instances of resource \(R\) and a process can request or release only one instance at a time. Further, a process can request the second instance of the resource only after acquiring the first instance.The minimum value of \(k\) for the system to be deadlock-free is __________. (answer in integer)
- Consider a hard disk with a rotational speed of 15000 rpm. The time to move the read/write head from a track to its adjacent track is 1 millisecond. Initially, the head is on track 0. The number of sectors per track is 400. The sector size is 1024 bytes. It is necessary to transfer data from 10 randomly located sectors in each of the following tracks in the order: 5, 12 and 7. The total time for the data transfer (in milliseconds) from the hard disk is _________. (rounded off to one decimal place)
- Consider the following program snippet. Assume that the program compiles and runs successfully. Further, assume that the fork() system call is always successful in creating a process.
int main () { int i; for (i = 0; i < 3; i++){ if (fork() == 0){ continue; } break; } printf("Hello!"); return 0; }The total number of times that the printf statement gets executed is ________. - Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst of 8 seconds. A new process of type A arrives at time \(t = 10, 20, 30, 40,\) and \(50\) (in seconds). Similarly, a new process of type C arrives at time \(t = 11, 22, 33, 44,\) and \(55\) (in seconds). The CPU scheduling policy is First Come First Serve (FCFS). The first process of type A starts running at \(t = 10\) seconds. The average waiting time (in seconds) for the 10 processes is ___________.(Rounded off to one decimal place)
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