Ace Test Series | Operating System | Scheduling

Question

Given a system using Round Robin scheduling, assuming it can perform a context- switch in zero time. Each process is allowed to run only one instruction before the next instruction is allocated to the CPU. The ready queue always contains n-processes. If a process takes 't' seconds to execute in a uni-processing environment, how long will it take to execute on this system?

1. n+t
2. n*t
3. n/t
4. (n^2)t

Comments

@Sachin Mittal 1 sir, in the above question, shouldn’t we consider a time quantum ‘q’ while solving as they are using RR scheduling algo??

 

Answer 1

The answer should be $B$) $n \times t$.

But an accurate answer would be $(n \times t) – q(n-1)$ where $n \times t$ is the total execution time for all ‘$n$’ processes, $q(n-1)$ is the time to execute $one$ round for the remaining $n-1$ processes where $q$ is the time quantum.