Computer Science · Operating Systems
प्रक्रियाओं (processes), उनके बर्स्ट समय (Burst Time) और आगमन समय (Arrival Time) के बारे में निम्नलिखित तालिका पर विचार कीजिए: प्रक्रियाबर्स्ट समयआगमन समयP190P2300P340P482P5116 गैर-प्रीएम्प्टिव (non-preemptive) SJF और राउंड रॉबिन (टाइम क्वांटम = 10) शेड्यूलिंग विधियों के संबंधित गैंट चार्ट (GANTT charts) के अनुसार कौन सी प्रक्रिया अंत से दूसरी (second last) समाप्त होगी?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1SJF: P5; RR: P5✓
- 2SJF: P4; RR: P3
- 3SJF: P5; RR: P4
- 4SJF: P4; RR: P4
सही उत्तर देखें
SJF: P5; RR: P5
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
Preparing for Computer Science?
Practice full-length Computer Science 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