All Notes on BCA

#include<stdio.h>
#include<conio.h>
#include<string.h>

int n,Bu[20],Twt,Ttt,A[10],Wt[10],w;
float Awt,Att;
char pname[20][20],c[20][20];

void insertdata();
void Gantt_chart();
void Calculate();
void fcfs();

void insertdata()
{
 int i;
 printf("\n Enter the number of processes: ");
 scanf("%d",&amp;n);
 for(i=1;i&lt;=n;i++)
 {
 fflush(stdin);
 printf("\n\n Enter the process name: ");
 scanf("%s",&amp;pname[i]);
 printf("\n Enter The BurstTime for Process %s = ",pname[i]);
 scanf("%d",&amp;Bu[i]);
 printf("\n Enter the Arrival Time for Process %s = ",pname[i]);
 scanf("%d",&amp;A[i]);
 }
}

void Gantt_chart()
{
 int i;
 printf("\n\n\t\t\tGANTT CHART\n");
 printf("\n...........................................................\n");
 for(i=1;i&lt;=n;i++)
 printf("|\t%s\t",pname[i]);
 printf("|\t\n");
 printf("\n...........................................................\n");
 printf("\n");
 for(i=1;i&lt;=n;i++)
 printf("%d\t\t",Wt[i]);
 printf("%d",Wt[n]+Bu[n]);
 printf("\n...........................................................\n");
 printf("\n");
 }

void Calculate()
{
 int i;

 Wt[1]=0;
 for(i=2;i&lt;=n;i++)
 {
 Wt[i]=Bu[i-1]+Wt[i-1];
 }
 for(i=1;i&lt;=n;i++)
 {
 Twt=Twt+(Wt[i]-A[i]);
 Ttt=Ttt+((Wt[i]+Bu[i])-A[i]);
 }
 Att=(float)Ttt/n;
 Awt=(float)Twt/n;
 printf("\n\n Average Turn around time=%3.2f ms ",Att);
 printf("\n\n AverageWaiting Time=%3.2f ms",Awt);
}

void fcfs()
{
 int i,j,temp, temp1;
 Twt=0;
 Ttt=0;
 printf("\n\n FIRST COME FIRST SERVED ALGORITHM\n\n");
 for(i=1;i&lt;=n;i++)
 {
 for(j=i+1;j&lt;=n;j++) { if(A[i]&gt;A[j])
 {
 temp=Bu[i];
 temp1=A[i];
 Bu[i]=Bu[j];
 A[i]=A[j];
 Bu[j]=temp;
 A[j]=temp1;
 strcpy(c[i],pname[i]);
 strcpy(pname[i],pname[j]);
 strcpy(pname[j],c[i]);
 }
 }
 }
 Calculate();
 Gantt_chart();
}
void main()
{
 int ch;
 clrscr();
 insertdata();
 fcfs();
 getch();
}