OS Linked File Allocation Strategy C Program

Program Name	Write a program for Linked file allocation strategy.
Theory	In Linked file allocation contains table where each a field of the the table points to starting block of memory. It means each block pointer points to the next successive block. There fore there is no external fragmentation
Program	#include<stdio.h> 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 Blocks Numbers That Are Already Allocated:"); for(i=0;i<p;i++) { scanf("%d",&a); f[a]=1; } X: printf("Enter 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 Want to Enter one more file? (yes-1/no-0)"); scanf("%d",&c); if(c==1) goto X; }
Input	Enter How Many Blocks That Are Already Allocated:3 Enter Blocks Numbers That Are Already Allocated:4 7 5 Enter Starting Index Block & Length:3 7 9
Output	3->1 4->1 file is already allocated 5->1 6->1 7->1 file is already allocated 8->1 9->1file is already allocated 10->1 11->1 12->1

Home Back