Mathematics · CPU Scheduling Algorithms
Consider four processes with arrival times and CPU burst times as follows: P1: Arrival = 0, Burst = 10 P2: Arrival = 2, Burst = 6 P3: Arrival = 3, Burst = 1 P4: Arrival = 5, Burst = 3 What are the waiting time of process P3 and the average turnaround time for First-Come First-Served (FCFS) CPU scheduling?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 12 and 13.25
- 28 and 13.25
- 310 and 13.25
- 413 and 13.25✓
Correct answer
13 and 13.25
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 Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice CPU Scheduling Algorithms MCQs →Want more practice questions on CPU Scheduling Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · CPU Scheduling Algorithms