JF CPU SCHEDULING ALGORITHM #include #include using namespace std;   int main()        {                     int p[20], bt[20], wt[20], tat[20], i, k, n, temp; float wtavg, tatavg;                                       printf("\nEnter the number of processes--"); scanf("%d", &n);                  for(i=0;ibt[k])                              {                                temp=bt[i];                                bt[i]=bt[k];                                bt[k]=temp;                                 temp=p[i];                                 p[i]=p[k];                                 p[k]=temp;                               }            wt[0] = wtavg = 0; tat[0] = tatavg = bt[0];                      for(i=1;i

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Modiflow y the beprogram given  to include response time

program;
SJF CPU SCHEDULING ALGORITHM

#include<stdio.h>

#include<conio.h>

using namespace std;

 

int main()

       {

                    int p[20], bt[20], wt[20], tat[20], i, k, n, temp; float wtavg, tatavg;

                

                     printf("\nEnter the number of processes--"); scanf("%d", &n);

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

                         {

                              p[i]=i;

                             printf("Enter Burst Time for Process %d--", i); scanf("%d", &bt[i]);

                          }

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

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

                         if(bt[i]>bt[k])

                             {

                               temp=bt[i];

                               bt[i]=bt[k];

                               bt[k]=temp;

                                temp=p[i];

                                p[i]=p[k];

                                p[k]=temp;

                              }

           wt[0] = wtavg = 0; tat[0] = tatavg = 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("\n\t PROCESS \tBURST TIME \t WAITING TIME\t TURNAROUND TIME\n");

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

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

           printf("\nAverage Waiting Time--%f", wtavg/n);

           printf("\nAverage Turnaround Time--%f", tatavg/n);

         getch();

    }

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY