Consider the following set of processes with the length of the-07681
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: <table border="1" cellpadding="1" cellspacing="1" style="width:100%"><tr><th>Process</th><th>Burst Time</th><th>Priority</th></tr><tr><td>P1</td><td>10</td><td>3</td></tr><tr><td>P2</td><td>1</td><td>1</td></tr><tr><td>P3</td><td>2</td><td>3</td></tr><tr><td>P4</td><td>1</td><td>4</td></tr><tr><td>P5</td><td>5</td><td>2</td></tr></table><br> Assume that P1 is at the head of the ready queue and P5 is at the tail, and ignore the time for changing inter-processes. Using Round Robin scheduling algorithm (where the quantum q= 1ms) which is the average turnaround time?
This multiple choice question (MCQ) is related to the book/course
vu cs604 Operating Systems.
It can also be found in
vu cs604 Final Term - Quiz No.13.
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Assume that P1 is at the head of the ready queue and P5 is at the tail, and ignore the time for changing inter-processes. Using Round Robin scheduling algorithm (where the quantum q= 1ms) which is the average turnaround time?
| Process | Burst Time | Priority |
|---|---|---|
| P1 | 10 | 3 |
| P2 | 1 | 1 |
| P3 | 2 | 3 |
| P4 | 1 | 4 |
| P5 | 5 | 2 |
Assume that P1 is at the head of the ready queue and P5 is at the tail, and ignore the time for changing inter-processes. Using Round Robin scheduling algorithm (where the quantum q= 1ms) which is the average turnaround time?
tav = 12ms
tav = 9.2ms
tav = 7ms
tav = 10.8ms
