Last active
February 19, 2016 17:45
-
-
Save fotonmoton/aa6144a2d595b3e2cc95 to your computer and use it in GitHub Desktop.
round robin scheduling algorithm (Win)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Run VS dev terminal: start button -> serch "dev" -> start VS developer terminal | |
// Compile with: cl rr_win.c | |
// http://www.ssau.ru/files/education/metod_1/%D0%9A%D1%83%D0%BF%D1%80%D0%B8%D1%8F%D0%BD%D0%BE%D0%B2%20%D0%90.%D0%92.%20%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC%D1%8B%20%D0%BF%D0%BB%D0%B0%D0%BD%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F.pdf | |
#include<stdio.h> | |
#include<windows.h> | |
int main() | |
{ | |
int i,j,n,bu[10],wa[10],tat[10],t,ct[10],max; | |
float awt=0,att=0,temp=0; | |
system("cls"); | |
printf("Enter the number of processes -- "); | |
scanf("%d",&n); | |
for(i=0;i<n;i++) | |
{ | |
printf("\nEnter Burst Time for process %d -- ", i+1); | |
scanf("%d",&bu[i]); | |
ct[i]=bu[i]; | |
} | |
printf("\nEnter the size of time slice -- "); | |
scanf("%d",&t); | |
max=bu[0]; | |
for(i=1;i<n;i++) | |
if(max<bu[i]) | |
max=bu[i]; | |
for(j=0;j<(max/t)+1;j++) | |
for(i=0;i<n;i++) | |
if(bu[i]!=0) | |
if(bu[i]<=t) | |
{ | |
tat[i]=temp+bu[i]; | |
temp=temp+bu[i]; | |
bu[i]=0; | |
} | |
else | |
{ | |
bu[i]=bu[i]-t; | |
temp=temp+t; | |
} | |
for(i=0;i<n;i++) | |
{ | |
wa[i]=tat[i]-ct[i]; | |
att+=tat[i]; | |
awt+=wa[i]; | |
} | |
printf("\nThe Average Turnaround time is -- %f",att/n); | |
printf("\nThe Average Waiting time is -- %f",awt/n); | |
printf("\n"); | |
printf("\n\tPROCESS\t BURST TIME \t WAITING TIME\tTURNAROUND TIME\n"); | |
for(i=0;i<n;i++) | |
printf("\t%d \t %d \t\t %d \t\t %d \n",i+1,ct[i],wa[i],tat[i]); | |
getch(); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment