Question

implement MLFQ using C++ please preferably linked list

P1 {4,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2}

P2 {18,31,19,35,11,42,18,43,19,47,18,43,17,51,19,32,10}

P3 {6,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5}

P4 {17,42,19,55,20,54,17,52,15,67,12,72,15,66,14}

P5 {5,81,4,82,5,71,3,61,5,62,4,51,3,77,4,61,3,42,5}

P6 {10,35,12,41,14,33,11,32,15,41,13,29,11}

P7 {21,51,23,53,24,61,22,31,21,43,20}

P8 {11,52,14,42,15,31,17,21,16,43,12,31,13,32,15}

will compute the overall wait times, response times, and turnaround times for each process and averages for FCFS

the processes follow {CPU, IO, CPU, IO, ...}

output should look like this

Now Running: P1
Ready Queue: Process Burst
P2 18
P3 6
P4 17
P5 5
P6 10
P7 21
P8 11

Now In I/O: Process Remaining time
[empty]

Current Time: 4

Now running: P2

Ready queue: Process Burst
P3 6
P4 17
P5 5
P6 10
P7 21
P8 11

Now in I/O: Process Remaining time
P1 24

Answer 1

for (int i-0;i < n;i++) //loop is used for Process Burst Time cin >> burstTime[i]; //ask to enter Process Burst Time for (int j = 0; j 〈 n; j++) process[il static cast<char>(letter); letter++; //waiting time int waitingTime [20]; //ready queue to store the process ready to execute int readyQueue [20]; //waiting queue to store the process which are not ready to executing int waitQueue [20]; string waitProcess [20]; string readyProcess[20];

waitingTime [0] 0; = //calculating waiting time waitingTime [1] for (j = 0; j 0; 1;j++) wait ingTime[i] += readyQueue[j]; //displaying data double avgwait = 0.0, avgTurn = 0.0; cout << "Process "<<" BurstTime " <<"WaitingTime " << " TurnaroundTime" << endl << endl; for (int i - 0;i < n;i++) readyProcess[i] <<waitingTime[i] readyQueue[i] << endl; cout << << "\t\t " << readyQueue [1] << "\t" << wait ingTime [ << "\t\t" avgwait avgTurn wait ingTime [1]; wait ingTime [i] + += += readyQueue[i]; cout << endl < "Average waiting time: "<< avgWait/n; cout << endl << "Average turnaround time : " << avgTurn / n << endl; system("pause"); )//end of main

//function definitions int findMin(int arra[], int size) int min = arra [0], pos = 0; for (int i = 1;i < size;i++) min pos arra[i]; 1; = = return pos; bool hasProcesses (int aar[], int size) bool flagfalse; for (int i 0;i < size;i++) if (aar[i]!= -1) flag - true; break; return flag;

sample output

nter total number of processes (maximum 20):5 Enter Process Burst Time P[2]:4 P[3]:3 P[4]:2 Process BurstTime WaitingTime TurnaroundTime 2 10 15 4 10 Average waiting time: 4 Average turnaround time: 7

Code to copy:

#include "stdafx.h"
#include <iostream>
#include <string>

using namespace std;
//function prototypes
int findMin(int[],int);
bool hasProcesses(int[],int);
//main function
int main()
{
   //declaration of process names
   //burst time
   int burstTime[20];
   int n;
   string process[20];
   int letter = 'A';

   cout << "Enter total number of processes(maximum 20):";

   cin >> n; //ask to enter a number of processes from user

   cout << "\nEnter Process Burst Time\n";

   for (int i = 0;i < n;i++) //loop is used for Process Burst Time

   {

       cout << "P[" << i + 1 << "]:";

       cin >> burstTime[i]; //ask to enter Process Burst Time

   }
   for (int j = 0; j < n; j++)
   {
       process[j] = static_cast<char>(letter);
       letter++;
   }

   //waiting time
   int waitingTime[20];

   //ready queue to store the process ready to execute
   int readyQueue[20];

   //waiting queue to store the process which are not ready to executing
   int waitQueue[20];
   string waitProcess[20];
   string readyProcess[20];
   int i = 0, j = 0, k = 0, time = 0;
   do
   {
       //based on the arrival time and burst time sorting the process order
       while (i < n)
       {

           waitQueue[j] = burstTime[i];
           waitProcess[j] = process[i];
           burstTime[i] = -1;
           j++;
           i++;
       }

       int pos = findMin(waitQueue, j);
       readyQueue[k] = waitQueue[pos];
    
       readyProcess[k] = waitProcess[pos];
       waitQueue[pos] = -1;
       time = time + readyQueue[k];
       k++;
   } while (hasProcesses(waitQueue, n));

   waitingTime[0] = 0;

   //calculating waiting time
   for (i = 1;i < n;i++)
   {
       waitingTime[i] = 0;
       for (j = 0;j < i;j++)
           waitingTime[i] += readyQueue[j];
   }

   //displaying data
   double avgWait = 0.0, avgTurn = 0.0;
   cout << "Process " << " BurstTime " << " WaitingTime " << " TurnaroundTime" << endl << endl;

   for (int i = 0;i < n;i++)
   {
       cout << readyProcess[i] << "\t\t" << readyQueue[i] << "\t" << waitingTime[i] << "\t\t"
           << waitingTime[i] + readyQueue[i] << endl;
       avgWait += waitingTime[i];
       avgTurn += waitingTime[i] + readyQueue[i];
   }
   cout << endl << "Average waiting time: " << avgWait / n;
   cout << endl << "Average turnaround time: " << avgTurn / n << endl;
   system("pause");
}//end of main

//function definitions
int findMin(int arra[], int size)
{
   int min = arra[0], pos = 0;
   for (int i = 1;i < size;i++)
       if (min > arra[i] && arra[i] != -1)
       {
           min = arra[i];
           pos = i;
       }
   return pos;
}

bool hasProcesses(int aar[], int size)
{
   bool flag = false;
   for (int i = 0;i < size;i++)
   {
       if (aar[i]!= -1)
       {
           flag = true;
           break;
       }

    
   }
   return flag;
}