program for INDEXED algoritham using c-languge

INDEXED ALGORITHM

#include<stdio.h>

#include<conio.h>

main()

{

int sb[20],size[20],n,i,j,x;

int c[10][10];

clrscr();

printf("Enter number of files:");

scanf("%d",&n);

for(i=0;i<n;i++)

{

printf("Enter index number and size of File %d:\n",i);

scanf("%d%d",&sb[i],&size[i]);

}

printf("Enter the blocks occupied by each of them: ");

for(i=0;i<n;i++)

            for(j=0;j<size[i];j++)

                        scanf("%d",&c[i][j]);

printf("\nFilename\tIndex\tsize\tBlocks-occupied\n");

for(i=0;i<n;i++)

{

            printf("\np[%d]\t\t%d\t%d\t",i,sb[i],size[i]);

for(j=0;j<size[i];j++)

            printf("%3d",c[i][j]);

}

printf("\nEnter file name:");

scanf("%d",&x);

if(x<n)

{

printf("\nBlocks of p[%d] are:",x);

for(i=0;i<size[x];i++)

            printf("%2d\t",c[x][i]);

}

else

printf("\nProcess doesn't exist\n");

getch();

}

program for SEQUENTIAL algoritham using c-languge

SEQUENTIAL ALGORITHM

#include <stdio.h>

struct file

{

 int regno,marks1,marks2,marks3;

char name[10];

};

main()

{

 FILE *fp;

float avg;

int i,n,total;

struct file x[30];

clrscr();

printf("Enter no. of students: ");

scanf("%d", &n);

fp=fopen("Student.txt","w");

printf("input student list data \n\n");

for(i=1;i<=n;i++)

{

printf("Reg.N0           Name  Marks1            Marks2            Marks3\n");

fscanf(stdin,"%d%s%d%d%d",&x[i].regno,x[i].name,

                                    &x[i].marks1,&x[i].marks2,&x[i].marks3);

fprintf(fp,"%d\t%s\t%d\t%d\t%d\t\n",x[i].regno,

                                    x[i].name,x[i].marks1,x[i].marks2,x[i].marks3);

}

fclose(fp);

fprintf(stdout,"\n\n");

fp=fopen("student.txt","r");

printf("Regno Name  Marks1            Marks2            Marks3            Total   Avg\n");

for(i=1;i<=n;i++)

{

total= x[i].marks1+x[i].marks2+x[i].marks3;

avg=(float)total/3;

printf("%d\t%s\t%d\t%d\t%d\t%d\t%f\n",x[i].regno,x[i].name,x[i].marks1,

                 x[i].marks2,x[i].marks3,total,avg);

}

fclose(fp);

getch();

}