2004-05 MODEL PAPER

MCA 2.1.3

FILE STRUCTURES

First Question is Compulsory

Answer any four from the remaining

Answer all parts of any Question at one place.

Time: 3 Hrs.
Max. Marks: 100

1. a) What is rational delay? What is the reason?
b) When could be disks becomes bottleneck?
c) What is multiple buffering? What is its use?
d) What are the limitations of key sort?
e) What are the limitations of Binary search?

2. a) What are the operations required to maintain an indexed file?
b) How do you retrieve special subset of records from a data file using combination of secondary key?

3. What is Abstract data model? Why did the early file processing programs does not deal with abstract data model? What are the advantages of using abstract data models in application?

4. What do you mean by Data Compression? Explain about the data compression. What are various techniques of data compressions? What are its uses?

5. What is Hashing? Explain the various methods of Hashing Algorithms.

6. What is Collision? Explain the various collision "Resolution Technique".

7. a) Explain why the number of comparisons is not adequate for measuring performance in sorting large files.

b) Construct a B+ tree for the set of key values (21, 33, 41, 47, 49, 54, 63, 70) under the assumption that the number of search key values that fit in a one node is 5.
Show the steps involved in the following tasks:
i) Find record 49.
ii) Insert record 45.
iii) Delete record 41.

8. a) Explain how extendible Hashing works. Show how it combines tries with conventional static hashing technique.
b) In extendible hashing procedure, the directory can occasionally point to empty bucket. Describe two situations that can produce empty bucket.