⦁ You are required to make changes in the programs and introduce the use of compaction where required. MVT MEMORY MANAGEMENT TECHNIQUE #include #include main() { int ms,mp[10],i, temp,n=0; char ch = 'y'; clrscr(); printf("\nEnter the total memory available (in Bytes)-- "); scanf("%d",&ms); temp=ms; for(i=0;ch=='y';i++,n++) { printf("\nEnter memory required for process %d (in Bytes) -- ",i+1); scanf("%d",&mp[i]); if(mp[i]<=temp) { printf("\nMemory is allocated for Process %d ",i+1); temp = temp - mp[i]; } else { printf("\nMemory is Full"); break; } printf("\nDo you want to continue(y/n) -- "); scanf(" %c", &ch); } printf("\n\nTotal Memory Available -- %d", ms); printf("\n\n\tPROCESS\t\t MEMORY ALLOCATED "); for(i=0;i
⦁ You are required to make changes in the programs and introduce the use of compaction where required.
MVT MEMORY MANAGEMENT TECHNIQUE
#include<stdio.h>
#include<conio.h>
main()
{
int ms,mp[10],i, temp,n=0; char ch = 'y';
clrscr();
printf("\nEnter the total memory available (in Bytes)-- "); scanf("%d",&ms);
temp=ms;
for(i=0;ch=='y';i++,n++)
{
printf("\nEnter memory required for process %d (in Bytes) -- ",i+1); scanf("%d",&mp[i]);
if(mp[i]<=temp)
{
printf("\nMemory is allocated for Process %d ",i+1); temp = temp - mp[i];
}
else
{
printf("\nMemory is Full"); break;
}
printf("\nDo you want to continue(y/n) -- "); scanf(" %c", &ch);
}
printf("\n\nTotal Memory Available -- %d", ms);
printf("\n\n\tPROCESS\t\t MEMORY ALLOCATED "); for(i=0;i<n;i++)
printf("\n \t%d\t\t%d",i+1,mp[i]); printf("\n\nTotal Memory Allocated is %d",ms-temp);printf("\nTotal External Fragmentation is %d",temp);
getch();
Step by step
Solved in 2 steps with 2 images
