Mathematics · Aptitude - Scheduling Algorithms
Four tasks (a, b, c, d) arrive at time 0 ms with CPU burst times of 4 ms, 1 ms, 7 ms, and 2 ms respectively. If Round-Robin scheduling is used with a time quantum slice of 1 ms, and the ready queue order at arrival is a-b-c-d, what is the completion time of task 'a'?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 110 ms✓
- 24 ms
- 37 ms
- 411 ms
Correct answer
10 ms
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 Aptitude - Scheduling Algorithms MCQs →Want more practice questions on Aptitude - Scheduling Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Aptitude - Scheduling Algorithms