From 659098558543b08a45c06f3d934fc88f9900144b Mon Sep 17 00:00:00 2001 From: Vyshnavi V <85625961+Vyshnavi-V@users.noreply.github.com> Date: Sun, 23 Oct 2022 15:59:45 +0530 Subject: [PATCH 01/11] Create bankersalgorithm.cpp --- bankersalgorithm.cpp | 100 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 100 insertions(+) create mode 100644 bankersalgorithm.cpp diff --git a/bankersalgorithm.cpp b/bankersalgorithm.cpp new file mode 100644 index 0000000..a1b4c01 --- /dev/null +++ b/bankersalgorithm.cpp @@ -0,0 +1,100 @@ +#include + +int main() +{ + int r,c,min=-1,s,ct; + printf("Enter number of processes:"); + scanf("%d",&r); + int p[r]; + for(int i=1;i<=r;i++) + { + p[i]=0; + } + printf("Enter number of resources:"); + scanf("%d",&c); + + int max[r][c]; + printf("Enter max.number of resources required for each process:\n"); + for( int i=1;i<=r;i++) + { + printf("P[%d]:\n",i); + for(int j=1;j<=c;j++) + { + printf("\tR[%d]:",j); + scanf("%d",&max[i][j]); + } + } + + int allo[r][c]; + printf("Enter number of resources allocated for each process:\n"); + for( int i=1;i<=r;i++) + { + printf("P[%d]:\n",i); + for(int j=1;j<=c;j++) + { + printf("\tR[%d]:",j); + scanf("%d",&allo[i][j]); + } + } + + int need[r][c]; + for( int i=1;i<=r;i++) + { + for(int j=1;j<=c;j++) + { + need[i][j]=max[i][j]-allo[i][j]; + } + } + + int avl[1][c]; + printf("Enter number of available resources:\n"); + { + for( int j=1;j<=c;j++) + { + scanf("%d",&avl[1][j]); + } + } + + for(int i=1;i<=r;i++) + { + if(p[i]!=1) + { + ct=0; + for(int j=1;j<=c;j++) + { + if(need[i][j]<=avl[1][j]) + { + ct=ct+1; + } + else + { + break; + } + } + if(ct==c) + { + p[i]=1; + printf("P[%d]\t",i); + for(int j=1;j<=c;j++) + { + avl[1][j]+=allo[i][j]; + } + i=0; + } + } + } + for(int i=1;i<=r;i++) + { + if(p[i]==1) + { + continue; + } + else + { + printf("\n Not safe"); + return 0; + } + } + printf("\nSafe"); + return 0; +} From adaed821d3325d959fe7781e576d03d60fb5b0b8 Mon Sep 17 00:00:00 2001 From: Vyshnavi V <85625961+Vyshnavi-V@users.noreply.github.com> Date: Sun, 23 Oct 2022 16:07:08 +0530 Subject: [PATCH 02/11] Create bestfit.cpp --- bestfit.cpp | 56 +++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 bestfit.cpp diff --git a/bestfit.cpp b/bestfit.cpp new file mode 100644 index 0000000..52251b9 --- /dev/null +++ b/bestfit.cpp @@ -0,0 +1,56 @@ +#include + +int main() +{ +int np,nb,min=1000,s; +printf("Enter number of processes:"); +scanf("%d",&np); +int ap[np][2]; +printf("Enter size of each process:\n"); +for( int i=1;i<=np;i++) +{ +printf("P[%d]:",i); +scanf("%d",&ap[i][0]); +ap[i][1]=0; +} +printf("Enter number of blocks:"); +scanf("%d",&nb); +int ab[nb][3]; +printf("Enter size of each block:\n"); +for( int i=1;i<=nb;i++) +{ +printf("B[%d]:",i); +scanf("%d",&ab[i][0]); +ab[i][1]=0; +ab[i][2]=0; +} +for (int i=1;i<=np;i++) +{ + +for(int j=1;j<=nb;j++) +{ + if(ap[i][0] Date: Sun, 23 Oct 2022 16:12:23 +0530 Subject: [PATCH 03/11] Delete bankersalgorithm.cpp --- bankersalgorithm.cpp | 100 ------------------------------------------- 1 file changed, 100 deletions(-) delete mode 100644 bankersalgorithm.cpp diff --git a/bankersalgorithm.cpp b/bankersalgorithm.cpp deleted file mode 100644 index a1b4c01..0000000 --- a/bankersalgorithm.cpp +++ /dev/null @@ -1,100 +0,0 @@ -#include - -int main() -{ - int r,c,min=-1,s,ct; - printf("Enter number of processes:"); - scanf("%d",&r); - int p[r]; - for(int i=1;i<=r;i++) - { - p[i]=0; - } - printf("Enter number of resources:"); - scanf("%d",&c); - - int max[r][c]; - printf("Enter max.number of resources required for each process:\n"); - for( int i=1;i<=r;i++) - { - printf("P[%d]:\n",i); - for(int j=1;j<=c;j++) - { - printf("\tR[%d]:",j); - scanf("%d",&max[i][j]); - } - } - - int allo[r][c]; - printf("Enter number of resources allocated for each process:\n"); - for( int i=1;i<=r;i++) - { - printf("P[%d]:\n",i); - for(int j=1;j<=c;j++) - { - printf("\tR[%d]:",j); - scanf("%d",&allo[i][j]); - } - } - - int need[r][c]; - for( int i=1;i<=r;i++) - { - for(int j=1;j<=c;j++) - { - need[i][j]=max[i][j]-allo[i][j]; - } - } - - int avl[1][c]; - printf("Enter number of available resources:\n"); - { - for( int j=1;j<=c;j++) - { - scanf("%d",&avl[1][j]); - } - } - - for(int i=1;i<=r;i++) - { - if(p[i]!=1) - { - ct=0; - for(int j=1;j<=c;j++) - { - if(need[i][j]<=avl[1][j]) - { - ct=ct+1; - } - else - { - break; - } - } - if(ct==c) - { - p[i]=1; - printf("P[%d]\t",i); - for(int j=1;j<=c;j++) - { - avl[1][j]+=allo[i][j]; - } - i=0; - } - } - } - for(int i=1;i<=r;i++) - { - if(p[i]==1) - { - continue; - } - else - { - printf("\n Not safe"); - return 0; - } - } - printf("\nSafe"); - return 0; -} From 1947740408f639aaff613e3da37135804d8a861d Mon Sep 17 00:00:00 2001 From: Vyshnavi V <85625961+Vyshnavi-V@users.noreply.github.com> Date: Sun, 23 Oct 2022 16:46:41 +0530 Subject: [PATCH 04/11] Delete bestfit.cpp --- bestfit.cpp | 56 ----------------------------------------------------- 1 file changed, 56 deletions(-) delete mode 100644 bestfit.cpp diff --git a/bestfit.cpp b/bestfit.cpp deleted file mode 100644 index 52251b9..0000000 --- a/bestfit.cpp +++ /dev/null @@ -1,56 +0,0 @@ -#include - -int main() -{ -int np,nb,min=1000,s; -printf("Enter number of processes:"); -scanf("%d",&np); -int ap[np][2]; -printf("Enter size of each process:\n"); -for( int i=1;i<=np;i++) -{ -printf("P[%d]:",i); -scanf("%d",&ap[i][0]); -ap[i][1]=0; -} -printf("Enter number of blocks:"); -scanf("%d",&nb); -int ab[nb][3]; -printf("Enter size of each block:\n"); -for( int i=1;i<=nb;i++) -{ -printf("B[%d]:",i); -scanf("%d",&ab[i][0]); -ab[i][1]=0; -ab[i][2]=0; -} -for (int i=1;i<=np;i++) -{ - -for(int j=1;j<=nb;j++) -{ - if(ap[i][0] Date: Sun, 23 Oct 2022 16:47:23 +0530 Subject: [PATCH 05/11] Create bestfit.cpp --- Memory Allocation/bestfit.cpp | 56 +++++++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 Memory Allocation/bestfit.cpp diff --git a/Memory Allocation/bestfit.cpp b/Memory Allocation/bestfit.cpp new file mode 100644 index 0000000..52251b9 --- /dev/null +++ b/Memory Allocation/bestfit.cpp @@ -0,0 +1,56 @@ +#include + +int main() +{ +int np,nb,min=1000,s; +printf("Enter number of processes:"); +scanf("%d",&np); +int ap[np][2]; +printf("Enter size of each process:\n"); +for( int i=1;i<=np;i++) +{ +printf("P[%d]:",i); +scanf("%d",&ap[i][0]); +ap[i][1]=0; +} +printf("Enter number of blocks:"); +scanf("%d",&nb); +int ab[nb][3]; +printf("Enter size of each block:\n"); +for( int i=1;i<=nb;i++) +{ +printf("B[%d]:",i); +scanf("%d",&ab[i][0]); +ab[i][1]=0; +ab[i][2]=0; +} +for (int i=1;i<=np;i++) +{ + +for(int j=1;j<=nb;j++) +{ + if(ap[i][0] Date: Sun, 23 Oct 2022 16:49:31 +0530 Subject: [PATCH 06/11] Create firstfit.cpp --- Memory Allocation/firstfit.cpp | 52 ++++++++++++++++++++++++++++++++++ 1 file changed, 52 insertions(+) create mode 100644 Memory Allocation/firstfit.cpp diff --git a/Memory Allocation/firstfit.cpp b/Memory Allocation/firstfit.cpp new file mode 100644 index 0000000..d4470ee --- /dev/null +++ b/Memory Allocation/firstfit.cpp @@ -0,0 +1,52 @@ +#include + +int main() +{ +int np,nb; +printf("Enter number of processes:"); +scanf("%d",&np); +int ap[np][2]; +printf("Enter size of each process:\n"); +for( int i=1;i<=np;i++) +{ +printf("P[%d]:",i); +scanf("%d",&ap[i][0]); +ap[i][1]=0; +} +printf("Enter number of blocks:"); +scanf("%d",&nb); +int ab[nb][3]; +printf("Enter size of each block:\n"); +for( int i=1;i<=nb;i++) +{ +printf("B[%d]:",i); +scanf("%d",&ab[i][0]); +ab[i][1]=0; +ab[i][2]=0; +} +for (int i=1;i<=np;i++) +{ +for(int j=1;j<=nb;j++) +{ + if(ap[i][0]<=ab[j][0] && ap[i][1]!=1 && ab[j][1]==0 ) + { + ab[j][1]=i; + ab[j][2]=ap[i][0]; + ap[i][1]=1; + } +} +} +printf("Block\tSize\tProcess\tSize\tStatus\n"); +for(int i=1;i<=nb;i++) +{ +printf("B[%d]\t%d\t%d\t%d\t",i,ab[i][0],ab[i][1],ab[i][2]); +if(ab[i][1]==0) +{ +printf("Not Allocated\n"); +} +else +{ +printf("Allocated\n"); +} +} +} From d6abc225aa8d75ae7ca20666b13f1a769cb77077 Mon Sep 17 00:00:00 2001 From: Vyshnavi V <85625961+Vyshnavi-V@users.noreply.github.com> Date: Sun, 23 Oct 2022 16:51:20 +0530 Subject: [PATCH 07/11] Create worstfit.cpp --- Memory Allocation/worstfit.cpp | 59 ++++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 Memory Allocation/worstfit.cpp diff --git a/Memory Allocation/worstfit.cpp b/Memory Allocation/worstfit.cpp new file mode 100644 index 0000000..468234b --- /dev/null +++ b/Memory Allocation/worstfit.cpp @@ -0,0 +1,59 @@ +#include + +int main() +{ +int np,nb,min=-1,s; +printf("Enter number of processes:"); +scanf("%d",&np); +int ap[np][2]; +printf("Enter size of each process:\n"); +for( int i=1;i<=np;i++) +{ +printf("P[%d]:",i); +scanf("%d",&ap[i][0]); +ap[i][1]=0; +} +printf("Enter number of blocks:"); +scanf("%d",&nb); +int ab[nb][3]; +printf("Enter size of each block:\n"); +for( int i=1;i<=nb;i++) +{ +printf("B[%d]:",i); +scanf("%d",&ab[i][0]); +ab[i][1]=0; +ab[i][2]=0; +} +for (int i=1;i<=np;i++) +{ + +for(int j=1;j<=nb;j++) +{ + if(ap[i][0]min) + { + min=ab[j][0]-ap[i][0]; + s=j; + } + } +} + ab[s][1]=i; + ab[s][2]=ap[i][0]; + ap[i][1]=1; + min=-1,s=0; +} +printf("Block\tSize\tProcess\tSize\tStatus\n"); +for(int i=1;i<=nb;i++) +{ +printf("B[%d]\t%d\t%d\t%d\t",i,ab[i][0],ab[i][1],ab[i][2]); +if(ab[i][1]==0) +{ +printf("Not Allocated\n"); +} +else +{ +printf("Allocated\n"); +} +} +} From 8c041cdabbd1a0de4c8865a247dd665314edf80f Mon Sep 17 00:00:00 2001 From: Vyshnavi V <85625961+Vyshnavi-V@users.noreply.github.com> Date: Sun, 23 Oct 2022 17:03:15 +0530 Subject: [PATCH 08/11] Delete Memory Allocation directory --- Memory Allocation/bestfit.cpp | 56 -------------------------------- Memory Allocation/firstfit.cpp | 52 ------------------------------ Memory Allocation/worstfit.cpp | 59 ---------------------------------- 3 files changed, 167 deletions(-) delete mode 100644 Memory Allocation/bestfit.cpp delete mode 100644 Memory Allocation/firstfit.cpp delete mode 100644 Memory Allocation/worstfit.cpp diff --git a/Memory Allocation/bestfit.cpp b/Memory Allocation/bestfit.cpp deleted file mode 100644 index 52251b9..0000000 --- a/Memory Allocation/bestfit.cpp +++ /dev/null @@ -1,56 +0,0 @@ -#include - -int main() -{ -int np,nb,min=1000,s; -printf("Enter number of processes:"); -scanf("%d",&np); -int ap[np][2]; -printf("Enter size of each process:\n"); -for( int i=1;i<=np;i++) -{ -printf("P[%d]:",i); -scanf("%d",&ap[i][0]); -ap[i][1]=0; -} -printf("Enter number of blocks:"); -scanf("%d",&nb); -int ab[nb][3]; -printf("Enter size of each block:\n"); -for( int i=1;i<=nb;i++) -{ -printf("B[%d]:",i); -scanf("%d",&ab[i][0]); -ab[i][1]=0; -ab[i][2]=0; -} -for (int i=1;i<=np;i++) -{ - -for(int j=1;j<=nb;j++) -{ - if(ap[i][0] - -int main() -{ -int np,nb; -printf("Enter number of processes:"); -scanf("%d",&np); -int ap[np][2]; -printf("Enter size of each process:\n"); -for( int i=1;i<=np;i++) -{ -printf("P[%d]:",i); -scanf("%d",&ap[i][0]); -ap[i][1]=0; -} -printf("Enter number of blocks:"); -scanf("%d",&nb); -int ab[nb][3]; -printf("Enter size of each block:\n"); -for( int i=1;i<=nb;i++) -{ -printf("B[%d]:",i); -scanf("%d",&ab[i][0]); -ab[i][1]=0; -ab[i][2]=0; -} -for (int i=1;i<=np;i++) -{ -for(int j=1;j<=nb;j++) -{ - if(ap[i][0]<=ab[j][0] && ap[i][1]!=1 && ab[j][1]==0 ) - { - ab[j][1]=i; - ab[j][2]=ap[i][0]; - ap[i][1]=1; - } -} -} -printf("Block\tSize\tProcess\tSize\tStatus\n"); -for(int i=1;i<=nb;i++) -{ -printf("B[%d]\t%d\t%d\t%d\t",i,ab[i][0],ab[i][1],ab[i][2]); -if(ab[i][1]==0) -{ -printf("Not Allocated\n"); -} -else -{ -printf("Allocated\n"); -} -} -} diff --git a/Memory Allocation/worstfit.cpp b/Memory Allocation/worstfit.cpp deleted file mode 100644 index 468234b..0000000 --- a/Memory Allocation/worstfit.cpp +++ /dev/null @@ -1,59 +0,0 @@ -#include - -int main() -{ -int np,nb,min=-1,s; -printf("Enter number of processes:"); -scanf("%d",&np); -int ap[np][2]; -printf("Enter size of each process:\n"); -for( int i=1;i<=np;i++) -{ -printf("P[%d]:",i); -scanf("%d",&ap[i][0]); -ap[i][1]=0; -} -printf("Enter number of blocks:"); -scanf("%d",&nb); -int ab[nb][3]; -printf("Enter size of each block:\n"); -for( int i=1;i<=nb;i++) -{ -printf("B[%d]:",i); -scanf("%d",&ab[i][0]); -ab[i][1]=0; -ab[i][2]=0; -} -for (int i=1;i<=np;i++) -{ - -for(int j=1;j<=nb;j++) -{ - if(ap[i][0]min) - { - min=ab[j][0]-ap[i][0]; - s=j; - } - } -} - ab[s][1]=i; - ab[s][2]=ap[i][0]; - ap[i][1]=1; - min=-1,s=0; -} -printf("Block\tSize\tProcess\tSize\tStatus\n"); -for(int i=1;i<=nb;i++) -{ -printf("B[%d]\t%d\t%d\t%d\t",i,ab[i][0],ab[i][1],ab[i][2]); -if(ab[i][1]==0) -{ -printf("Not Allocated\n"); -} -else -{ -printf("Allocated\n"); -} -} -} From 4b8c0b48f94eb5be9d6fa3504b8716d0674e450c Mon Sep 17 00:00:00 2001 From: Vyshnavi V <85625961+Vyshnavi-V@users.noreply.github.com> Date: Sun, 23 Oct 2022 17:03:55 +0530 Subject: [PATCH 09/11] Create bestfit.cpp --- bestfit.cpp | 56 +++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 bestfit.cpp diff --git a/bestfit.cpp b/bestfit.cpp new file mode 100644 index 0000000..52251b9 --- /dev/null +++ b/bestfit.cpp @@ -0,0 +1,56 @@ +#include + +int main() +{ +int np,nb,min=1000,s; +printf("Enter number of processes:"); +scanf("%d",&np); +int ap[np][2]; +printf("Enter size of each process:\n"); +for( int i=1;i<=np;i++) +{ +printf("P[%d]:",i); +scanf("%d",&ap[i][0]); +ap[i][1]=0; +} +printf("Enter number of blocks:"); +scanf("%d",&nb); +int ab[nb][3]; +printf("Enter size of each block:\n"); +for( int i=1;i<=nb;i++) +{ +printf("B[%d]:",i); +scanf("%d",&ab[i][0]); +ab[i][1]=0; +ab[i][2]=0; +} +for (int i=1;i<=np;i++) +{ + +for(int j=1;j<=nb;j++) +{ + if(ap[i][0] Date: Sun, 23 Oct 2022 17:05:50 +0530 Subject: [PATCH 10/11] Create firstfit.cpp --- firstfit.cpp | 52 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 52 insertions(+) create mode 100644 firstfit.cpp diff --git a/firstfit.cpp b/firstfit.cpp new file mode 100644 index 0000000..d4470ee --- /dev/null +++ b/firstfit.cpp @@ -0,0 +1,52 @@ +#include + +int main() +{ +int np,nb; +printf("Enter number of processes:"); +scanf("%d",&np); +int ap[np][2]; +printf("Enter size of each process:\n"); +for( int i=1;i<=np;i++) +{ +printf("P[%d]:",i); +scanf("%d",&ap[i][0]); +ap[i][1]=0; +} +printf("Enter number of blocks:"); +scanf("%d",&nb); +int ab[nb][3]; +printf("Enter size of each block:\n"); +for( int i=1;i<=nb;i++) +{ +printf("B[%d]:",i); +scanf("%d",&ab[i][0]); +ab[i][1]=0; +ab[i][2]=0; +} +for (int i=1;i<=np;i++) +{ +for(int j=1;j<=nb;j++) +{ + if(ap[i][0]<=ab[j][0] && ap[i][1]!=1 && ab[j][1]==0 ) + { + ab[j][1]=i; + ab[j][2]=ap[i][0]; + ap[i][1]=1; + } +} +} +printf("Block\tSize\tProcess\tSize\tStatus\n"); +for(int i=1;i<=nb;i++) +{ +printf("B[%d]\t%d\t%d\t%d\t",i,ab[i][0],ab[i][1],ab[i][2]); +if(ab[i][1]==0) +{ +printf("Not Allocated\n"); +} +else +{ +printf("Allocated\n"); +} +} +} From 9b9f6bc9c282443df4843aa2a4b7c96af9b7822a Mon Sep 17 00:00:00 2001 From: Vyshnavi V <85625961+Vyshnavi-V@users.noreply.github.com> Date: Sun, 23 Oct 2022 17:07:15 +0530 Subject: [PATCH 11/11] Create worstfit.cpp --- worstfit.cpp | 59 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 worstfit.cpp diff --git a/worstfit.cpp b/worstfit.cpp new file mode 100644 index 0000000..468234b --- /dev/null +++ b/worstfit.cpp @@ -0,0 +1,59 @@ +#include + +int main() +{ +int np,nb,min=-1,s; +printf("Enter number of processes:"); +scanf("%d",&np); +int ap[np][2]; +printf("Enter size of each process:\n"); +for( int i=1;i<=np;i++) +{ +printf("P[%d]:",i); +scanf("%d",&ap[i][0]); +ap[i][1]=0; +} +printf("Enter number of blocks:"); +scanf("%d",&nb); +int ab[nb][3]; +printf("Enter size of each block:\n"); +for( int i=1;i<=nb;i++) +{ +printf("B[%d]:",i); +scanf("%d",&ab[i][0]); +ab[i][1]=0; +ab[i][2]=0; +} +for (int i=1;i<=np;i++) +{ + +for(int j=1;j<=nb;j++) +{ + if(ap[i][0]min) + { + min=ab[j][0]-ap[i][0]; + s=j; + } + } +} + ab[s][1]=i; + ab[s][2]=ap[i][0]; + ap[i][1]=1; + min=-1,s=0; +} +printf("Block\tSize\tProcess\tSize\tStatus\n"); +for(int i=1;i<=nb;i++) +{ +printf("B[%d]\t%d\t%d\t%d\t",i,ab[i][0],ab[i][1],ab[i][2]); +if(ab[i][1]==0) +{ +printf("Not Allocated\n"); +} +else +{ +printf("Allocated\n"); +} +} +}