Write a c program to implement Priority Scheduling algorithms non-preemptive

Algorithm:

1.       Start
2.      Declare the array size p[20],bt[20],pri[20], wt[20],tat[20],i, k, n, temp; float wtavg, tatavg,awt,tat;
3.      Read the number of processes to be inserted
4.      Read the Burst times of processes
5.      Sort the Burst times in ascending order and process with shortest burst time is first executed.
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;
                  }
6.      Waiting time for first process will be zero
wtavg = wt[0] = 0;
tatavg = tat[0] = bt[0];
7.      Calculate waiting time and turnaround time
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];
}
8.      Calculate the average waiting time and average turnaround time.
awt=wtavg/n
tat=tatavg/n
9.      Display the values

10.  Stop
source code:

#include<stdio.h>
main()
 {
int p[20],bt[20],pri[20], wt[20],tat[20],i, k, n, temp; float wtavg, tatavg;
clrscr();
printf("Enter the number of processes --- ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
p[i] = i;
printf("Priority of Process");
scanf("%d",&pri[i]);
}
for(i=0;i<n;i++)
{   p[i]=i;
printf("Enter the Burst Time");
scanf("%d",&bt[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(); }

Comments

Post a Comment

Popular posts from this blog

Write C programs to simulate the Paging techniques of memory management

Image
#include<stdio.h> #define MAX 50 int main() { int page[MAX],i,n,f,ps,off,pno; int choice=0; printf("\nEnter the no of  peges in memory: "); scanf("%d",&n); printf("\nEnter page size: "); scanf("%d",&ps); printf("\nEnter no of frames: "); scanf("%d",&f); for(i=0;i<n;i++) page[i]=-1; printf("\nEnter the page table\n"); printf("(Enter frame no as -1 if that page is not present in any frame)\n\n"); printf("\npageno\tframeno\n-------\t-------"); for(i=0;i<n;i++) { printf("\n\n%d\t\t",i); scanf("%d",&page[i]); } do { printf("\n\nEnter the logical address(i.e,page no & offset):"); scanf("%d%d",&pno,&off); if(page[pno]==-1) printf("\n\nThe required page is not available in any of frames"); else printf("\n\nPhysical address(i.e,frame no & offset):%d,%d",page[pno],off); prin
Read more

Write C programs to simulate the Two level directory File organization technique

Write C programs to simulate the Two level directory File organization technique #include<string.h> #include<stdlib.h> #include<stdio.h> struct { char dname[10],fname[10][10]; int fcnt; }dir[10]; void main() { int i,ch,dcnt,k; char f[30], d[30]; dcnt=0; while(1) { printf("\n\n1. Create Directory\t2. Create File\t3. Delete File"); printf("\n4. Search File\t\t5. Display\t6. Exit\tEnter your choice -- "); scanf("%d",&ch); switch(ch) { case 1: printf("\nEnter name of directory -- "); scanf("%s", dir[dcnt].dname); dir[dcnt].fcnt=0; dcnt++; printf("Directory created"); break; case 2: printf("\nEnter name of the directory -- "); scanf("%s",d); for(i=0;i<dcnt;i++) if(strcmp(d,dir[i].dname)==0) { printf("Enter name of the file -- "); scanf("%s",dir[i].fname[dir[i].fcnt]); printf("File created"); break; } if(i==dcnt) printf
Read more

Write C programs to simulate the Hierarchical directory File organization technique

Write C programs to simulate the Hierarchical  directory File organization technique #include<stdio.h> #include<graphics.h> #include<string.h> struct tree_element { char name[20]; int x, y, ftype, lx, rx, nc, level; struct tree_element *link[5]; }; typedef struct tree_element node; void main() { int gd=DETECT,gm; node *root; root=NULL; create(&root,0,"root",0,639,320); clrscr(); initgraph(&gd,&gm,"c:\tc\BGI"); display(root); closegraph(); } create(node **root,int lev,char *dname,int lx,int rx,int x) { int i, gap; if(*root==NULL) { (*root)=(node *)malloc(sizeof(node)); printf("Enter name of dir/file(under %s) : ",dname); fflush(stdin); gets((*root)->name); printf("enter 1 for Dir/2 for file :"); scanf("%d",&(*root)->ftype); (*root)->level=lev; (*root)->y=50+lev*50; (*root)->x=x; (*root)->lx=lx; (*root)->rx=rx; for(i=0;i<5;i++) (*root)->li
Read more