0 votes 0 votes What should be less time consuming approach for such type of questions Operating System zeal operating-system process-scheduling zeal2019 + – Prince Sindhiya asked Oct 11, 2018 edited Mar 9, 2019 by ajaysoni1924 Prince Sindhiya 373 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Soumya29 commented Oct 11, 2018 reply Follow Share Best approach should be- 1. Option elimination 2. By writing equations Both will take less than a minute. But in this question, I am getting 14,7. No option matches. 0 votes 0 votes Prince Sindhiya commented Oct 11, 2018 reply Follow Share @Soumya answer given is 11,7 can u show your approach ? 0 votes 0 votes Soumya29 commented Oct 11, 2018 reply Follow Share Suppose burst times of A, B and C are $T_A,T_B,T_C$ respectively. According to ques.- $T_A = 6+x$. (Here $x$ is A's remaining time .) A ran for 6-time units and got preempted and B got CPU) This is possible only when $x > T_B$ Now, $T_B = 2+y$. (Here $y$ is B's remaining time .) B ran for 2-time units and got preempted and C got CPU) This is possible only when $y > T_C$ So we have- $T_C = 4\\T_B=2+y\\y >T_C \ so \ y >4\\T_A=6+x\\ x >T_B$ So minimum value of y can be 5 so minimum value of $T_B=2+5=7.$ Minimum value of x can be 8 so minimum value of $T_A=6+8=14$ 1 votes 1 votes MiNiPanda commented Oct 11, 2018 reply Follow Share If D is the correct option then TA-6 =5 and TB=7 (given) i.e. remaining time of A is less than B's BT. Then how could B have pre empted A? 0 votes 0 votes Magma commented Oct 11, 2018 reply Follow Share yes Non of the options are correct 0 votes 0 votes Please log in or register to add a comment.