OS Indexed File Allocation Strategy

Program Name	Write a program for Indexed file allocation strategy.
Theory	In Indexed file allocation strategy data is arranged based on the index of another file.
Program	#include<stdio.h> int f[50],i,k,j,inde[50],n,c,count=0,p; void main() { printf("OS Indexed File Allocation Strategy\n"); for(i=0;i<50;i++) f[i]=0; x: printf("Enter Index Block:"); scanf("%d",&p); if(f[p]==0) { f[p]=1; printf("\nEnter Number of files on index:"); 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(" \nEnter 1 to enter more files and 0 to exit.\n"); scanf("%d",&c); if(c==1) goto x; }
Input	OS Indexed File Allocation Strategy Enter Index Block:9 Enter Number of files on index:3 1 2 3
Output	Allocated File Indexed 9->1:1 9->2:1 9->3:1 Enter 1 to enter more files and 0 to exit. 0

Home Back