FILE STRUCTURES LABORATORY WITH MINI PROJECT (18ISL67)

FILE STRUCTURES LABORATORY WITH MINI PROJECT

SEMESTER – VI
Course Code-18ISL67
CIE Marks-40
Number of Contact Hours/Week-0:2:2
SEE Marks-60
Total Number of Lab Contact Hours-36
Exam Hours-03
Credits – 2

Course Learning Objectives: This course (18CISL67) will enable students to:

 Apply the concepts of Unix IPC to implement a given function.
 Measure the performance of different file structures
 Write a program to manage operations on given file system.
 Demonstrate hashing and indexing techniques

Descriptions (if any):

Programs List:

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.

Laboratory Outcomes: The student 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.

Conduct of Practical Examination:

 All laboratory experiments, excluding the first, are to be included for practical examination.
 Experiment distribution
o For questions having only one part: Students are allowed to pick one experiment from the lot and are given equal opportunity.
o For questions having part A and B: Students are allowed to pick one experiment from part A and one experiment from part B and are given equal opportunity.
 Change of experiment is allowed only once and marks allotted for procedure part to be made zero.
 Marks Distribution (Courseed to change in accoradance with university regulations)
o) For questions having only one part – Procedure + Execution + Viva-Voce: 15+70+15 = 100 Marks
p) For questions having part A and B
i. Part A – Procedure + Execution + Viva = 4 + 21 + 5 = 30 Marks
ii. Part B – Procedure + Execution + Viva = 10 + 49+ 11 = 70 Marks