Consider a uniprocessor system with n processes in the ready queue. Round…
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process requires kx seconds to complete and context switch takes 0 seconds. At what time the first process will complete the execution?
- A.
nkx
- B.
k(nx-1)
- C.
k(nk+n)
- D.
x(nk-n+1)
Attempted by 98 students.
Sign up free to check your answer
Sign up freeLoading lesson…

