PROCESS SCHEDULING

Experiment Number 1 : First Come First Serve

Algorithm

• Step 1: Input the processes along with their burst time (bt).

• Step 2: Find waiting time (wt) for all processes.

• Step 3: As first process that comes need not to wait so waiting time for process 1 will be 0 i.e. wt[0] = 0.

• Step 4: Find waiting time for all other processes i.e. for process i -> wt[i] = bt[i-1] + wt[i-1] .

• Step 5: Find turnaround time = waiting time + burst time for all processes.

• Step 6: Find average waiting time = total waiting time / no of processes.

• Step 7: Similarly, find average turnaround time = total turn-around time / no of processes.