Andhra University 2005 M.C.A FILE STRUCTURES - Question Paper

2005 Andhra University M.C.A Computer Applications FILE STRUCTURES ques. paper

MCA 2.1.3

FILE STRUCTURES

First ques. is Compulsory

ans any 4 from the remaining

ans all parts of any ques. at 1 place.

Time: three 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) elaborate the limitations of key sort?
e) elaborate the limitations of Binary search?

2. a) elaborate the operations needed 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? elaborate the advantages of using abstract data models in application?

4. What do you mean by Data Compression? discuss about the data compression. elaborate different techniques of data compressions? elaborate its uses?

5. What is Hashing? discuss the different methods of Hashing Algorithms.

6. What is Collision? discuss the different collision "Resolution Technique".

7. a) discuss 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 1 node is 5.
Show the steps involved in the subsequent tasks:
i) obtain record 49.
ii) Insert record 45.
iii) Delete record 41.

8. a) discuss 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. define 2 situations that can produce empty bucket.

Earning:   Approval pending.