Computer Science · Operating Systems
Consider the following table of arrival time and burst time for three processes P0, P1, and P2: ProcessArrival TimeBurst TimeP00 ms7P11 ms3P22 ms7 If the pre-emptive Shortest Job First (SRTF) scheduling algorithm is used, what is the average waiting time for the three processes?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 14 ms✓
- 24.47 ms
- 33.67 ms
- 43 ms
Correct answer
4 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
Start Free Mock Test →Preparing for Computer Science?
Practice full-length 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