PROGRAM TO UNDERSTAND SJF SCHEDULING ALGORITHM

-

 /*

 * C Program to Implement SJF Scheduling

 */

 

#include<stdio.h>

int main()

{

    int bt[20],p[20],wt[20],tat[20],i,j,n,total=0,totalT=0,pos,temp;

    float avg_wt,avg_tat;

    printf("Enter number of process:");

    scanf("%d",&n);

 

    printf("\nEnter Burst Time:\n");

    for(i=0;i<n;i++)

    {

        printf("p%d:",i+1);

        scanf("%d",&bt[i]);

        p[i]=i+1;

    }

 

    //sorting of burst times

    for(i=0;i<n;i++)

    {

        pos=i;

        for(j=i+1;j<n;j++)

        {

            if(bt[j]<bt[pos])

                pos=j;

        }

 

        temp=bt[i];

        bt[i]=bt[pos];

        bt[pos]=temp;

 

        temp=p[i];

        p[i]=p[pos];

        p[pos]=temp;

    }

 

    wt[0]=0;

 

    //finding the waiting time of all the processes

    for(i=1;i<n;i++)

    {

        wt[i]=0;

        for(j=0;j<i;j++)

             //individual WT by adding BT of all previous completed processes

            wt[i]+=bt[j];

 

        //total waiting time

        total+=wt[i];   

    }

 

    //average waiting time

    avg_wt=(float)total/n;  

 

    printf("\nProcess\t Burst Time \tWaiting Time\tTurnaround Time");

    for(i=0;i<n;i++)

    {

        //turnaround time of individual processes

        tat[i]=bt[i]+wt[i]; 

 

        //total turnaround time

        totalT+=tat[i];      

        printf("\np%d\t\t %d\t\t %d\t\t\t%d",p[i],bt[i],wt[i],tat[i]);

    }

 

    //average turnaround time

    avg_tat=(float)totalT/n;     

    printf("\n\nAverage Waiting Time=%f",avg_wt);

    printf("\nAverage Turnaround Time=%f",avg_tat);

}


Output:

Enter number of process:4

 

Enter Burst Time:

p1:5

p2:4

p3:12

p4:7

 

Process      Burst Time     Waiting Time    Turnaround Time

p2               4               0                  4

p1               5               4                  9

p4               7               9                  16

p3               12              16                 28

 

Average Waiting Time=7.250000

Average Turnaround Time=14.250000

Comments

Post a Comment

Popular posts from this blog

PROGRAM FOR BANKERS ALGORITHM FOR DEADLOCK AVOIDENCE

-
#include<stdio.h> int main() {   /* array will store at most 5 process with 3 resoures if your process or    resources is greater than 5 and 3 then increase the size of array */   int p, c, count = 0, i, j, alc[5][3], max[5][3], need[5][3], safe[5], available[3], done[5], terminate = 0;   printf("Enter the number of process and resources");   scanf("%d %d", & p, & c);   // p is process and c is diffrent resources    printf("enter allocation of resource of all process %dx%d matrix", p, c);   for (i = 0; i < p; i++) {     for (j = 0; j < c; j++) {       scanf("%d", & alc[i][j]);     }   }   printf("enter the max resource process required %dx%d matrix", p, c);   for (i = 0; i < p; i++) {     for (j = 0; j < c; j++) {       scanf("%d", & max[i][j]);     }   }   printf("enter the  available resource");   f...
Read more

JAVA RECORD PROGRAM FOR AREA AND PERIMETER OF RECTANGLE

-
 // Java program to calculate  the area and perimeter of a rectangle using class concept import java.util.*; // Rectangle Class File class Rectangle {     // data members     int length, width;     // methods     //constructor to create Object     Rectangle(int length, int width) {         this. length = length;         this.width = width;     }     // prints the area of rectangle     public void area() {         int areaOfRectangle;         areaOfRectangle = this.length * this.width;         System.out.println("Area of rectangle with the given input is : " + areaOfRectangle);     }     // prints the perimeter of rectangle     public void perimeter() {         int  perimeterOfRectangle;         perimeterOfRectangle = 2 * (this...
Read more

JAVA PROGRAM TO PERFORM MULTI THREADING USING RUNNABLE INTERFACE

-
 class Multithreading implements Runnable {     public void run()     {         try {             // Displaying the thread that is running             System.out.println(                 "Thread " + Thread.currentThread().getId()                 + " is running");         }         catch (Exception e) {                          // Throwing an exception             System.out.println("Exception is caught");         }     } } // Main Class public class Geeks {     public static void main(String[] args)     {         int n = 8; // Number of threads         for (int i = 0; i < n; i++) {...
Read more