Scribd
Upload
0 views

LAB9

Uploaded by

yashasrai63
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0 views

LAB9

Uploaded by

yashasrai63
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

******************************************************************************

9. Simulate linked file allocation strategy.


*****************************************************************************
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
int main()
{
int f[50], p, i, j, k, a, st, len, n, c;
for (i = 0; i<50; i++)
f[i] = 0;

printf("Enter how many blocks that are already allocated");


scanf("%d", &p);
printf("\nEnter the blocks no.s that are already allocated");
for (i = 0; i< p; i++)
{
scanf("%d", &a); f[a] = 1;
}
X:
printf("Enter the starting index block & length");
scanf(" %d%d", &st, &len);
k = len;
for (j = st; j < (k + st); j++)
{
if (f[j] == 0)
{
f[j] = 1;
printf("\n%d->%d", j, f[j]);
}
else
{
printf("\n %d->file is already allocated", j);
k++;
}
}
printf("\n If u want to enter one more file ? (yes - 1 / no - 0)");
scanf("%d", &c);
if (c == 1)
goto X;
else
exit(0);
getch();
}

You might also like