288 views
0 votes
0 votes

Consider four process all are arriving at time zero, with total execution time of 20, 10, 10 and 20 unit respectively. Each process spends the first 20% of execution time doing CPU, the next 60% of doing I/O computation and the last 20% of time doing CPU computation again. The operating system uses longest time first scheduling algorithm and schedules a new process either when running process get blocked I/O or when the running process finishes its CPU burst. Assume that are I/O operations can be overlapped as much as possible. What is the average completion time of the system (in unit)?
[Note: When same burst occurs for multiple process high priority given to lowest process id] (upto one decimal place)

  • 24.5
  • 23.5
  • 25.5

None of these

MY ANSWER IS 24.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
Nam14 asked Apr 5, 2023
514 views
Please read below passage from 10th edition Operating System Concepts, pg. 202:5.1.3 Preemptive and Nonpreemptive SchedulingCPU-scheduling decisions may take place under ...
0 votes
0 votes
3 answers
3
Chaitanya Kale asked Sep 22, 2022
632 views
If we are using non-preemptive CPU scheduling then can there be process state transition from running to ready state?
1 votes
1 votes
1 answer
4
iarnav asked Jan 12, 2022
386 views
Does non preemptive CPU scheduling needs hardware support.kindly explain.