Welcome to the File Structures Laboratory

Here is the list of experiments

1. Write a C++ program to read series of names, one per line, from standard input and write these names spelled in reverse order to the standard output using I/O redirection and pipes.
   • Theory
   • Execution
2. Write a C++ program to read and write and student objects with fixed-length records and the fields delimited by “|”.implement pack(),unpack(),modify() and search() methods.
   • Theory
   • Execution
3. Write a C++ program to read and write and student objects with variable-length records using any suitable record structure. Implement pack(),unpack(),modify() and search() methods.
   • Theory
   • Execution
4. Write a c++ program to write student objects with variable-length records using any suitable record structure and to read from this file a student record using RRN.
   • Theory
   • Execution
5. Write a C++ program to implement simple index on primary key for a file of student objects. Implement add(),search(),delete() using the index.
   • Theory
   • Execution
6. Write a C++ program to implement index on secondary key, the name, for a file of student objects. Implement add(),search(),delete() using the secondary index.
   • Theory
   • Execution
7. Write a C++ program to read two lists of names and then match the names in the two lists using Consequential Match based on a single loop. Output the names common to both the lists.
   • Theory
   • Execution
8. Write a C++ program to read k Lists of names and merge them using kway merge algorithm with k = 8.
   • Theory
   • Execution