The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+14 votes

Assume that  the following jobs are to be executed on a single processor system

Job Id CPU Burst Time
$p$ $4$
$q$ $1$
$r$ $8$
$s$ $1$
$t$ $2$

The jobs are assumed to have arrived at time $0^+$ and in the order $p,q,r,s,t$. Calculate the departure time (completion time) for job $p$ if scheduling is round robin with time slice $1$

  1. $4$
  2. $10$
  3. $11$
  4. $12$
  5. None of the above
asked in Operating System by Veteran (59.6k points)
edited by | 1.4k views

What does 0indicates here ?

explain please ....

meaning of 0+ and in this question no arrival time is mention so how we apply any algorithms ?
It means all the 5 jobs are available in ready queue at the same time(t = 0),and in the queue, their arrival order is p,q,r,s,t.

whenever the arrival time of 2 or more jobs are same then pick them according to their order in the ready queue.

3 Answers

+18 votes
Best answer
Answer: (C)

Execution order: $pqrstprtpr\mathbf{p}rrrrr$
answered by Boss (34k points)
edited by
+5 votes
p will depart at t = 11
answered by Veteran (55.4k points)
edited by
+3 votes

Round Robin


Arrival time of all the process is same

gantt chart
 p  q    r   s   t   p  r  t  p  r  p
0 1 2 3 4 5 6 7 8 9 10     11

Answer - option c

answered by Active (3.8k points)

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

41,065 questions
47,661 answers
62,381 users