# Use of SRTF for the execution question

#1

With the use of SRTF the execution of three processes is as follows, the process A is scheduled first and A has been running for 6 units of time, the process B is arrived process B ran for 2 units of time, later process C is arrived and completed running in 4 units of time. Find the minimum possible burst time of the process A and B.

#2

Easy and simple question. But bit tricky.

[A-6] [B-2] [C-4]

1st observation you can make is that in question they have given you the burst time of process C, which is equal to 4 and have asked only burst time of A and B.

2nd observation is that while B was being executed, C came and B had to stop just executing for only 2 units of time.

Now if Burst time of B would have been (2+4) = 6 then C couldn’t have replaced B, but in question it is given that C has replaced B. So minimum possible Burst Time of B is (6+1) = 7

Now if Burst time of A would have been (6+7) = 13 then B couldn’t have replaced A, but in question it is given that B has replaced A. So minimum possible Burst Time of B is (13+1) = 14

So minimum possible burst time of A & B are 14 and 7 respectively.

#3