B.TECH.

DEGREE EXAMINATION
Fifth Semester

FILE STRUCTURES AND ALGORITHMS

PART A

MODULE I
1.Describe retrieval and update operations of a file.
2. What is the purpose of including secondary keys.
3. Distinguish between text and binary files.
4. What are Direct files? Explain.
5.What are the common operations on files?
6. What is an index sequential file ? Explain.
7. What are the characteristics of sequential files that make them unfit for use in many
applications?
8. What do you mean by secondary key? What is its requirement other and above a
primary key?

MODULE II
1.Why do we use an ordered index access structure.
2. Describe the characteristics of a sequential search.
3.What are the advantages of sequential search?
4. Explain how indexing can be done.
5. Explain interpolation search.
6. Briefly explain how indexing can be done.
7. What file organisation would you choose for a volatile file? Why?
8. When does binary search produce unexpected resultg?
MODULE III
1.What is a uniform hash function?
2. Describe the hash function that is particularly useful in static file.
3.Explain dynamic hashing.
4. What is meant by Extendible Hashing?
5.What is a hash function ? Explain.
6. What is Extensible Hashing?
7.What is collision? How i.s it resolved?
8. How are hash tables organized?

MODULE IV
1.How is a search tree different from multi level index.?
2. Discuss the problems that have to be encountered while deleting a file from a B+ tree.
3. What is meant by height balanced trees ? Explain.
4. Distinguish between B-Trees and B+trees.
5.What is an AVL tree ? Explain.
6. Briefly explain the weight balanced trees.
7. What are some applications for ALL trees?
8. How are threaded binary trees different from ordinary binary trees?

MODULE V
1.What is the need for dynamic storage management?
2. How is garbage collection different from compaction?
3.Distinguish between First fit and best fit.
4. Explain the use of garbage collection.
5.Explain the buddy system of dynamic storage management.
6. Explain the terms garbage collection and compaction.
7. What is composition ? Why is it required in memory management?
8. What is best fit memory allocation? Explain briefly.
PART B

MODULE I
1 With an algorithm and an example explain how insert, search and delete operations are
performed in heap files.
2. How can ordered files made more useful in ordinary usage ? Illustrate with proper
examples.
3. Explain the structure of Heap file.
4. Explain secondary key retrieval in file organization.
5. Explain the structure of sequential files.
6. What is meant by secondary key retrieval in file organization ? Explain.
7. Explain the factors that will influence the designer in deciding on the most suitable
organisation for a particular file.
8. Specify types of files that would naturally require direct access facilities. Contrast this
with any that may seem naturally suited to batching and sorting

MODULE II
1.With an example show that multilevel indexing is more efficient than that of single
level indexing.
2. Briefly describe the different classifications of searching mechanisms.
3. Write an algorithm for binary search. Bring out its advantages.
4. Explain briefly the types of single level ordered Indexes.
5. Write an algorithm for sequential search. What are the advantages of using sequential
search over binary search?
6. Explain briefly the three types of single level ordered indexes.
7. how does index placement affect the performance of IS files? Explain options available
to the designor and the reason for choice of each.
8. Explain why binary search is insure efficient that linear search? Does it succeed under
all circumstances?
MODULE III
1. With proper examples, explain any three types of hash functions.
2. Describe how the performance of a file does not degrade even it is grows in size.
3. Explain briefly the static and dynamic hashing. Compare their advantages.
4. What are the different collision Resolution Techniques available. Explain any two.
5. What is collision resolution in hashing ? Explain open hashing with an example.
6. What is multilevel indexing ? With example, explain how multilevel indexing is done.
7. Design a hasting scheme for storing names of students in which the number of buckets
do not exceed 10
8. What is interpo Explain citing a cur example.

MODULE IV
1. How did AVL tree get its name ? Briefly describe its characteristics.
2. Briefly describe the problems that could be encountered with search trees.
3.Explain coilt an algorithm a threaded Binary Trees.
4.Explain with algorithms how insertion and deletion takes place in a B+ trees.
5. Explain with algorithms how insertion and deletion takes place in a B+ tree.
6. Explain with an algorithm how balancing is done in a height balanced tree.
7. What are B-trees ? HOW are they used ri maintaining indexes? What arc the factt)rs
that affect the design criterion for level and the number of nodes per level?
8. How are rn-way search trees organized. if they were used to store integers in the range
I to 1000, what would you suggest as a good design of storage?

MODULE V
1. With suitable examples, illustrate the algorithm of the first fit and best fit allocation
strategies.
2. Briefly describe the process of storage allocation and liberation in dynamic storage
management.
3.Explain the Dynamic storage management.
4. Explain briefly how Garbage collection and compaction is done in storage
management.

5. Explain how storage allocation and liberation is done in storage management.

6. Explain the first fit and best fit storage allocation with suitable examples. Bring out its
advantages.

7. What is heap memory? How is it managed by memory allocation and release

operations?
8. Illustrate an example where first-fit allocation can score over best fit allocation. Also
indicate the parameter used for comparison.