Calculate and display the average waiting time by dividing the total waiting time by the number of processes.

Also calculate the total turnaround time (tat + tat + ….

Calculate the total waiting time (wt + wt + ….

Print the process, burst time, waiting time, and turn around time.

Calculate the turnaround time ,tat =wt +bt outside the second loop and but inside the first loop.

Inside the first loop, run a second loop with j=0.

Use Bubble Sort to sort the burst time and process in ascending order.

Allow the user to input burst time for each process.

Get the total number of processes from the user.

Next we will calculate the waiting time and turnaround time and as well as we will find the average waiting time and the average turnaround time.

After that we will use the bubble sort algorithm to sort the burst time and its corresponding process in ascending order. Here we will see how we will implement SJF(Shortest Job First) scheduling algorithm in C language. First, we will ask the user to enter the total number of processes and ask them to enter the burst time for each process.

Waiting time is the total time taken by the process in the ready queue before it is assigned to the CPU(Central Processing Unit). One of the main advantages is that the SJF gives the lowest average waiting time. In SJF, the process which has the shortest execution time will be chosen. Burst Time is the time required by a process for its execution. Here the process is scheduled based on their burst time. In this article, we will see how we can implement sjf scheduling algorithm in C language.

Process scheduling program in c