There are 3 tasks P1, P2, and P3. The arrival time and duration of each task is given below. Apply the round-robin scheduling algorithm with quantum…
There are 3 tasks P1, P2, and P3. The arrival time and duration of each task is given below. Apply the round-robin scheduling algorithm with quantum size-20 to schedule the tasks in a single core machine. Calculate the turnaround time for each task. (All tasks have the same priority)
| Task | Arrival time (ms) | Duration (ms) |
| P1 | 0 | 40 |
| P2 | 5 | 40 |
| P3 | 10 | 20 |
From the BPSC Network/Website Manager (CSE) May 2025 – Written exam, question 6 of 16.
More from this paper
- Previous: Write down the pseudocode for the recursive binary search algorithm. Use the following function definition: binarySearch (array, target…
- Next: Find the network address, subnet mask, broadcast address, and usable host IP range for the following IP address: 192.9.205.31/16.
- All questions in BPSC Network/Website Manager (CSE) May 2025 – Written