recategorized by
13,079 views
28 votes
28 votes

Assume that  the following jobs are to be executed on a single processor system$$\begin{array}{|c|c|} \hline  \textbf{Job Id} & \textbf{CPU Burst Time} \\\hline \text{p} & 4 \\\hline  \text{q} & 1 \\\hline \text{r} & 8 \\\hline \text{s} & 1 \\\hline \text{t} & 2 \\\hline \end{array}$$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
recategorized by

3 Answers

Best answer
32 votes
32 votes
Answer: (C)

Execution order: $p\;q\;r\;s\;t\;p\;r\;t\;p\;r\;\mathbf{p}\;r\;r\;r\;r\;r$
edited by
7 votes
7 votes

Round Robin

TQ=1

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

Answer:

Related questions

23 votes
23 votes
5 answers
1
32 votes
32 votes
2 answers
2
Kathleen asked Sep 29, 2014
13,138 views
The root directory of a disk should be placedat a fixed address in main memoryat a fixed location on the diskanywhere on the diskat a fixed location on the system diskany...
25 votes
25 votes
4 answers
4
Kathleen asked Sep 29, 2014
5,674 views
Write a concurrent program using $\text{parbegin-parend}$ and semaphores to represent the precedence constraints of the statements $S_1$ to $S_6$, as shown in figure belo...