Computer Science · Operating Systems
Consider the following processes scheduled for execution using the Preemptive Shortest Job First (SRTF) scheduling algorithm:
Find the average waiting time for these processes.
| Process | Arrival Time | Burst Time |
|---|---|---|
| P0 | 0 | 8 |
| P1 | 1 | 4 |
| P2 | 2 | 9 |
| P3 | 3 | 5 |
Find the average waiting time for these processes.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 15.2 ms
- 25.6 ms
- 36.5 ms✓
- 46.2 ms
Correct answer
6.5 ms
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Operating Systems MCQs →Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems