Question

Write a C++ -program that will implement Worst-fit, memory management algorithms. Your program must do the following:

1. Input the memory size and the number and sizes of all the partitions (limit the max number of the partitions to 5);

2. Input the job list that includes:

- Job's name;

- Job's size.

3. For each job you should create in your program a data structure that will include the job status (Run/Wait) and the partition number (if the job was allocated);

4. Calculate and display initial memory allocation.

Display the memory waste and the jobs that could not be allocated and have to wait.

Answer 1

program;

#include<bits/stdc++.h>

using namespace std;

void firstFit(int blockSize[], int m, int processSize[], int n)

{

int allocation[n];

memset(allocation, -1, sizeof(allocation));

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

{

for (int j=0; j<m; j++)

{

if (blockSize[j] >= processSize[i])

{

allocation[i] = j;

blockSize[j] -= processSize[i];

break;

}

}

}

cout << "\nProcess No.\tProcess Size\tBlock no.\n";

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

{

cout << " " << i+1 << "\t\t" << processSize[i] << "\t\t";

if (allocation[i] != -1)

cout << allocation[i] + 1;

else

cout << "Not Allocated";

cout << endl;

}

}

int main()

{

int i,n,m;

cout<<"Enter blockSize and memorySize"<<endl;

cin>>m>>n;

int blockSize[m+1],memorySize[n+1];

cout<<"Enter blocks";

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

cin>>blockSize[i];

cout<<"Enter memory sizes to be allocated";

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

cin>>memorySize[i];

firstFit(blockSize, m, memorySize, n);

return 0 ;

}