Question

Consider that five processes P0, P2, …, P4 arrive for execution at the times indicated in Table 1. No more processes will arrive until the last process completes. All jobs are completely CPU bound. All times are given in seconds. Table 1: Process arrival times Note: The values of burst time are taken from your registration number i.e. if your registration number is 12345 then the Burst time for process P0 will be 1, for P1 it will be 2 and so on, if your registration number is of six digits i.e. 123456 then Burst time for the first process P0 will be 12, for P1 it will be 3 and so on, i. Determine the values of Burst time based on the above instructions. [01 Marks] ii. Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: [03 Marks] • First Come First Serve • Preemptive Shortest Job First; • Non-Preemptive Shortest Job First; iii. Determine the average turnaround time of each process for each of these three scheduling algorithms? [1.5 Marks] iv. Determine the average waiting time of each process for each of these three scheduling algorithms?

Answer 1

Answer:

computer please follow

me