Amrita Vishwa Vidyapeetham 2007 M.C.A Design Analysis Using Algorithmic Approach - Question Paper

M.C.A. Dec 2007
Design Analysis Using Algorithmic Approach
Time : 3 hours Maximum : 100 marks
ans any 5 ques..
All ques. carry equal marks.
1. (a) How will you determine the space and time complexity of an Algorithm? Also discuss program testing methods. (10)
(b) Discuss the various models of Networks. (10)
2. (a) Explain the program correctness using the knight’s 4 in chess game. (10)
(b) Explain the structured programming by defining flow chart. (10)
3. (a) Explain the concept of Recursion and how it greatly simplify the logical structure of many algorithm. (10)
(b) Discuss the probalistic model and performance analysis of stright insertion sort with example. (10)
4. (a) Explain the properties of Heuristic Algorithm with an example. (10)
(b) Discuss the backtrack programming technique by Bicycle lock issue. (10)
5. (a) How do you formulate Branch and bound algorithm for the issue of travelling sales man for 5 city network.
(10)
(b) Design a recursive procedure for fibonacci series and analyse your algorithm. (10)
6. (a) Explain the role of Ackermann’s function in Recursion with example. (10)
(b) Discuss the Breadth – 1st searching – algorithm in detail. (10)
7. (a) Discuss the single queue – single server issue in detail.
(b) Explain quick sort performance algorithm.
8. (a) Write a note on :
(i) Binary tree search and
(ii) Adjacency list. (13)
(b) Discuss about isomorphism

Earning:   Approval pending.