Data Structures Using C, 2nd Edition by Pearson

430 Data Structures Using C

}

printf (“\n The list of fail students :”);

while (! feof(f))

{

fscanf(f,”%d”, &roll);

if (!feof(f)) printf (“%d “, roll);

}

fclose (p);

fclose(f);

}

}

9.7 SEQUENTIAL FILE ORGANIZATION

This file organization is the simplest way to store and retrieve records of a file. In this file, the records

are stored in a meaningful order according to a key field. The first record in the order is placed at the

beginning of the file. The second record is stored right after the first, the third after the second, and so

on. However, the records may be ordered in ascending or descending order by the key field which can

be numeric (such ...