edited by
5,114 views
2 votes
2 votes

Consider the following set of processes with the length of CPU burst time in milliseconds (ms) $:$

$\begin{array}{|l|l|l|l|l|l|l|} \hline  \textbf{Process} & \text{A} & \text{B} & \text{C} & \text{D} & \text{E} \\\hline \textbf{Burst time} & \text{6} &\text{1} & \text{2} & \text{1} & \text{5} \\\hline \textbf{Priority} & \text{3} & \text{1} & \text{3} & \text{4} & \text{2} \\\hline  \end{array}$

Assume that processes are stored in ready queue in following order $:$

$\text{A – B – C – D – E}$

Using round robin scheduling with time slice of $1$ ms, the average turn around time is

  1. $8.4$ ms
  2. $12.4$ ms
  3. $9.2$ ms
  4. $9.4$ ms
edited by

1 Answer

2 votes
2 votes

ans will be A  8.4 ms 

Answer:

Related questions

2 votes
2 votes
1 answer
1
go_editor asked Jul 24, 2016
1,216 views
Match the following for Windows Operating System $:$$\begin{array}{} \text{(a)} & \text{Hardware} & \text{(i)} & \text{Starting all processes, emulation of different} \\...
1 votes
1 votes
1 answer
2
go_editor asked Jul 24, 2016
1,296 views
The portion of Windows 2000 operating system which is not portable isprocessor managementuser interfacedevice managementvirtual memory management