392 views
0 votes
0 votes
Consider a process with a single CPU burst of 100 time units and a single disk I/O of 1000 time units at the end. If the timer interval is fifteen time units and the process scheduling algorithm is round-robin, at most how many times would the process enter the ready queue before entering the terminated state? Assume that there is a sufficiently large number of processes of similar nature trying to run on the CPU

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
vk_9_1_9 asked Jul 30, 2018
167 views
Not sure about option c, can anyone please explain the relation between bounded waiting and busy waiting? 1. Bounded waiting does not allow: (a) Starvation of a process (...
0 votes
0 votes
1 answer
2
vk_9_1_9 asked Jul 29, 2018
442 views
How to solve this when arrival time nd scheduling algorithm to use is not mentioned?1. Consider the processes P 1 , P 2 , P 3 arrived in the sequence P 2 , P 3 , P 1 and ...
1 votes
1 votes
0 answers
3
Akhilesh Singla asked Apr 14, 2018
1,704 views
I think options A, D and E are wrong; B is true. I'm not sure about C. I think it should be true because page table is created for a process and not for its threads so pa...