Round_robin using structures

#include<iostream.h>
#include<conio.h>
struct pro
{
int t[50];          //time of each turn
int burst;          //burst time
int rem;            //rem time of process
int tc;             //time at which process is completed
int ti;             //for counting purpose
int c;              //set when process is completed
int tu;             //number of turns
float wait;         //total waiting time for that process
};
void main()
{     clrscr();
      struct  pro p[100];
      int n,count=0,time_slice,s;
      float avg_wait=0,total_wait=0;
      cout<<"enter number of processes "<<endl;
      cin>>n;
      cout<<"enter burst time of each process "<<endl;
      for(int i=0;i<n;i++)
      {
cin>>p[i].burst;
p[i].rem=p[i].burst;
p[i].c=0;
p[i].ti=0;
p[i].tu=0;
      }
      s=n;
      cout<<"enter time slice "<<endl;
      cin>>time_slice;
      while(s!=0)
      {
for(i=0;i<n;i++)
{
if(p[i].c==0)
{
if(p[i].rem<time_slice)
{
    count=count+p[i].rem;
    p[i].tc=count;
    p[i].t[p[i].ti]=p[i].rem;
   p[i].rem=0;
    p[i].tu++;
   p[i].ti++;

}
else
{    count=count+time_slice;
    p[i].tc=count;
    p[i].t[p[i].ti]=time_slice;
    p[i].rem=p[i].rem-time_slice;
    p[i].tu++;
    p[i].ti++;
}
if(p[i].rem==0)
{
p[i].c=1;
s--;
}
}
}  }

for(i=0;i<n;i++)
{       int temp=0;
for(int j=0;j<p[i].tu;j++)
{    temp=temp+p[i].t[j];

}
p[i].wait=p[i].tc-temp;
}
cout<<endl;
cout<<"process name\twaiting time\tturns "<<endl;
for(i=0;i<n;i++)
{
cout<<"p"<<i+1<<"\t\t\t"<<p[i].wait<<"\t"<<p[i].tu<<endl;
total_wait=total_wait+p[i].wait;
}
cout<<endl<<"total waiting time of all processes= "<<total_wait<<endl;
avg_wait=total_wait/n;
cout<<endl<<"average waiting time= "<<avg_wait;
getch();
      }

Round Robin Algorithm

#include<iostream>
using namespace std;
int main()
{
int n,i,ts,rp,t;
int twt=0,tat=0,f=0;
int bt[i],rt[i];
cout<<"Enter No of Process :";
cin>>n;
rp=n;
for(i=0;i<n;i++)
{
cout<<"Enter Burst time for Process"<<i<<": ";
cin>>bt[i];
rt[i]=bt[i];
}
cout<<"Enter Time Slice: ";
cin>>ts;
cout<<"\nP_NO\tB_Time\tW_time\tT_Time\n";
for(t=0,i=0;rp!=0;)
{
if(rt[i]>ts)
{
rt[i]-=ts;
t+=ts;
}
else if(rt[i]<=ts&&rt[i]>0)
{
t+=rt[i];
rt[i]=0;
f=1;
}

if(rt[i]==0&&f==1)
{
rp--;
cout<<"P"<<i<<"\t"<<bt[i]<<"\t"<<t-bt[i]<<"\t"<<t<<endl;
twt+=t-bt[i];

tat+=t;
f=0;
}
if(i==n-1)
i=0;
else
i++;
}
cout<<"\nTotal Waiting Time="<<twt<<"\t\t";
cout<<"Average Waiting time="<<twt/(float)n;
cout<<"\nTotal Turnaround Time="<<tat<<"\t";
cout<<"Average Turnaround Time="<<tat/(float)n;
return 0;
}

Shortest Job First (Non-PreEmptive)

/*Shortest Job First Scheduling Progrmam (Non-PreEmptive) */
#include<iostream>
using namespace std;
int main()
{
    int i,j,n,total=0,temp,ptemp;
    int wtime[10],btime[10],process[10];
    float avg=0;
    cout<<"\nEnter number of Processes: ";
    cin>>n;
    for(i=0;i<n;i++)
    {
    process[i]=i;
        cout<<"Enter P"<<i+1<<" Burst Time:";
        cin>>btime[i];
    }
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(btime[i]>btime[j])
            {
                temp=btime[i];
                btime[i]=btime[j];
                btime[j]=temp;
                ptemp=process[i];
                process[i]=process[j];
                process[j]=ptemp;
            }
        }
    }
        wtime[0]=0;
    for(i=1;i<n;i++)
    {
        wtime[i]=wtime[i-1]+btime[i-1];
        total=total+wtime[i];
    }
    avg=(float)total/n;
    cout<<"\nP_ID\tB_TIME\t W_TIME\n";
    for(i=0;i<n;i++)
        cout<<process[i]+1<<"\t"<<btime[i]<<"\t"<<wtime[i]<<endl;
    cout<<"\nTotal Waiting Time: "<<total;
cout<<"\nAverage Waiting Time: "<<avg;
    return 0;
}

FCFS Program

#include<iostream.h>
#include<conio.h>
void main()
{
    int i, n, process[10], total=0, wtime[10], ptime[10],turntotal[10];
    float avg=0;
    clrscr();
    cout<<"\nEnter number of Processes:";
    cin>>n;
    for(i=0;i<n;i++)
    {
cout<<"Enter Process "<<i+1<<" ID:";
cin>>process[i];
cout<<"Enter Process "<<i+1<<" Burst Time:";
cin>>ptime[i];
    }
    wtime[0]=0;
    for(i=1;i<n;i++)
    {
wtime[i]=wtime[i-1]+ptime[i-1];
total=total+wtime[i];
    }
    for(i=0;i<n;i++)
    {
    turntotal[i]=ptime[i]+wtime[i];
    }
    avg=(float)total/n;
    cout<<"\nP_ID\t P_TIME\t W_TIME\t TURN_Time\n";
    for(i=0;i<n;i++)
cout<<process[i]<<"\t"<<ptime[i]<<"\t"<<wtime[i]<<"\t"<<turntotal[i]<<"\n";
    cout<<"\nTotal Waiting Time:"<<total;
    cout<<"\nAverage Waiting Time:"<<avg;
    getch();
}