Acharya Nagarjuna University (ANU) 2006 M.C.A - IV - DATA STRUCTURES - Question Paper

M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006
PAPER - IV - DATA STRUCTURES

Time: 3 hours Maximum: 100 marks

part A - (3 X 15 = 45 marks)
ans any 3 of the subsequent

1. (a) define about the different data structures and the operations performed on them. (8)
(b) Write an algorithm to obtain the largest element in an array of numbers. (7)

2. (a) discuss how are the strings stored in different kinds of structures. (8)
(b) Write the bubble sort algorithm and discuss it with an example data. (7)

3. (a) Write an algorithm to transform Infix Expression into postfix expression using stack data structure. (8)
(b) elaborate two-way lists? discuss the various operations performed on two-way lists with improper examples. (7)

4. (a) What is a Queue? Write down the algorithms for various operations performed on a queue. (7)
(b) define the method of building a Huffman tree with an example. discuss the implementation of Huffman’s algorithms. (8)

5. (a) Write the merge Sort algorithm and discuss its time complexity. (8)
(b) discuss the binary search procedure with an example data. (7)

part - B - (5 X five = 25 marks)
ans any 5 of the subsequent

6. What is a sub algorithm? discuss the various categories of sub algorithms.
7. discuss how to measure the efficiency of an algorithm.
8. Write an algorithm to change every occurrence of a trend P in tent T by a different trend Q.
9. elaborate linear arrays? discuss how to represent linear arrays in memory.
10. elaborate linked lists? discuss how the linked lists are represented in memory.
11. What is a stack? discuss the operations performed on stacks.
12. What is a binary search tree? discuss the insertion procedure with an example.
13. Compare the time complexities of various sorting algorithms.

part - C - (5 X one = five marks)
ans any ALL of the subsequent

14. What is a Priority queue?
15. elaborate the applications of binary search trees?
16. What is the time complexity of Quick Sort?
17. What is a recursion?
18. What is a sparse matrix?

Earning:   Approval pending.