8.Write program to implement SJF scheduling algorithm

Write program to implement SJF scheduling algorithm (IF Arrival time is 0)

//cskecode

#include<iostream>

#include<stdio.h>

using namespace std;

class sjf

{      

public:

int burst_tm,arv_tm,wait_tm,temp;

char pid;

};

int main()

{

int n,sum=0,carry;

cout<<"Enter the no. of processes:\n";

cin>>n;

sjf temp;

sjf *f=new sjf[n];

for( int i=0;i<n;i++)

{

cout<<"Enter the process id:\n";

cin>>f[i].pid;

cout<<"Enter the burst timing:\n";

cin>>f[i].burst_tm;

cout<<"Enter the arrival timing:\n";

cin>>f[i].arv_tm;

}

int k=0,flag=1;

while(k!=0)

{

if(f[k].arv_tm==0)

{

flag=0;

break;

}

k++;

}

if(!flag)

{

cout<<"enter all values of arival time as no arrival time is 0\n";

return 1;

}

for(k=0;k<n;k++)

{

temp=f[k];

for(int i=k+1;i<n;i++)

{

if(temp.burst_tm>f[i].burst_tm)

{

temp=f[i];

f[i]=f[k];

f[k]=temp;

}

}

}

cout<<"Entered info is as follows:\n";

float avg_wait_tm=0,avg_around_tm=0;

for(k=0;k<n;k++)

{                                            

f[k].wait_tm=sum-f[k].arv_tm;

if(f[k].wait_tm<0)

f[k].wait_tm=0;

if(f[k].arv_tm>(f[k-1].burst_tm+f[k-1].arv_tm))

{

carry=f[k].arv_tm-sum;

sum+=(f[k].burst_tm+carry);

}

else

sum+=f[k].burst_tm;

avg_wait_tm+=f[k].wait_tm;

avg_around_tm+=f[k].wait_tm+f[k].burst_tm;

}

avg_around_tm/=n;

avg_wait_tm/=n;

for(k=0;k<n;k++)

{

cout<<"pid: "<<f[k].pid<<endl<<"Burst time: "<<f[k].burst_tm<<endl<<"arrival time: "<<f[k].arv_tm<<endl<<"Waiting time: "<<f[k].wait_tm<<endl;

cout<<"This is my Blog: ducskecode.blogspot.com" \n";

}

cout<<"average turn around time:\n"<<avg_around_tm<<endl<<"average waiting time:\n"<<avg_wait_tm<<endl;

return 0;

}

Output: