Visit : https://hemanthrajhemu.github.

io

Join Telegram to get Instant Updates: https://bit.ly/VTU_TELEGRAM

Contact: MAIL: [email protected]

INSTAGRAM: www.instagram.com/hemanthraj_hemu/

INSTAGRAM: www.instagram.com/futurevisionbie/

WHATSAPP SHARE: https://bit.ly/FVBIESHARE

 FILE STRUCTURES LABORATORY WITH MINI PROJECT
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017 - 2018)
SEMESTER – VI
Subject Code 17ISL68 IA Marks 40
Number of Lecture Hours/Week 01I + 02P Exam Marks 60
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 02
Description (If any):
Design, develop, and implement the following programs
Lab Experiments:
PART A

1. Write a 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. Repeat the exercise using an input file specified by the user instead of the
standard input and using an output file specified by the user instead of the standard
output.
2. Write a program to read and write student objects with fixed-length records and the
fields delimited by “|”. Implement pack ( ), unpack ( ), modify ( ) and search ( )
methods.
3. Write a program to read and write student objects with Variable - Length records
using any suitable record structure. Implement pack ( ), unpack ( ), modify ( ) and
search ( ) methods.
4. Write a 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.
5. Write a program to implement simple index on primary key for a file of student
objects. Implement add ( ), search ( ), delete ( ) using the index.
6. Write a program to implement index on secondary key, the name, for a file of
student objects. Implement add ( ), search ( ), delete ( ) using the secondary index.
7. Write a 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.
8. Write a program to read k Lists of names and merge them using k-way merge
algorithm with k = 8.
Part B --- Mini project:
Student should develop mini project on the topics mentioned below or similar applications
Document processing, transaction management, indexing and hashing, buffer
management, configuration management. Not limited to these.
Course outcomes: The students should be able to:
• Implement operations related to files
• Apply the concepts of file system to produce the given application.
• Evaluate performance of various file systems on given parameters.
Conduction of Practical Examination:
1. All laboratory experiments from part A are to be included for practical

https://hemanthrajhemu.github.io
 examination.
2. Mini project has to be evaluated for 30 Marks as per 6(b).
3. Report should be prepared in a standard format prescribed for project work.
4. Students are allowed to pick one experiment from the lot.
5. Strictly follow the instructions as printed on the cover page of answer script.
6. Marks distribution:
a) Part A: Procedure + Conduction + Viva: 09 + 42 +09 =60 Marks
b) Part B: Demonstration + Report + Viva voce = 20+14+06 = 40 Marks
7. Change of experiment is allowed only once and marks allotted to the procedure
part to be made zero.

https://hemanthrajhemu.github.io