edited by
417 views
0 votes
0 votes
The arrival time, burst time and priorities of five processes are given as:

$\begin{array}{|c|c|c|c|} \hline \text{Process} & \text{Arrival Time} & \text{Burst time} & \text{Priority} \\ {} & {} & \text{(in minutes)} & {} \\ \hline P & 0 & 2 & 3 \\ \hline Q  & 0 & 4 & 5 \\ \hline R & 0 &  6 & 2 \\ \hline S & 0 & 8 & 1 \text{(highest priority)} \\ \hline T & 0 & 10 & 4 \\ \hline \end{array}$

For the priority scheduling algorithm  the average response time is ________ minutes .  Ignore the context switching overhead.
edited by

1 Answer

Best answer
2 votes
2 votes
  • S       R      P        T       Q

          0       8      14       16      26      30


average response time

= (0+ 8+ 14+ 16+ 26)/ 5

= 64/5

= 12.8

selected by
Answer:

Related questions

2 votes
2 votes
3 answers
1
Bikram asked Dec 26, 2016
1,109 views
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns.The ...
1 votes
1 votes
1 answer
3