Computer Science · Operating Systems
निम्नलिखित पांच प्रक्रियाओं (processes) पर उनके बर्स्ट समय (burst time) और प्राथमिकताओं (priority) के साथ विचार करें (एक निचली प्राथमिकता संख्या उच्च प्राथमिकता को दर्शाती है)। मान लें कि सभी प्रक्रियाएं समय t = 0 पर P1, P2, P3, P4, P5 के क्रम में आती हैं। एक गैर-पूर्वव्यापी प्राथमिकता निर्धारण एल्गोरिदम (non-preemptive priority scheduling algorithm) का उपयोग करते हुए, औसत प्रतीक्षा समय (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✓
सही उत्तर देखें
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