Please help me solve this problem. Gate at zeal workbook

Question

Comments

As the name suggests in SJF scheduling, the job with the shortest burst time will be executed first. Hence, we assume the arrival time for all jobs to be 0ms and then the CPU schedule would be: P4, P1, P3, P2.

Now, all you need to do is calculate the completion time of all the processes and see how long one has to wait before it can be executed.

---

Thanks. So if arrival time is not given then we have to consider it to be zero for all processes.

Answer 1

Option B is wrong.

Since nothing about the arrival time is mentioned we will consider it to be zero.

Now that we use SJF, order of execution will be: p4 p1 p3 p2. So wait times will be 0, 3, 9, 16.

Answer 2

Option B is wrong, after calculating the Completion time values and the T.A.T, you can calculate the waiting time.

Since this is using SJF, the execution order will be: p4,p1,p3,p2

Process	Arrive Time	Burst Time	Completion Time	Turn Around Time	Waiting time
A	0	6	9	9	3
B	0	8	18	18	10
C	0	7	16	16	9
D	0	3	3	3	0