Operating System - CPU Scheduling

Avatto > > GATE COMPUTER SCIENCE > > Practice Questions > > Computer Science And Information Technology > > Operating System > > CPU Scheduling

Consider 3 processes that start simultaneously. Each process from start to finish takes 40, 50, and 60 ms respectively. Of this, the first 20% of the time is spent waiting for 10 events and the next 80% time for computation

6. For the data given above, the schedule length is ________ assuming SRTF scheduling algorithm

Answer
Comment
Array

Option : B
Explanation :

7. Shortest Remaining Time first algorithm is not practical
Its time complexity is huge, which makes it unsuitable for real systems
It requires knowledge of the burst time, which can be easily predicted

Answer
Comment
Array

Option : D
Explanation :

Consider three process P1, P2, and P3 with arrival time (0, 1, 3) and burst time (6, 5, 4) respectively, what is the order of completion in SJF and RR scheduling with time sice of 2 units

8. Order of completion in SJF scheduling

Answer
Comment
Array

Option : D
Explanation :

Consider three process P1, P2, and P3 with arrival time (0, 1, 3) and burst time (6, 5, 4) respectively, what is the order of completion in SJF and RR scheduling with time sice of 2 units

9. Order of completion in RR scheduling

Answer
Comment
Array

Option : D
Explanation :

10. Professor X suggests a method to alleviate starvation in scheduling algorithms. Under the new scheme, processes get a priority number. The priority of the process is considered by the scheduling algorithm when scheduling. The new scheme will alleviate starvation

Answer
Comment
Array

Option : B
Explanation :