Computer Science · Operating Systems
Consider four processes with arrival times and CPU burst times given in milliseconds (ms): P1: Arrival Time = 0, Burst Time = 8 P2: Arrival Time = 1, Burst Time = 4 P3: Arrival Time = 2, Burst Time = 9 P4: Arrival Time = 3, Burst Time = 5 What will be the average waiting time for preemptive Shortest Job First (SRTF) and non-preemptive Shortest Job First (SJF) scheduling algorithms respectively?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 16.5 ms and 7.75 ms✓
- 26.00 ms and 7.00 ms
- 39.25 ms and 10.20 ms
- 47.25 ms and 8.21 ms
Correct answer
6.5 ms and 7.75 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