Mathematics · Operating Systems
Consider the following processes with their arrival times and burst times: Process P0: Arrival Time = 0, Burst Time = 7 Process P1: Arrival Time = 2, Burst Time = 4 Process P2: Arrival Time = 4, Burst Time = 1 Process P3: Arrival Time = 5, Burst Time = 4 What is the average waiting time using the Preemptive Shortest Job First (SRTF) algorithm?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 13✓
- 24
- 35
- 46
Correct answer
3
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 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 Mathematics · Operating Systems