1.C Program for First-come, first-served (FCFS) CPU scheduling algorithm
#include<stdio.h>
int n;
int bt[30];
void input()
{
for( int i = 0 ; i < n ; i++)
{
printf(“Enter the BT “);
scanf(“%d”,&bt[i]);
}
}
int WTsave[20];
void FCFS()
{
printf(“\nGantt chart.\n0”);
int sum = 0;
for( int i = 0 ; i < n ; i++)
{
WTsave[i] = sum ;//waiting time save
sum = sum + bt[i];
printf(“–P%d–%d”,i+1,sum);
}
}
void WTcalculation()
{
int sum = 0 ;
printf(“\n\nWaiting Time \n”);
for( int i = 0 ; i < n ; i++)
{
sum = sum + WTsave[i] ;
printf(“\n”);
printf(“WP%d = %d”,i+1,WTsave[i]);
}
printf(“\n Average Time %d”,sum/n);
}
int main()
{
scanf(“%d”,&n);
input();
FCFS();
WTcalculation();
return 0;
}
Sample Input :
3
24
3
3
Sample Output :
ARB-LINKER 