Tamil Nadu Open University (TNOU) 2006 M.C.A DESIGN AND ANALYSIS OF ALGORITHMS - Question Paper

Tamil Nadu Open University Master of Computer Applications (MCA) - MCA12 June 2006
June 2006

M.C.A.DEGREE exam - JUNE - 2006.
Second year

(For candidates admitted in AY-2005-06 lateral entry candidates only)

DESIGN AND ANALYSIS OF ALGORITHMS
Time:3 Hours

Maximum marks:75

PART A - (5x5=25 marks)
ans any 5 ques..

1. Draw the 4 primitives of structured flow chart.

2. discuss how does a hill climbing algorithm work.

3. describe a linked list. Write an algorithm to delete a cell from a linked list.

4. describe Heuristic. How does it help in solving a issue.

5. describe a heap. provide an example.

6. What is paging? discuss.

7. Write the algorithm ODDMS and discuss the construction of the magic square of order 5.

PART B - (5x10=50 marks)
ans and 5 ques..

8. How a network can be represented by its incidence matrix? discuss with an example.

9. discuss how the branch and boud method can be applied to solve the travelling salesman issue.

10. discuss how the Bicycle lock issue can be solved by using a backtrack programming.

11. discuss alogrithm PRIM with an example.

12. What do you understand by parallelism?Explain parallel spanning Tree Algorithm.

13. Write the algorithm SOLLIN and provide its complexity analysis.

14.Write parallel sorting algorithm.

Earning:   Approval pending.