Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 38 views

    Priority Scheduling

    Uploaded by

    Sai Chaitanya Vundrakonda
    This C program implements a priority scheduling algorithm. It takes user input for the number of processes, their burst times and priorities. It then sorts the processes in descending order of priority and calculates their waiting times and turnaround times. Finally, it prints the process details along with the average waiting and turnaround times.

    Copyright:

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

    Priority Scheduling

    Uploaded by

    Sai Chaitanya Vundrakonda
    38 views2 pages
    This C program implements a priority scheduling algorithm. It takes user input for the number of processes, their burst times and priorities. It then sorts the processes in descending order of priority and calculates their waiting times and turnaround times. Finally, it prints the process details along with the average waiting and turnaround times.

    Original Description:

    Priority scheduling cse

    Original Title

    Priority scheduling

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This C program implements a priority scheduling algorithm. It takes user input for the number of processes, their burst times and priorities. It then sorts the processes in descending order of priority and calculates their waiting times and turnaround times. Finally, it prints the process details along with the average waiting and turnaround times.

    Copyright:

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

    Priority Scheduling

    Uploaded by

    Sai Chaitanya Vundrakonda
    This C program implements a priority scheduling algorithm. It takes user input for the number of processes, their burst times and priorities. It then sorts the processes in descending order of priority and calculates their waiting times and turnaround times. Finally, it prints the process details along with the average waiting and turnaround times.

    Copyright:

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

    Priority scheduling algorithm

    #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("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();

    You might also like