Computer Science · Operating Systems
Calculate the average response time for five processes P1, P2, P3, P4, and P5 using a non-preemptive priority scheduling algorithm. Assume all processes arrive at time 0, and lower priority numbers represent higher priority. The burst times and priorities are given below: Process | Burst Time | Priority P1 | 5 ms | 3 P2 | 3 ms | 1 P3 | 2 ms | 5 P4 | 3 ms | 4 P5 | 1 ms | 2
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 15.6 ms✓
- 25.2 ms
- 34.7 ms
- 43.8 ms
Correct answer
5.6 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