14,290 views
5 votes
5 votes

Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below:

Process Priority Arrival Time (in ms) CPU Time Needed Priority
P1 0 10 5
P2 0 5 2
P3 2 3 1
P4 5 20 4
P5 10 2 3

(smaller the number, higher the priority)

If the CPU scheduling policy is priority scheduling without pre-emption, the average waiting time will be

  1. 12.8 ms
  2. 11.8 ms
  3. 10.8 ms
  4. 09,8 ms

2 Answers

Best answer
12 votes
12 votes

Answer C

Process Arrival Time(AT) Burst Time(BT) Completion Time(CT) Turn Around Time(TAT) Waiting Time(WT)
P1 0 10 40 40 30
P2 0 5 5 5 0
P3 2 3 8 6 3
P4 5 20 28 23 3
P5 10 2 30 20 18
          total=54/5=10.8ms
selected by
1 votes
1 votes

As per the request of gant chart and more explaination about this question i m give this solution

Answer:

Related questions

5 votes
5 votes
3 answers
1
go_editor asked Jun 14, 2016
2,518 views
The correct matching of the following pairs is$\begin{array}{|l|l|l|l|} \hline \text{A.} & \text{Disk check} & \text{i.} & \text{Round robin} \\\hline \text{B.}& \text{B...
9 votes
9 votes
2 answers
2
go_editor asked Jun 13, 2016
5,845 views
The performance of Round Robin algorithm depends heavily onsize of the processthe I/O bursts of the processthe CPU bursts of the processthe size of the time quantum
3 votes
3 votes
3 answers
4
go_editor asked Jun 15, 2016
2,774 views
Process isA program in high level language kept on diskContents of main memoryA program in executionA job in secondary memory