Bharathiar University 2007 M.C.A DATA STRUCTURES AND ALGORITHMS - Question Paper

4089 Q.P.CODE : [05 MCA 16]

(For the candidates admitted from 2005 onwards)
M.C.A. DEGREE EXAMINATION, APRIL 2007.
2nd Semester
DATA STRUCTURES AND ALGORITHMS

Time : 3 hours Maximum : 75 marks

part A---( 10 * 1=10 marks)
ans ALL ques..

1.What is primitive data structure?
2.) State the use of priority queue.
3.) provide any 2 application of stack.
4.) What is meant by linked list?
5.) elaborate the ways to represent binary tree?
6.) provide the avg. case time complexity of the heap sort.
7.) describe the term 'sorting'.
8.) What is called hash clash?
9.) State the use of indexing technique.
10.) What is recursion?

part B---(5 * three =15 marks)
ans ALL quiestions.

11.) (a) What is a stack? Write an algorithm to insert and delete an element in the stack.
Or
(b) Write a procedure in c htat will reverse the order of the entries in an integer array.

12.) (a) What is doubly linked listt? How does it differ from singly linked linst?
Or
(b)What is meant by sparse matrix represntation? explain the methot it can be represented efficiently.

13.) (a) Distinguish ranging from internal and external sorting methods.
Or
(b) Write the algorithm for sorting of ' n ' numbers using insertion sort.

14.) (a) discuss indexing techniques.
Or
(b) Write short notes on dynamic tree table.

15.) (a) Expalin the need for using recursion.
Or
(b) Write a sort note on trend matching in strings.

part C---(5 * 10 =50 marks)
ans ALL ques..

16.) (a) What is meant by queue? discuss the operations performed on the queue.
Or
(b) explain infix,postfix and prefix expressions with example. How will you convert an infix expression to postfix form?

17.) (a) elaborate the operations performed on a singly linked list? Write an algorithm for the identical.
Or
(b) Write short notes on :
(i) Garbage collection
(ii) Compaction.

18.) (a) discuss merge sort with an example.
Or
(b) What is heap sort? Expalin with an example.

19.) (a) discuss briefly about the concept of hashing.
Or
(b) Write a short note on:
(i) Static tree table
(ii) Dynamic tree table.

20.) (a) explain about the Game trees.
Or
(b) discuss the concept of towers of hanoi issue.

__________________**************************_______________________

Earning:   Approval pending.