• retagged by
9,521 views
10 10 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}$

4 Answers

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

answer B)- P2, P1, P3

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

Answer D)
Answer:
Position:
Show:

Related questions

8 8 votes
7 answers 7 answers
8.6k
8.6k views
Misbah Ghaya asked May 13, 2016
8,620 views
Which of the following strategy is employed for overcoming the priority inversion problem?Temporarily raise the priority of lower priority level processHave a fixed prior...
6 6 votes
2 2 answers
5.6k
5.6k views
Misbah Ghaya asked May 2, 2016
5,569 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...
4 4 votes
2 answers 2 answers
9.6k
9.6k views
Misbah Ghaya asked May 2, 2016
9,649 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...
0 0 votes
0 0 answers
305
305 views
Suleiman_Rock'n_Roll asked Feb 3
305 views
I want to understand how will priority scheduling + round robin for ties will prevent indefinite blocking?