Mathematics · Operating Systems Calculations
Consider three processes with CPU burst times given in milliseconds: Process | Arrival Time | Burst Time P1 | 0 | 8 P2 | 1 | 4 P3 | 2 | 9 What is the average waiting time for these processes if they are scheduled using the Preemptive Shortest Job First (SRTF) scheduling algorithm?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 16.00 ms
- 24.66 ms✓
- 32.66 ms
- 45.60 ms
Correct answer
4.66 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 Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Operating Systems Calculations MCQs →Want more practice questions on Operating Systems Calculations?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Operating Systems Calculations