Schedule the following set of jobs using First Come First Service Basis.

Consider the following set of processes with the length of CPU  burst time and arrival time given in milliseconds.
 Illustrate the execution of these process using FCFS CPU Scheduling algorithems. Also calculate wait timeand turn around timeof each process and calculate average waiting time and average turn around time for above situation. Also draw a gantt chart.

First Come first service scheduling
Now calculate average wait time 
Average Wait time =10/4=2.5
average turn around time=22/4=5.5

Gantt Chart 
Gantt Chart of the first Come first Service algorithm


Feel free to contact the admin for any suggestions and help.