Process scheduling in Operating system

Question

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

Comments

1. Turnaround Time = Completion Time - Arrival Time. It is the time between submission and completion .
2. The time processes spend in the Ready Queue Waiting their turn to get on the CPU.
3.  Find the waiting time for process 3.
4.  Find minimum value among these 3 values .

Order of arrival of three processes P1, P2, P3 each taking 5, 15, 10 seconds . The waiting time for P1 is 0 because it is the first process that has arrived.

P2 waits 5 seconds and P3 waits 5 + 15 = 20 seconds.

So the average waiting time is (0 + 5 + 20)/3 = 8.3 seconds.

---

which onr algo apply for scheduling?

---

sir, what is meaning of probabilty here,the AWT is minimum it is talking about which type of cpu scheduling algorithm that we can use to get minimum AWT.