FS(ISE)-Super Important questions-18IS61
By the TIE review team RNSIT, JIT and JSSATE
Module-1
1. Explain the functions OPEN, READ and WRITE, also provide a brief history
of FS design/Explain all the file handling operations with proper examples-10M
2. Explain the different basic ways to organize data on a disk(Practice Multitrack,
magnetic disk etc)
3. Explain Unix directory structure using a relevant diagram
4. Differentiate between Physical and Logical file
5. Define record? Explain different methods for organizing records of a file
6. What are the different ways of adding structures to files to maintain the
identity of fields? Explain.
6b. Write a short note on (i) Self-describing files (ii)Adv of inheritance for record
buffer classes (iii)Unix tools for sequential processing (iv)RRN -20M
Module-2
1. Explain the operations required to maintain the index files
2. Explain how spaces can be reclaimed in files
Or
Analyze and explain deleting fixed length records for reclaiming space
dynamically
3. Explain the key sorting techniques and limitations with an algorithm
4. What are the limitations of retrieving records using secondary keys? Explain the
solution by using ‘Linking the reference’ technique
5. Explain the following (i)Limitations of binary searching and internal sorting
(ii)Placement strategies[adv &disadv] (iii)Data compression and irreversible
compression techniques (10M)
6. What is an index? Explain a simple index for the entry-sequenced file.
Module-3
1. Explain the model for implementing the consequential processing
along with matching and merging and its applications to the
general ledger programs.
2. Explain the following: i) K-way merge ii) A selection tree for merging a large
number of lists
3. Describe how merging is used to sort large files on the disk
4. 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 the merge-sort algorithm? ii) How long does it take to sort the file using a
key-sort algorithm?
5. Write a short note on (i)Conceptual tool kit for external sorting and (ii) Heap
Sorting with code and example -10M
6. Explain the different ways to improve the performance of merge sort.
7. Write an algorithm for the heap sorting method for insertion. Show the
construction of the heap tree for the following sequence FDCGHIBEA
Module-4
1. Explain deletion, Merging and redistribution of elements in B - Tree, Examine
worst case search depth
2. Show the B-Tree of order 4 that results from loading the following sets of keys
in order i) CGJXNSUOAEBHIF ii)CSDAMPIBWNGURKE
3. Explain with an example the creation of B-trees, also mention the properties of
B* trees
4. Explain the structure of indexed sequential access along with the maintenance
of the sequence set, with a neat diagram discussing the simple prefix B+ tree and
its maintenance. Compare the B Trees and B+trees
OR
Explain the structure of index sequential file, How is indexing done for a index
sequential file with an example
5. Explain the internal structure of index set blocks for the following sequence set
block: Agar-Azd,Back-Ball,TIE-Tight,Cat-Crow,Crows-Doll
6.Explain the block splitting and merging due to insertion and deletion in the
sequence set, with examples
Module-5
1. Explain hashing and write the simple hashing algorithm, Explain the same with
an example. Explain collision and the various resolution techniques with examples
2. Explain different methods used to avoid collision in hashing
technique.
3. Write short notes on i) Dynamic hashing ii) Linear hashing iii) Working of
Extendible hashing
4. What is Hashing? Explain the different Hashing functions with an example
5.With suitable example, explain the collision resolution techniques of double
hashing,chained progressive overflow,chaining with a separate overflow area and
scatter table
How we frame these questions:
TIE review team frames these questions by consolidating comprehensively from
the following sources
1. Exercise problems of textbooks/ references
2. Previous year question VTU exam Question paper and MQP 3.
Questions by Various HODs and professors in contact with TIE
Questions framed shall follow all Bloom’s learning levels with appropriate
action verbs ensuring coverage of all COs
Notes available for all modules:
https://takeiteasyengineers.com/category/cse-ise/6th-sem-cse-ise/fs/
