Process ID |
Arrival Time |
Burst Time |
1 |
3 |
2 |
2 |
4 |
6 |
3 |
6 |
8 |
4 |
1 |
7 |
5 |
5 |
1 |
6 |
2 |
3 |
Above table shows the processes to be scheduled in a single CPU system and some non pre-emptive scheduling algorithm used(no context switching overhead).
1. What is probability that Average Turn around time(TAT) is minimum.
2. What is probability that Average waiting time(WT) is minimum.
3. What is probability that WT time is minimum for process P3.
4. Calculate the minimum values for 1,2,3