User Interface Design – 17CS832

Subject Name: FILE STRUCTURES Subject Code: 18IS61_17IS62/25IS62

Semester: VI
QUESTION BANK

Course Learning Objectives:

 Explain the fundamentals of file structures and their management.
 Measure the performance of different file structures
 Organize different file structures in the memory.
 Demonstrate hashing and indexing techniques.

Q.No Question CO/Marks

MODULE_1
1 What are file structures? Explain briefly the history of file structures design. CO1
2 Explain the different costs of disk access. Define i)seek time ii)rotational delay CO1
iii)transfer time
3 CO1
Explain the functions OPEN,READ and WRITE with parameters.
4 Briefly explain the different basic ways to organize the data on a disk. CO2
5 Briefly explain the organization of data on Nine-Track tapes with a neat diagram CO2
6 CO2
With neat sketch, explain Unix directory structure
7 CO2
Explain sector based data organization in magnetic disk.
8 Differentiate between constant linear velocity (CLV) and constant angular velocity CO1
(CAV)
9 CO1
Differentiate between physical file and logical file
10 Discuss about the Fundamental File processing operations CO1

11 CO2
What are the major strengths and weekness of CD - ROM?

MODULE_2
11 What is a record? Explain different methods for organizing records CO1
of a file. Or
Explain the different Record structures used in the organization of a file.
12 Write a pack() and unpack() methods in C++ for employee id, CO1
employee name, employee designation, employee contact number fields for
variable length records.
13 What are self-describing files? How it is supported in fixed CO2
length record structures, explain with an example.
14 What is the advantage of using inheritance for record buffer CO2
classes? Explain

15 Write brief notes on : i) Performance of sequential search ii) Direct CO2

access.

ISE Department, R R Institute of Technology, 1

 User Interface Design – 17CS832

16 Explain unix tools for sequential processing. CO2

17 What is RRN? Explain how it supports direct access with CO1
example.
18 What are the different ways of adding structures to files to maintain
the identity of fields? Explain.
19 Explain hierarchy for record buffer objects.
MODULE_3
20 Explain the operations required to maintain the index files.
21 What is redundancy reduction? Explain how run- length-
encoding helps in redundancy reduction with an example
23 Write an algorithm for searching a record from a file using
i)binary search ii)sequential search
24 Explain the limitations of binary searching and internal
sorting.
25 Explain how spaces can be reclaimed in files.
Or
How spaces can be reclaimed from deletion of records from fixed length record file and
variable length record file?
26 What is an index? Explain a simple index for entry-sequenced
file.
27 Explain the advantages and disadvantages of 3 types of
placement strategies.
28 Explain the key sorting algorithm, with an example.

29 Discuss the advantages and disadvantages of indices that are too

large to hold in memory.
MODULE_4
30 What is co-sequential processing and what are the assumptions
and components of the model?
31 Explain the following: i) K-way merge ii) A selection tree for
merging large number of lists.
32 Explain the model for implementing the consequential processing
and its applications to general ledger program.
33 Describe how merging is used to sort large files on the disk.
34 Write a note on conceptual tool kit for external sorting.
35 What is a heap? Explain heap sorting with code and example.

36 Explain the different ways to improve the performance of merge

sort.
37 Suppose you have 40MB of memory available for sorting the
80,000,000 records file where each record is of 100 bytes. i) How long does it take to sort
the file using merge-sort algorithm. ii) How long it takes to sortthe file using key-sort
algorithm.
38 Write a algorithm for heap sorting method for insertion. Show the
construction of heap tree for the following sequence FDCGHIBEA

ISE Department, R R Institute of Technology, 2

 User Interface Design – 17CS832

that are valuable for users and developers.

MODULE_5
39 What is hashing? Explain a simple hashing algorithm. CO1
40 What is collision? Explain collision resolution by progressive CO2
overflow.
41 What is Hashing? Explain the different Hashing functions with an CO2
example.
42 Discuss the issues that are involved in implementing the hashed CO2
file.
43 Explain different methods used to avoid collision in hashing CO1
technique.
44 Problems on hashing & overflow CO1
45 CO2
Explain the working of extendible hashing.
46 CO2
Write short notes on: i) Dynamic hashing ii) Linear hashing
47 Write short notes on Extendible hashing performance. CO1
48 Write a note on buddy-buckets. CO2
49 Write a short notes on: a. Extendible Hashing CO4

Course Outcomes: Students will be able to

CO-1: Choose appropriate file structure for storage representation.

CO-2: Identify a suitable sorting technique to arrange the data.

CO-3: Select suitable indexing and hashing techniques for better performance to a given
problem

Signature of Faculty HOD Signature of IQAC coordinator

ISE Department, R R Institute of Technology, Prof. Balaraju G 3