Type Here to Get Search Results !

write a program file allocation strategies in indexed

 #include<stdio.h>

int f[50],i,k,j,inde[50],n,c,count=0,p; main()

{

clrscr(); for(i=0;i<50;i++) f[i]=0;

x: printf("enter index block\t"); scanf("%d",&p);

if(f[p]==0)

{ f[p]=1;

printf("enter no of files on index\t"); scanf("%d",&n);

}

else

{

printf("Block already allocated\n"); goto x;

}

for(i=0;i<n;i++) scanf("%d",&inde[i]); for(i=0;i<n;i++) if(f[inde[i]]==1)

{

printf("Block already allocated"); goto x;

}

for(j=0;j<n;j++) f[inde[j]]=1;

printf("\n allocated"); printf("\n file indexed"); for(k=0;k<n;k++)

printf("\n %d->%d:%d",p,inde[k],f[inde[k]]);

printf(" Enter 1 to enter more files and 0 to exit\t"); scanf("%d",&c);

if(c==1) goto x; else exit();

getch();

}

 


OUTPUT: enter index block 9 Enter no of files on index 3 1 2 3

Allocated File indexed 9->1:1

9->2;1

9->3:1 enter 1 to enter more files and 0 to exit


Post a Comment

0 Comments
* Please Don't Spam Here. All the Comments are Reviewed by Admin.

Featured post

M

M