Computer Science · Operating Systems
Consider the following five processes with their burst times and priorities (a lower priority number indicates a higher priority). Assume all processes arrive at time t = 0 in the order P1, P2, P3, P4, P5. Using a non-preemptive priority scheduling algorithm, what is the average waiting time? Process | Burst Time | Priority P1 | 10 | 3 P2 | 1 | 1 P3 | 2 | 4 P4 | 1 | 5 P5 | 8 | 2
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 110.0
- 27.6
- 36.8
- 48.2✓
Correct answer
8.2
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