# GATE1993-7.10

3.2k views

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

edited
1

What does 0indicates here ?

1

meaning of 0+ and in this question no arrival time is mention so how we apply any algorithms ?
2
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.

Execution order: $pqrstprtpr\mathbf{p}rrrrr$

edited by
0
when all process arrives at 0 then it will work like FCFS with TQ=1???
0
Yes...for 1st iteration since nothing is mentioned so we give priority based on Job ID.

Even when the time quantum becomes too large then also Round Robin behaves like FCFS
p will depart at t = 11

edited

# Round Robin

TQ=1

Arrival time of all the process is same

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

## Related questions

1
12.8k views
Consider a system having m resources of the same type. These resources are shared by $3$ processes $A$,$B$, and $C$ which have peak demands of $3$, $4$ and $6$ respectively. For what value of m deadlock will not occur? $7$ $9$ $10$ $13$ $15$
A certain moving arm disk storage, with one head, has the following specifications: Number of tracks/recording surface $= 200$ Disk rotation speed $= 2400$ rpm Track storage capacity $= 62,500$ bits The average latency of this device is $P$ ms and the data transfer rate is $Q$ bits/sec. Write the values of $P$ and $Q$.
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 below.