CUET-PG SERIES Algorithms
Algorithm Design Techniques
1 previous year questions.
Volume: 1 Ques
Yield: Medium
High-Yield Trend
1
2023 Chapter Questions 1 MCQs
01
PYQ 2023
medium
algorithms ID: cuet-pg-
Consider the following table of arrival time and burst time for three process Po P1 and P2
| Process | Arrival Time | Burst Time |
| Po | 0 ms | 9 ms |
| P1 | 1 ms | 4 ms |
| P2 | 2 ms | 9 ms |
The preemptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of process. What is the average waiting time for the three process
1
5.0 ms
2
4.33 ms
3
6.33 ms
4
7.33 ms