edited by
196 views
2 2 votes

Consider the following set of processes assumed to have arrived at time $0$ in order $P_{1}, P_{2}, P_{3}, P_{4}$ and $P_{5}$ with the length of CPU burst given in Milliseconds.

ProcessBurst TimePriority
$P_1$$10$$3$
$P_2$$1$$1$
$P_3$$2$$4$
$P_4$$1$$5$
$P_5$$5$$2$

What is the average waiting time (in milliseconds) using priority scheduling.

  1. $8$
  2. $8.2$
  3. $8.3$
  4. $8.4$

1 Answer

0 0 votes

$\text{Turnaround time:}$ The interval from the time of submission of a process to the time of completion is the turnaround time. Turnaround time is the sum of the periods spent waiting to get into memory, waiting in the ready queue, executing on the CPU,and doing I/O.

.$\boxed{\text{Turnaround time = Completion time - Arrival time}}$

$\text{Waiting time:}$ Waiting time is the sum of the periods spent waiting in the ready queue.

$\boxed{\text{Waiting time = Turnaround time - Burst time}}$

 

 

Answer:
Position:
Show:

Related questions

1 1 vote
0 0 answers
206
206 views
Shubham Sharma 2 asked Sep 10, 2025
206 views
Consider the following set of processes with the arrival time and length of CPU Burst time given in milli-seconds ( $\mathrm{ms}$):$\begin{array}{|c|c|c|} \hline \textbf{...
1 1 vote
1 answers 1 answer
907
907 views
Bikram asked Dec 26, 2016
907 views
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} & \te...
3 3 votes
1 1 answer
149
149 views
Shubham Sharma 2 asked Apr 19
149 views
Consider a disk queue with requests for I/O to blocks on cylinders $98,183,37,122,14,124,65,67$ in that order. If the disk head is initially at cylinder $53$. Using SSTF ...
1 1 vote
1 1 answer
183
183 views
Shubham Sharma 2 asked Apr 19
183 views
Match the LIST-I with LIST-IILIST-ILIST-IIA.Short term schedulerI.Determine which process are added to the system for execution level place them in ready queueB.Medium te...