Andhra University 2005 B.Tech Information Technology - File Structures - Question Paper

MODEL PAPER

B.Tech (IT) Degree exam

Third Year - 1st Semester

FILE STRUCTURES

Time: three hrs
Max Marks: 70

First ques. is Compulsory

ans any 4 from the remaining ques.

All ques. carry equal marks

ans all parts of any ques. at 1 place

1. a) describe the term Stream of bytes and Stream of records
b) What is rotational delay? What is the cause to delay?
c) When could be disks become bottleneck?
d) Write B-tree properties
e) What is multiple buffering? What is its use?
f) elaborate the limitations of key sort?
g) What ate 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 applications?

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

5. What is hashing? discuss the different methods of hashing algorithms.

6. What is collision? discuss the different collision "resolution techniques".

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, 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) fond 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.