Skip to main content

Round Robin (RR) process scheduling algorithm in C Programming

#include< stdio.h>
#include< conio.h>
void main()
{
 int njob,pID[15],aTime[15],bTime[15],jTime[15],taTime[15],wTime[15],i,j,temp,sTime[15],aBtime[15];
 int texe=0,qtime,aexe=0;
 float totalWait,totalTA;
 clrscr();
 printf("\n Enter number of process:");
 scanf("%d",&njob);
 

 printf("\n Enter quantum time:");
 scanf("%d",&qtime);
 for(i=0;i< njob;i++)
 {
  printf("\n Enter Burst time for process[%d]:",i);
  scanf("%d",&bTime[i]);
  aBtime[i]=bTime[i];
  
 }

 //count total exe time

 for(i=0;i< njob;i++)
 {
  texe=texe+bTime[i];
 }
 
 printf("%d",texe);

 //Execute Round robin for given quantum time

 while(aexe< texe)
 {
  for(i=0;i< njob;i++)
  {
   if(bTime[i]>=qtime)
   {
    aexe=aexe+qtime;
    bTime[i]=bTime[i]-qtime;
    jTime[i]=aexe;
   }
   else
   {
    if(bTime[i]!=0)
    {
     aexe=aexe+bTime[i];
     bTime[i]=0; 
     jTime[i]=aexe;
    }
   }
  }
 }



 for(i=0;i< njob;i++)
 {
  wTime[i]=jTime[i]-aBtime[i];
 }

 printf("\n_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_");
 printf("\n| process |\t burst time |\t Waiting time |\t TA time|");
  printf("\n_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_");
 for(i=0;i< njob;i++) 
 {
  printf("\n|    %d    |\t     %d \t    |\t\t    %d |\t\t     %d|",i,aBtime[i],wTime[i],jTime[i]);

  totalTA=totalTA+jTime[i];
  totalWait=totalWait+wTime[i];
 }

 printf("\n_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_");
  
 printf("\n total waiting time:%.2f",totalWait/njob);
 printf("\n total turn around time:%.2f",totalTA/njob);
getch();
}

OUTPUT
 Enter number of process:3

 Enter quantum time:4

 Enter Burst time for process[0]:24

 Enter Burst time for process[1]:3

 Enter Burst time for process[2]:3
_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_
| process |      burst time |    Waiting time |  TA time|
_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_
|    0    |          24     |               6         30|
|    1    |          3      |               4 |        7|
|    2    |          3      |               7 |       10|
_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_
 total waiting time:5.67
 total turn around time:15.67

Comments

Popular posts from this blog

MVT (Multiprogramming Variable Task) in C Programming

#include< stdio.h> #include< conio.h> void main() { int i,os_m,nPage,total,pg[25]; clrscr(); printf("\nEnter total memory size:"); scanf("%d",&total); printf("\nEnter memory for OS:"); scanf("%d",&os_m); printf("\nEnter no. of pages:"); scanf("%d",&nPage); for(i=0;i< nPage;i++) { printf("Enter size of page[%d]:",i+1); scanf("%d",&pg[i]); } total=total-os_m; for(i=0;i< nPage;i++) { if(total>=pg[i]) { printf("\n Allocate page %d",i+1); total=total-pg[i]; } else printf("\n page %d is not allocated due to insufficient memory.",i+1); } printf("\n External Fragmentation is:%d",total); getch(); } OUTPUT Enter total memory size:1024 Enter memory for OS:256 Enter no. of pages:4 Enter size of page[1]:128 Enter size of page[2]:512 Enter size of page[3]:64 Enter size of page[4]:512 Allocate page 1 Al

implement Rail fence cipher in Java

// File Name: RailFence.java import java.util.*; class RailFenceBasic{ int depth; String Encryption(String plainText,int depth)throws Exception { int r=depth,len=plainText.length(); int c=len/depth; char mat[][]=new char[r][c]; int k=0; String cipherText=""; for(int i=0;i< c;i++) { for(int j=0;j< r;j++) { if(k!=len) mat[j][i]=plainText.charAt(k++); else mat[j][i]='X'; } } for(int i=0;i< r;i++) { for(int j=0;j< c;j++) { cipherText+=mat[i][j]; } } return cipherText; } String Decryption(String cipherText,int depth)throws Exception { int r=depth,len=cipherText.length(); int c=len/depth; char mat[][]=new char[r][c]; int k=0; String plainText=""; for(int i=0;i< r;i++) { for(int j=0;j< c;j++) { mat[i][j]=cipherText.charAt(k++); } } for(int i=0;i< c;i++) { for(int j=0;j< r;j++) { plainText+=mat[j][i]; } }

Deadlock Prevention using Banker’s Algorithm in C Programming

#include< stdio.h> #include< conio.h> void main() { int allocated[15][15],max[15][15],need[15][15],avail[15],tres[15],work[15],flag[15]; int pno,rno,i,j,prc,count,t,total; count=0; clrscr(); printf("\n Enter number of process:"); scanf("%d",&pno); printf("\n Enter number of resources:"); scanf("%d",&rno); for(i=1;i< =pno;i++) { flag[i]=0; } printf("\n Enter total numbers of each resources:"); for(i=1;i<= rno;i++) scanf("%d",&tres[i]); printf("\n Enter Max resources for each process:"); for(i=1;i<= pno;i++) { printf("\n for process %d:",i); for(j=1;j<= rno;j++) scanf("%d",&max[i][j]); } printf("\n Enter allocated resources for each process:"); for(i=1;i<= pno;i++) { printf("\n for process %d:",i); for(j=1;j<= rno;j++) scanf("%d",&allocated[i][j]); } printf("\n avai