retagged by
6,405 views
5 votes
5 votes

Consider the following set of processes, with arrival times and the required CPU-burst times given in milliseconds.

$\begin{array}{|l|l|l|l|} \hline \textbf{Process} & \textbf{Arrival time} & \textbf{Burst Time} \\\hline \text{P1} & \text{0} & \text{4} \\\hline \text{P2} & \text{2} & \text{2} \\\hline \text{P3}& \text{3} & \text{1} \\\hline   \end{array}$

What is the sequence in which the processes are completed? Assume round robin scheduling with a time quantum of $2$ milliseconds?

  1. $\text{P1, P2, P3}$
  2. $\text{P2, P1, P3}$
  3. $\text{P3, P2, P1}$
  4. $\text{P2, P3, P1}$
retagged by

2 Answers

Best answer
15 votes
15 votes
0-2 2-4 4-6 6-7
p1 p2 p1 p3

answer B)- P2, P1, P3

selected by
2 votes
2 votes
0----------P1----------2----------P2----------------4-------------P3-----------5----------------P1----------------7

Answer D)
Answer:

Related questions

5 votes
5 votes
7 answers
1
4 votes
4 votes
2 answers
2
makhdoom ghaya asked May 2, 2016
3,988 views
A starvation free job scheduling policy guarantees that no job indefinitely waits for a service. Which of the following job scheduling policies is starvation free?Priorit...
3 votes
3 votes
1 answer
3
makhdoom ghaya asked May 2, 2016
7,740 views
A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given 'n' processes to be scheduled on one processor, how many possible diffe...