Scribd Logo
Upload

Welcome to Scribd!

  • 4 views

    Scheduling Algorithm Programs

    Uploaded by

    mukuladlakha94
    The document discusses and provides code implementations for four process scheduling algorithms: First Come First Serve (FCFS), Shortest Job First (SJF), Priority scheduling, and Round Robin. For each algorithm, the code takes process burst times as input, calculates waiting times and turnaround times, and outputs scheduling metrics.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Scheduling Algorithm Programs

    Uploaded by

    mukuladlakha94
    4 views7 pages
    The document discusses and provides code implementations for four process scheduling algorithms: First Come First Serve (FCFS), Shortest Job First (SJF), Priority scheduling, and Round Robin. For each algorithm, the code takes process burst times as input, calculates waiting times and turnaround times, and outputs scheduling metrics.

    Original Title

    Scheduling Algorithm programs (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses and provides code implementations for four process scheduling algorithms: First Come First Serve (FCFS), Shortest Job First (SJF), Priority scheduling, and Round Robin. For each algorithm, the code takes process burst times as input, calculates waiting times and turnaround times, and outputs scheduling metrics.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    4 views7 pages

    Scheduling Algorithm Programs

    Uploaded by

    mukuladlakha94
    The document discusses and provides code implementations for four process scheduling algorithms: First Come First Serve (FCFS), Shortest Job First (SJF), Priority scheduling, and Round Robin. For each algorithm, the code takes process burst times as input, calculates waiting times and turnaround times, and outputs scheduling metrics.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 7

    FCFS

    #include<stdio.h>
    #include<malloc.h>
    void main()
    {
    int i, n, *bt, *wt, *tat;
    float avgtat, avgwt;
    printf("\n Enter the number of processes : ");
    scanf("%d", &n);

    bt = (int*)malloc(n*sizeof(int));
    wt = (int*)malloc(n*sizeof(int));
    tat = (int*)malloc(n*sizeof(int));

    printf("\n Enter the burst time for each process \n");


    for(i=0; i<n; i++)
    {
    printf(" Burst time for P%d : ", i);
    scanf("%d", &bt[i]);
    }

    wt[0] = 0;
    tat[0] = bt[0];
    for(i=1; i<n; i++)
    {
    wt[i] = wt[i-1] + bt[i-1]; //waiting time[p] = waiting time[p-1] + Burst Time[p-1]
    tat[i] = wt[i] + bt[i]; //Turnaround Time = Waiting Time + Burst Time
    }

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


    {
    avgwt += wt[i];
    avgtat += tat[i];
    }
    avgwt = avgwt/n;
    avgtat = avgtat/n;

    printf("\n PROCESS \t BURST TIME \t WAITING TIME \t TURNAROUND TIME \n");


    printf("--------------------------------------------------------------\n");
    for(i=0; i<n; i++)
    {
    printf(" P%d \t\t %d \t\t %d \t\t %d \n", i, bt[i], wt[i], tat[i]);
    }
    printf("\n Average Waiting Time = %f \n Average Turnaround Time = %f \n", avgwt, avgtat);
    printf("\n GAANT CHART \n");
    printf("---------------\n");
    for(i=0; i<n; i++)
    {
    printf(" %d\t|| P%d ||\t%d\n", wt[i], i, tat[i]);
    }
    }
    SJF
    #include<stdio.h>
    #include<malloc.h>
    void main()
    {
    int n, i, j, pos, temp, *bt, *wt, *tat, *p;
    float avgwt = 0, avgtat = 0;
    printf("\n Enter the number of processes : ");
    scanf("%d", &n);

    p = (int*)malloc(n*sizeof(int));
    bt = (int*)malloc(n*sizeof(int));
    wt = (int*)malloc(n*sizeof(int));
    tat = (int*)malloc(n*sizeof(int));

    printf("\n Enter the burst time for each process \n");


    for(i=0; i<n; i++)
    {
    printf(" Burst time for P%d : ", i);
    scanf("%d", &bt[i]);
    p[i] = i;
    }

    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;
    tat[0] = bt[0];
    for(i=1; i<n; i++)
    {
    wt[i] = wt[i-1] + bt[i-1]; //waiting time[p] = waiting time[p-1] + Burst Time[p-1]
    tat[i] = wt[i] + bt[i]; //Turnaround Time = Waiting Time + Burst Time
    }

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


    {
    avgwt += wt[i];
    avgtat += tat[i];
    }
    avgwt = avgwt/n;
    avgtat = avgtat/n;

    printf("\n PROCESS \t BURST TIME \t WAITING TIME \t TURNAROUND TIME \n");


    printf("--------------------------------------------------------------\n");
    for(i=0; i<n; i++)
    {
    printf(" P%d \t\t %d \t\t %d \t\t %d \n", p[i], bt[i], wt[i], tat[i]);
    }

    printf("\n Average Waiting Time = %f \n Average Turnaround Time = %f \n", avgwt, avgtat);

    printf("\n GAANT CHART \n");


    printf("---------------\n");
    for(i=0; i<n; i++)
    {
    printf(" %d\t|| P%d ||\t%d\n", wt[i], p[i], tat[i]);
    }
    }
    Priority Algorithm
    #include<stdio.h>
    #include<malloc.h>
    void main()
    {
    int n, i, j, pos, temp, *bt, *wt, *tat, *p, *pt;
    float avgwt = 0, avgtat = 0;
    printf("\n Enter the number of processes : ");
    scanf("%d", &n);

    p = (int*)malloc(n*sizeof(int));
    bt = (int*)malloc(n*sizeof(int));
    wt = (int*)malloc(n*sizeof(int));
    tat = (int*)malloc(n*sizeof(int));

    printf("\n Enter the burst time and priority for each process ");
    for(i=0; i<n; i++)
    {
    printf("\n Burst time of P%d : ", i);
    scanf("%d", &bt[i]);
    printf(" Priority of P%d : ", i);
    scanf("%d", &pt[i]);
    p[i] = i;
    }

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


    {
    pos = i;
    for(j=i+1; j<n; j++)
    {
    if(pt[j] < pt[pos])
    {
    pos = j;
    }
    }
    temp = pt[i];
    pt[i] = pt[pos];
    pt[pos] = temp;

    temp = bt[i];
    bt[i] = bt[pos];
    bt[pos] = temp;

    temp = p[i];
    p[i] = p[pos];
    p[pos] = temp;
    }

    wt[0] = 0;
    tat[0] = bt[0];
    for(i=1; i<n; i++)
    {
    wt[i] = wt[i-1] + bt[i-1]; //waiting time[p] = waiting time[p-1] + Burst Time[p-1]
    tat[i] = wt[i] + bt[i]; //Turnaround Time = Waiting Time + Burst Time
    }

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


    {
    avgwt += wt[i];
    avgtat += tat[i];
    }
    avgwt = avgwt/n;
    avgtat = avgtat/n;

    printf("\n PROCESS \t PRIORITY \t BURST TIME \t WAITING TIME \t TURNAROUND TIME \n");
    printf("--------------------------------------------------------------\n");
    for(i=0; i<n; i++)
    {
    printf(" P%d \t\t %d \t\t %d \t\t %d \t\t %d \n", p[i], pt[i], bt[i], wt[i], tat[i]);
    }

    printf("\n Average Waiting Time = %f \n Average Turnaround Time = %f \n", avgwt, avgtat);

    printf("\n GAANT CHART \n");


    printf("---------------\n");
    for(i=0; i<n; i++)
    {
    printf(" %d\t|| P%d ||\t%d\n", wt[i], p[i], tat[i]);
    }
    Round robin Algorithm
    #include<stdio.h>
    #include<malloc.h>
    void main()
    {
    int n, i, tempn, count, terminaltime=0, initialtime, qt, flag=0, *bt, *wt, *tat, *tempbt;
    float avgwt = 0, avgtat = 0;
    printf("\n Enter the number of processes : ");
    scanf("%d", &n);
    tempn = n;

    tempbt = (int*)malloc(n*sizeof(int));
    bt = (int*)malloc(n*sizeof(int));
    wt = (int*)malloc(n*sizeof(int));
    tat = (int*)malloc(n*sizeof(int));

    printf("\n Enter the Quantum Time : ");


    scanf("%d", &qt);
    printf("\n Enter the burst time for each process \n\n");
    for(i=0; i<n; i++)
    {
    printf(" Burst time of P%d : ", i);
    scanf("%d", &bt[i]);
    tempbt[i] = bt[i];
    terminaltime += bt[i];
    }

    wt[0] = 0;
    printf("\n GAANT CHART \n");
    printf("\n-------------\n");

    for(terminaltime=0, count=0; tempn!=0;) {


    initialtime = terminaltime;
    if(tempbt[count] <= qt && tempbt[count] > 0) {
    terminaltime += tempbt[count];
    tempbt[count] = 0;
    wt[count] = terminaltime - bt[count];
    tat[count] = wt[count] + bt[count];
    flag = 1;
    }
    else if(tempbt[count] > qt) {
    tempbt[count] -= qt;
    terminaltime += qt;
    }
    if(tempbt[count] == 0 && flag == 1) {
    tempn--;
    flag=0;
    }
    if(initialtime != terminaltime) {
    printf(" %d\t|| P%d ||\t%d\n", initialtime, count, terminaltime);
    }
    if(count == n-1)
    count = 0;
    else
    ++count;
    }

    printf("\n PROCESS \t BURST TIME \t WAITING TIME \t TURNAROUND TIME \n");


    printf("--------------------------------------------------------------\n");
    for(i=0; i<n; i++)
    {
    printf(" P%d \t\t %d \t\t %d \t\t %d \n", i, bt[i], wt[i], tat[i]);
    }

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


    avgwt += wt[i];
    avgtat += tat[i];
    }
    avgwt = avgwt/n;
    avgtat = avgtat/n;

    printf("\n Average Waiting Time = %f \n Average Turnaround Time = %f \n", avgwt, avgtat);
    }

    You might also like