sppu-te-comp-content/SystemsProgrammingAndOperatingSystem
sppu-te-comp-content/SystemsProgrammingAndOperatingSystem
3
1
Fork 0
Code Issues Activity

Simplified and improved code B6.

Browse Source 
- Changed variable names and made prSize and blkSize global variables
- Added note in main function
This commit is contained in:
K 2024-11-05 00:21:16 +05:30
parent c8304d11c5
commit f598faff49
Signed by: notkshitij
GPG Key ID: C5B8BC7530F8F43F
1 changed files with 83 additions and 104 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

139
Codes/Group B/Code-B6.cpp
View File

@ -1,117 +1,96 @@
#include<iostream> #include <iostream>
using namespace std; using namespace std;
int blksize[] = {100, 500, 200, 300, 600}; int blocks[] = {100, 500, 200, 300, 600};
int processes[] = {212, 417, 112, 426}; int processes[] = {212, 417, 112, 426};
int blkSize = sizeof(blocks) / sizeof(blocks[0]);
int prSize = sizeof(processes) / sizeof(processes[0]);
void firstfit(int pr[], int pr_size, int blk[], int blk_size) void FirstFit() {
{ cout<<endl<<"FIRST FIT:";
for(int i = 0; i < pr_size; i++) for (int i=0; i<prSize; i++) {
{
bool check = false; bool check = false;
for(int j = 0; j < blk_size; j++) for(int j=0; j<blkSize; j++) {
{ if ((blocks[j] - processes[i] >= 0)) {
if((blk[j] - pr[i]) >= 0) blocks[j] -= processes[i];
{
blk[j] = blk[j] - pr[i];
cout<<"\nProcess with value "<<pr[i]<<" allocated at block "<<j+1;
check = true; check = true;
cout<<endl<<"Process "<<processes[i]<<" has been allocated to block "<<j+1;
break; break;
} }
} }
if(!check) if (check == false) {
{ cout<<endl<<"Process "<<processes[i]<<" has not been allocated.";
cout<<"\nProcess with value "<<pr[i]<<" not allocated";
} }
} }
} }
void bestfit(int pr[], int pr_size, int blk[], int blk_size) void NextFit() {
{ int j = 0;
for(int i = 0; i < pr_size; i++) cout<<endl<<"NEXT FIT:";
{ for (int i=0; i<prSize; i++) {
bool check = false;
for (int k=0; k<blkSize; k++) {
if ((blocks[j] - processes[i]) >= 0) {
blocks[j] = blocks[j] - processes[i];
cout<<endl<<"Process "<<processes[i]<<" has been allocated to block "<<j+1;
check = true;
break;
}
j = (j + 1) % blkSize;
}
if (check == false) {
cout<<endl<<"Process "<<processes[i]<<" has not been allocated.";
}
}
}
void BestFit() {
for (int i=0; i<prSize; i++) {
bool check = false; bool check = false;
int k, store = 999; int k, store = 999;
for(int j = 0; j < blk_size; j++) for (int j=0; j<blkSize; j++) {
{ if ((blocks[j] - processes[i]) >= 0 && (blocks[j] - processes[i]) < store) {
if((blk[j] - pr[i]) >= 0 && (blk[j] - pr[i]) < store)
{
k = j + 1; k = j + 1;
store = blk[j] - pr[i]; store = blocks[j] - processes[i];
check = true; check = true;
} }
} }
if(!check) if (check == false) {
{ cout<<endl<<"Process "<<processes[i]<<" was not allocated to any block.";
cout<<"\nProcess with value "<<pr[i]<<" not allocated";
} }
else{ else {
blk[k - 1] = blk[k - 1] - pr[i]; blocks[k - 1] -= processes[i];
cout<<"\nProcess with value "<<pr[i]<<" allocated at block "<<k; cout<<endl<<"Process "<<processes[i]<<" was allocated to block "<<k;
} }
} }
} }
void worstfit(int pr[], int pr_size, int blk[], int blk_size) void WorstFit() {
{
for(int i = 0; i < pr_size; i++)
{
bool check = false; bool check = false;
for (int i=0; i<prSize; i++) {
int k, store = -1; int k, store = -1;
for(int j = 0; j < blk_size; j++) for (int j=0; j<blkSize; j++) {
{ if ((blocks[j] - processes[i] >= 0 && (blocks[j] - processes[i] > store))) {
if((blk[j] - pr[i]) >= 0 && (blk[j] - pr[i]) > store)
{
k = j + 1; k = j + 1;
store = blk[j] - pr[i]; store = blocks[j] - processes[i];
check = true; check = true;
} }
} }
if(!check) if (check == false) {
{ cout<<endl<<"Process "<<processes[i]<<" was not allocated to any block.";
cout<<"\nProcess with value "<<pr[i]<<" not allocated";
} }
else{ else {
blk[k - 1] = blk[k - 1] - pr[i]; blocks[k - 1] -= processes[i];
cout<<"\nProcess with value "<<pr[i]<<" allocated at block "<<k; cout<<endl<<"Process "<<processes[i]<<" was allocated to block "<<k;
} }
} }
} }
void nextfit(int pr[], int pr_size, int blk[], int blk_size) int main () {
{ // ONLY RUN ONE FUNCTION AT A TIME.
int j = 0; // FirstFit();
for(int i = 0; i < pr_size; i++) // NextFit();
{ BestFit();
bool check = false; // WorstFit();
for(int k = 0; k < blk_size; k++)
{
if((blk[j] - pr[i]) >= 0)
{
blk[j] = blk[j] - pr[i];
cout<<"\nProcess with value "<<pr[i]<<" allocated at block "<<j+1;
check = true;
break;
}
j = (j + 1) % blk_size;
}
if(!check)
{
cout<<"\nProcess with value "<<pr[i]<<" not allocated";
}
}
}
int main()
{
int blk_size = sizeof(blksize)/sizeof(blksize[0]);
int pr_size = sizeof(processes)/sizeof(processes[0]);
////Note: Use only one function at a time to get the correct output
//firstfit(processes, pr_size, blksize, blk_size);
//bestfit(processes, pr_size, blksize, blk_size);
//worstfit(processes, pr_size, blksize, blk_size);
nextfit(processes, pr_size, blksize, blk_size);
return 0; return 0;
} }