-
Notifications
You must be signed in to change notification settings - Fork 12
/
_8.Memoryallocation.c
132 lines (131 loc) · 2.61 KB
/
_8.Memoryallocation.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include<stdio.h>
void firstfit(int p_size[],int n,int m_size[],int m)
{
printf("\t\tFIRST FIT \n");
int i,j,flag,psize[100],msize[100];
for(i=0;i<n;i++)
{
psize[i] = p_size[i];
}
for(i=0;i<m;i++)
{
msize[i] = m_size[i];
}
for(i=0;i<n;i++)
{
flag=0;
for(j=0;j<m;j++)
{
if(msize[j]>=psize[i])
{
printf("%d ALLOCATED IN %d MEMORY BLOCK",psize[i],msize[j]);
msize[j] = msize[j]-psize[i];
printf(" => %d SPACE REMAINING \n",msize[j]);
flag=1;
break;
}
}
if(flag==0)
{
printf("%d CANNOT BE ALLOCATED \n",psize[i]);
}
}
}
void worstfit(int p_size[],int n,int m_size[],int m)
{
printf("\t\tWORST FIT \n");
int i,j,max,loc,psize[100],msize[100];
for(i=0;i<n;i++)
{
psize[i] = p_size[i];
}
for(i=0;i<m;i++)
{
msize[i] = m_size[i];
}
for(i=0;i<n;i++)
{
max = msize[0];
loc = 0;
for(j=0;j<m;j++)
{
if(msize[j]>max)
{
max = msize[j];
loc = j;
}
}
if(max>=psize[i])
{
printf("%d ALLOCATED IN %d MEMORY BLOCK",psize[i],msize[loc]);
msize[loc] = msize[loc]-psize[i];
printf(" => %d SPACE REMAINING \n",msize[loc]);
}
else
{
printf("%d CANNOT BE ALLOCATED \n",psize[i]);
}
}
}
void bestfit(int p_size[],int n,int m_size[],int m)
{
printf("\t\tBEST FIT \n");
int i,j,max,loc,psize[100],msize[100];
for(i=0;i<n;i++)
{
psize[i] = p_size[i];
}
for(i=0;i<m;i++)
{
msize[i] = m_size[i];
}
for(i=0;i<n;i++)
{
loc = -1;
for(j=0;j<m;j++)
{
if(msize[j]>=psize[i])
{
if(loc == -1)
{
loc = j;
}
else if(msize[loc]>msize[j])
{
loc = j;
}
}
}
if(loc != -1)
{
printf("%d ALLOCATED IN %d MEMORY BLOCK",psize[i],msize[loc]);
msize[loc] = msize[loc]-psize[i];
printf(" => %d SPACE REMAINING \n",msize[loc]);
}
else
{
printf("%d CANNOT BE ALLOCATED \n",psize[i]);
}
}
}
void main()
{
int i,p_size[100],m_size[100],n,m;
printf("ENTER THE NUMBER OF PROCESS : ");
scanf("%d",&n);
printf("ENTER THE ARRAY OF PROCESS : ");
for(i=0;i<n;i++)
{
scanf("%d",&p_size[i]);
}
printf("ENTER THE NUMBER OF MEMORY BLOCK : ");
scanf("%d",&m);
printf("ENTER THE ARRAY OF MEMORY BLOCK : ");
for(i=0;i<m;i++)
{
scanf("%d",&m_size[i]);
}
firstfit(p_size,n,m_size,m);
bestfit(p_size,n,m_size,m);
worstfit(p_size,n,m_size,m);
}