Note: Attempt
total five questions in all, selecting one question from each
unit. Q1 is compulsory. Each question carries 16 marks.
1. Answer the following
a. What is Big-oh notation? Explain its use
b. Explain dynamic memory allocation
c. Distinguish between linear search and binary search
d. What do you mean
by ISAM? Explain
Unit-I
2. Write algorithms for insertion and deletion of an element in a circular queue
3. What is stack?
How is it represented in memory? Discuss the applications of stack
Unit-II
4. Write algorithms for insertion and deletion of an element in a linked list
5. What is a
tree? How is it different from a binary tree? Discuss the binary tree traversal
with the help of examples
Unit-III
6. Write an algorithm for insertion sort? Discuss its best case and worst case complexity
7. Write an
algorithm for merge sort? Discuss its time and space complexity
Unit-IV
8. What is indexed sequential file organization? Discuss its advantages and disadvantages
9. What do you mean by a collision in hashing? Explain in detail the techniques for resolving collisions
