Thursday, 1 November 2018

Operating Systems:Indexed File Allocation

#include <stdio.h>

int main(){
int a1[50],a2[50],k=0,i,j,n,m;
for(i=0;i<50;i++)
{a1[i]=0;a2[i]=0;
}
do{
k=0;
printf("Enter indexed block number\n");
scanf("%d",&m);
if(a1[m]==0){
a1[m]=1;
do{
k=0;
printf("Enter number of blocks for file\n");
scanf("%d",&n);
for(i=0;i<n;i++){
printf("ENter block number\n");
scanf("%d",&a2[i]);
if(a1[a2[i]]==0)
k++;
}
if(k==n){
             for(i=0;i<n;i++){
              a1[a2[i]]=1;
             }
             printf("File allocated\n");
}
else{
     printf("Try another block set\n");
}
}while(k!=n);
}
else{
printf("Index is already assigned\n");
}
printf("Enter 1 if you want to insert other files else 0\n");
scanf("%d",&i);
}while(i==1);
}




No comments:

Post a Comment

FERMATS LITTLE THEOREM

import java.math.*; import java.io.*; import java.util.Scanner; public class Main { public static void main(String[] args) {    Sca...