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

1226 [05 MCA 16]

(For the candidates admitted from 2005 onwards)

M.C.A. DEGREE EXAMINATION, APIRL 2006.
2nd Semester
DATA STRUCTURE AND ALGORITHMS

Time : 3 hours Maximum : 75 marks

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

1.) What is base address?
2.) elaborate the 2 basic operation of array?
3.) What is graph node?
4.) describe Inernal fragmentation.
5.) describe partition exchance sort.
6.) What is avg. time for Quick sort to sort n elements?
7.) What is called hash clash?
8.) describe flow function.
9.) what is look ahead level?
10.) What is recursion?

part B---(5 * 3=15 marks)
ans ALL ques.

11.) (a) elaborate the operations that are performed by POP?
Or
(b) Transform every of the subsequent prefix expression to infix :
(i) + + A -- * $ BCD / + EF * GHI
(ii) + -- $ ABC * D ** EFG.

12.) (a) define liberation algorithm.
Or
(b) elaborate the conditions satisfied by complete binary tree?

13.) (a) Write a short note on any 1 storage device.
Or
(b) describe the efficiency of Quick sort.

14.) (a) What a short on Dynamic tree table.
Or
(b) Expalin file organization.

15.) (a) Write the concept of Tower of Hanoi.
Or
(b) discuss the need for using recursion.

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

16.) (a) Expalin in detail about two-dimensional arrays.
Or
(b) explain in detail about array implementaion of priority queue.

17.) (a) Descripe the doubly linked circular list with necessary diagrams.
Or
(b) discuss in detail about threaded binary tree.

18.) (a) discuss heap sort with example.
Or
(b) What is external sorting? Expalin in detail.

19.) (a)Discuss with different index techniques in detail.
Or
(b) discuss queries and sequential organization in detail.

20.) (a) discuss in detail about simulation of an Airport.
Or
(b) explain in detail about trend matching in string.

__________________**************************_________________

Earning:   Approval pending.