answer is d

The Gateway to Computer Science Excellence

+6 votes

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

Process | Arrival Time | Burst Time |

P1 | 0 | 4 |

P2 | 2 | 2 |

P3 | 3 | 1 |

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

- $P1, P2, P3$
- $P2, P1, P3$
- $P3, P2, P1$
- $P2, P3, P1$

+13 votes

+2 votes

0----------P1----------2----------P2----------------4-------------P3-----------5----------------P1----------------7

Answer D)

Answer D)

+11

I think You are not looking at the arrival time of p3 .... so acc. to me after 2 ms p2 is staring and p1 is getting scheduled in ready queue and at 3ms p3 arrives so it will be scheduled in ready queue after q1 and then at 4ms p2 is over and p1 gets CPU and then at 6ms p1 is over and p3 gets CPU.

p2--p1--p3

So ans should be option B.

p2--p1--p3

So ans should be option B.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,324 answers

198,404 comments

105,169 users