A First Come First Serve Program by C#ODE Studio –
Discription –
#include"iostream" using namespace std; int main(){ float n; float pid[10]; float pbt[10]; float pat[10]; cout<<"Enter number of elements : "; cin>>n; int i,x; float t; for(i=0;i<n;i++){ cout<<"Enter id : "; cin>>pid[i]; cout<<"Enter burst time : "; cin>>pbt[i]; cout<<"Enter arrival time : "; cin>>pat[i]; } for(i=0;i<n;i++) for(x=0;x<n;x++){ if(pat[x]>pat[i]){ t=pid[x]; pid[x]=pid[i]; pid[i]=t; t=pat[x]; pat[x]=pat[i]; pat[i]=t; t=pbt[x]; pbt[x]=pbt[i]; pbt[i]=t; } } cout<<"Process id \t Burst Time \t Arrival Time"; for(i=0;i<n;i++){ cout<<endl<<"\t"<<pid[i]<<"\t\t"<<pbt[i]<<"\t\t"<<pat[i]; } float wt[10]; wt[0]=0; float awt=0; int j; for(j=1;j<n;j++) { wt[j]=wt[j-1]+pbt[j-1]; awt=awt+wt[j]; } awt=awt/n; cout<<endl<<"Average waiting time : "<<awt; cout<<endl<<endl<<"PROGRAMMING AT C#ODE STUDIO"; }