Skip to content

Update FCFS Scheduling Algorithm.c #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Update FCFS Scheduling Algorithm.c #1

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
2be0be7
Update FCFS Scheduling Algorithm.c
ktoyesh04 Jun 13, 2023
d57c1d3
Update Round Robin Scheduling Algorithm.c
ktoyesh04 Jun 13, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion FCFS Scheduling Algorithm.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,8 +35,9 @@ int main()
printf("\nProcessNo\tAT\tBT\tCT\tTAT\tWT\tRT\n");
for(int i=0;i<n;i++)
{
if(p[i].at > ct) ct = p[i].at;
ct+=p[i].bt;
p[i].ct=ct;
p[i].ct=ct;
p[i].tat=p[i].ct-p[i].at;
avgtat+=p[i].tat;
p[i].wt=p[i].tat-p[i].bt;
Expand Down
31 changes: 17 additions & 14 deletions Round Robin Scheduling Algorithm.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@ int main()
{
struct proc p[10],tmp;
float avgtat=0,avgwt=0;
int n,tq,ct=0,flag=0,remaining;
int n,tq,ct=0,flag=0,remaining, iter=0;
printf("<--Round Robin Scheduling Algorithm-->\n");
printf("Enter Number of Processes: ");
scanf("%d",&n);
Expand All @@ -37,35 +37,38 @@ int main()
}
remaining=n;
printf("\nProcessNo\tAT\tBT\tCT\tTAT\tWT\n");
ct = p[0].at;
for(int i=0;remaining!=0;)
{
iter ++;
if(p[i].rt<=tq&&p[i].rt>0)
{
ct+=p[i].rt;
p[i].rt=0;
flag=1;
}
else if(p[i].rt>0)
{
p[i].rt-=tq;
ct+=tq;
}
if(p[i].rt==0&&flag==1)
{
flag = 0;
remaining--;
p[i].ct=ct;
p[i].tat=p[i].ct-p[i].at;
avgtat+=p[i].tat;
p[i].wt=p[i].tat-p[i].bt;
avgwt+=p[i].wt;
p[i].wt=p[i].tat-p[i].bt;
avgwt+=p[i].wt;
printf("P%d\t\t%d\t%d\t%d\t%d\t%d\n",p[i].no,p[i].at,p[i].bt,p[i].ct,p[i].tat,p[i].wt);
iter = 0;
}
else if(p[i].rt>0)
{
iter = 0;
p[i].rt-=tq;
ct+=tq;
}
if(i!=n-1&&p[i+1].at<=ct)
i++;
else if(iter > n){
i = (i+1)%n;
ct = p[i].at;
}
else
i=0;
}
avgtat/=n,avgwt/=n;
printf("\nAverage TurnAroundTime=%f\nAverage WaitingTime=%f",avgtat,avgwt);
}
}