The table below shows a list of processes P1 to P4 with their arrival times as well as their execution times. Use it to answer the following questions. Clearly show your workings.ProcesseArrival TimeBurst TimeP13 ms5 msP20 ms4 msP34 ms2 msP45 ms4 msUsing the First Come First Serve scheduling algorithm,calculate the average waiting time of the processes.Using time of the Shortest Remaining Time First (SRTF) scheduling algorithm, calculate the average waiting time of the processes.Using Shortest Job First (SJF) algorithm, calculate the average turn-around time for the processes.

In FCFS, the process which arrive first will be the one to get processed and exit first. It's non…

Answered: scheduling algorithm,calculate the…

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

Related questions

Question

The table below shows a list of processes P1 to P4 with their arrival times as well as their execution times. Use it to answer the following questions. Clearly show your workings.

Using the First Come First Serve scheduling algorithm,calculate the average waiting time of the processes.
Using time of the Shortest Remaining Time First (SRTF) scheduling algorithm, calculate the average waiting time of the processes.
Using Shortest Job First (SJF) algorithm, calculate the average turn-around time for the processes.

Expert Solution