Last active
February 19, 2016 17:46
-
-
Save fotonmoton/7a9414bf9d24297cd737 to your computer and use it in GitHub Desktop.
priority CPU 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 priority_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> | |
int main() | |
{ | |
int p[20],bt[20],pri[20], wt[20],tat[20],i, k, n, temp; | |
float wtavg, tatavg; | |
system("cls"); | |
printf("Enter the number of processes --- "); | |
scanf("%d",&n); | |
for(i=0;i<n;i++) | |
{ | |
p[i] = i; | |
printf("Enter the Burst Time & Priority of Process %d --- ",i); | |
scanf("%d %d",&bt[i], &pri[i]); | |
} | |
for(i=0;i<n;i++) | |
for(k=i+1;k<n;k++) | |
if(pri[i] > pri[k]) | |
{ | |
temp=p[i]; | |
p[i]=p[k]; | |
p[k]=temp; | |
temp=bt[i]; | |
bt[i]=bt[k]; | |
bt[k]=temp; | |
temp=pri[i]; | |
pri[i]=pri[k]; | |
pri[k]=temp; | |
} | |
wtavg = wt[0] = 0; | |
tatavg = tat[0] = bt[0]; | |
for(i=1;i<n;i++) | |
{ | |
wt[i] = wt[i-1] + bt[i-1]; | |
tat[i] = tat[i-1] + bt[i]; | |
wtavg = wtavg + wt[i]; | |
tatavg = tatavg + tat[i]; | |
} | |
printf("\nPROCESS\t\tPRIORITY\tBURST TIME\tWAITING TIME\tTURNAROUND TIME"); | |
for(i=0;i<n;i++) | |
printf("\n%d \t\t %d \t\t %d \t\t %d \t\t %d ",p[i],pri[i],bt[i],wt[i],tat[i]); | |
printf("\nAverage Waiting Time is --- %f",wtavg/n); | |
printf("\nAverage Turnaround Time is --- %f",tatavg/n); | |
getch(); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment