5 5 votes Consider a uniprocessor system with three processes $P_1, P_2$, and $P_3$ arriving at time $t=0$. Their burst times are $10,20 ,$ and $30$ units, respectively. The system uses a Round Robin scheduling algorithm with a time quantum of $5$ units. If the context switch overhead is $1$ unit (incurred every time a process is swapped out, including the last burst), what is the total completion time of the last process to finish? Operating System goclasses operating-system goclasses-cs-dpp goclasses-cs-dpp-day-204 goclasses-os-practice-questions numerical-answers + – GO Classes 260 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote Total Burst Time: $10+20+30=60$ units.Execution Order $($Quantum $=5):$$P_1(5), P_2(5), P_3(5)$ $P_1(5) \rightarrow P_1$ finishes, $P_2(5), P_3(5)$ $P_2(5), P_3(5)$ $P_2(5) \rightarrow P_2$ finishes, $P_3(5)$ $P_3(5), P_3(5) \rightarrow P_3$ finishes Context Switches: There are $11$ switches between processes plus $1$ final switch after the last process completes $(12$ total$)$.Total number of switches $=72$ GO Classes answered Feb 24 GO Classes comment Share Follow See 1 comment 1 1 comment reply Prince_Garg commented Feb 25 reply Follow flag But as it's not mention that "there were context switch with in process" by default there were only 9 context switches were there then by this the ans will be 69 0 0 replyShare Please log in or register to add a comment.
