Scribd
Upload
60 views1 page

FCFS CPU Scheduling Algorithm Code

This C program implements the First Come First Serve (FCF) CPU scheduling algorithm. It takes the arrival times and burst times of processes as input, calculates the waiting times and turnaround times of each process, and outputs the average waiting time and average turnaround time. The key steps are: 1) it calculates waiting times by subtracting arrival times from the current time, 2) it calculates turnaround times by subtracting arrival times from completion times, and 3) it outputs the waiting times, turnaround times, average waiting time, and average turnaround time.

Uploaded by

Kripesh Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views1 page

FCFS CPU Scheduling Algorithm Code

This C program implements the First Come First Serve (FCF) CPU scheduling algorithm. It takes the arrival times and burst times of processes as input, calculates the waiting times and turnaround times of each process, and outputs the average waiting time and average turnaround time. The key steps are: 1) it calculates waiting times by subtracting arrival times from the current time, 2) it calculates turnaround times by subtracting arrival times from completion times, and 3) it outputs the waiting times, turnaround times, average waiting time, and average turnaround time.

Uploaded by

Kripesh Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

//FCFS CPU Scheduling Algorithm

#include<stdio.h>
int main(){
int AT[10],BT[10],WT[10],TT[10],n;
int burst=0,cmpl_T;
float Avg_WT,Avg_TT,Total=0;
printf("Enter number of the process\n");
scanf("%d",&n);
printf("Enter Arrival time and Burst time of the process\n");
printf("AT\tBT\n");
for(int i=0;i<n;i++) {
scanf("%d%d",&AT[i],&BT[i]);
}

// Logic for calculating Waiting time


for(int i=0;i<n;i++) {
if(i==0)
WT[i]=AT[i];
else
WT[i]=burst-AT[i];
burst+=BT[i];
Total+=WT[i];
}
Avg_WT=Total/n;

// Logic for calculating Turnaround time


cmpl_T=0;
Total=0;
for(int i=0;i<n;i++) {
cmpl_T+=BT[i];
TT[i]=cmpl_T-AT[i];
Total+=TT[i];
}
Avg_TT=Total/n;

// printing of outputs

printf("Process ,Waiting_time ,TurnA_time\n");


for(int i=0;i<n;i++) {
printf("%d\t\t%d\t\t%d\n",i+1,WT[i],TT[i]);
}
printf("Average waiting time is : %f\n",Avg_WT);
printf("Average turnaround time is : %f\n",Avg_TT);
return 0;
}

You might also like