Trending ▼   ResFinder  

KERALA UNIVERSITY MCA - II (SEM 3) MAY 2009 : Algorithm Analysis And Design

2 pages, 19 questions, 0 questions with responses, 0 total responses,    0    0
mca_india
   		+Fave Message
ProfileTimelineUploadsQ & A
 Home > mca_india >

Formatting page ...

*1889* 1889 (Pages : 2) Reg. No. : ..................................... Name : ........................................ III Semester M.C.A. Degree Examination, May 2009 ALGORITHM ANALYSIS AND DESIGN Time : 3 Hours Max. Marks : 100 PART A Answer all questions. All questions carry equal marks. 1. List the advantageous of complexity analysis in algorithms. 2. What are priority queues ? List the application of priority queues. 3. List the advantageous and disadvantageous (if any) of heap sort over any two well known sorting methods. 4. Write an algorithm for right rotation of a binary tree. Explain your algorithm with an example. 5. Write a short note on B trees. 6. Write a short note on NP problems. 7. What do you mean by branch and bound method of problem solving ? 8. What do you mean by knapsack problem and how it can be solved ? 9. Write a short note on Strassen s algorithm. 10. What do you mean by topological sorting ? Explain with example. (10 4=40 Marks) P.T.O. A889 1 *1889* PART B Answer any two questions from each Module. Module I 11. Do you think that both time space complexity analyses are required for all types of problems ? Discuss with examples. 12. Write an algorithm to find the second largest element in a set of n numbers. How many comparisons dos your algorithm required in the worst case ? 13. What do you mean by recurrence equations and where it is used ? Explain with an example. Module II 14. Write an algorithm to find the minimum cost spanning tree. Explain the algorithm with an example. 15. What are AVL trees ? Explain the importance of AVL tree with examples. 16. Write a simple algorithms for DFS and BFS traversals in a graph and list the data structures used in those algorithms. Module III 17. What is eight-queen problem ? Write and explain an algorithm for solving this problem. 18. How the divide and conquer algorithm is differ from greedy algorithms ? Explain with a simple example. 19. What is the working principle of dynamic programming ? Explain with an example. (6 10=60 Marks)

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

Additional Info : Mca - II (sem 3) May 2009 Question Paper - Algorithm Analysis And Design
Tags : mca exam papers, mca question papers, ignou mca question papers, ptu mca question papers, mca sample question paper, mca mumbai university question papers, mca exam syllabus, mca exam question paper, online mca exam papers, online mca exam preparation, mumbai university mca question papers, ignou university mca question papers  


© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

mca_india chat