Algorithms
January 3, 2025GATE 2011
January 4, 2025Process-Scheduling
|
Question 1
|
Consider the following table of arrival time and burst time for three processes P0, P1 and P2.
The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?
|
5.0 ms
|
|
|
4.33 ms
|
|
|
6.33 ms
|
|
|
7.33 ms
|
Question 1 Explanation:
CT = Completion time
TAT = Turn Around Time
WT = Waiting Time
TAT = CT – AT
WT = TAT – BT
Gantt Chart using pre-emptive shortest job first scheduling algorithm,
Avg. WT = 4+0+11/3 = 5ns
Correct Answer: A
Question 1 Explanation:
CT = Completion time
TAT = Turn Around Time
WT = Waiting Time
TAT = CT – AT
WT = TAT – BT
Gantt Chart using pre-emptive shortest job first scheduling algorithm,
Avg. WT = 4+0+11/3 = 5ns