Answer to Question #180034 in Programming & Computer Science for krisha

Question

Consider the following table of arrival time and burst time for three processes P0, P1 and P2.

PROCESS

ARRIVAL TIME

BURST TIME

P0

0ms

9ms

P1

1ms

4ms

P2

2ms

9ms

The preemptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?

Answer 1

Dear krisha, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order