Visvesvaraya Technological University (VTU) 2007 M.C.A data structure using c - Question Paper

1. (a) discuss the time and space complexity of algorithm.

Or

(b) What is primitive datatypes? discuss.

2. (a) Write delection algorithm for a circular queue.

Or

(b) discuss the representation of multiple queues.

3. (a) Write an algorithm to concatenate 2 singly

Or

(b) What is linked stacks? discuss.

4. (a) discuss the threaded binary tree.

Or

(b) What is spanning trees? discuss.

5. (a) discuss the indexing structures.

Or

(b) What is ISAM? discuss.

PART B - (5 x 10 = 50 marks)

ans any 5 ques..
All ques. carry equal marks.

6. Write the binary search algorithm. compute the time complexity of the above algorithm.

7. discuss the representations of arrays.

8. Write insertion and deletion algorithm for multi-queues.

9. Write insertion and deletion algorithm for the doubly linked lists.

10. discuss the allocation and deallocation algorithms for the dynamic memory management.

11. Write the non recursive binary tree in order traversal algorithm. discuss.

12. Write algorithm for the breadth 1st search.
13. discuss the subsequent :
(a) Hashing techniques for direct files
(b) Multilists.

Earning:   Approval pending.