Computer Sciences > GATE 2024 Set-2 > CPU Scheduling
Consider a single processor system with four processes A, B, C, and D, represented as given below, where for each process the first value is its arrival time, and the second value is its CPU burst time.
A(0,10), B(2,6), C(4,3), and D(6,7).
Which one of the following options gives the average waiting times when preemptive Shortest Remaining Time First (SRTF) and Non-Preemptive Shortest Job First (NP-SJF) CPU scheduling algorithms are applied to the processes?
A(0,10), B(2,6), C(4,3), and D(6,7).
Which one of the following options gives the average waiting times when preemptive Shortest Remaining Time First (SRTF) and Non-Preemptive Shortest Job First (NP-SJF) CPU scheduling algorithms are applied to the processes?
Correct : b
Similar Questions
Consider the following statements about process state transitions for a system using preemptive scheduling.
I. A running process can move to ready state.
II....
Which of the following CPU scheduling algorithm can potential cause starvation?
Which of the following statement(s) is/are correct in the context of CPU scheduling?
Total Unique Visitors
Loading......