STUPIDSID
1 (a)
Explain reading and writing operation in file processing. List all of them. Explain any two.
10 M
1 (b)
Explain buffer management.
10 M
2 (a)
Explain the different ways to manipulate buffer using classes.
10 M
2 (b)
Discuss the difference between Unix tools for sequential processing and direct access.
10 M
3 (a)
Explain the limitation of binary search and internal sorting.
10 M
3 (b)
Justify the statement: ?Indexes are too large to hold in memory.?
5 M
3 (c)
What do you mean by index?
5 M
4 (a)
Explain object oriented model for implementing co-sequential processes.
10 M
4 (b)
Explain K-way merging algorithm with example.
10 M
5 (a)
List the difference between binary search threes and AVL trees.
5 M
5 (b)
Explain creation of B-tree using an example for the sequence CSDTAMPIBWNGURKEHOLJYQZFXY. Order of the B-tree is 4.
10 M
5 (c)
Explain virtual B-tree and LRU replacement.
5 M
6 (a)
Explain the block splitting and merging due to insertion and deletion in the sequence set with examples.
10 M
6 (b)
Explain the loading a simple prefix B* tree.
10 M
7 (a)
Define hashing explain a simple hashing algorithm.
10 M
7 (b)
What is collision? Explain the process of collision resolution by progressive overflow.
10 M
Write short notes on:
8 (a)
Seeking
5 M
8 (b)
Extendible hashing
5 M
8 (c)
B+ trees
5 M
8 (d)
Buddy Bucket.
5 M
More question papers from File Structures