Computer Science · Operating Systems
An operating system uses the Shortest Remaining Time First (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes: Process P1: Arrival Time = 0, Execution Time = 20 Process P2: Arrival Time = 15, Execution Time = 25 Process P3: Arrival Time = 30, Execution Time = 10 Process P4: Arrival Time = 45, Execution Time = 15 What is the total waiting time for Process P2?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 155
- 240
- 315
- 45✓
Correct answer
5
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