Get premium membership and access revision papers, questions with answers as well as video lessons.

M.C.A Computer Aplications Design And Analysis Of Algorithms Question Paper

M.C.A Computer Aplications Design And Analysis Of Algorithms 

Course:Bachelor Of Design

Institution: Egerton University question papers

Exam Year:2011



DESIGN AND ANALYSIS OF ALGORITHMS Time: 3 hours

OR

Max. Marks: 60 Answer any five questions All questions carry equal marks ---

1) What is meant by time complexity and space complexity? Discuss its importance. Explain the Heap sort with an example.

2) Explain the merge sort. Perform the quick sort to sort the following numbers. 20 40 50 15 10 05 80 90.

3) Discuss about job sequencing with deadlines. What is meant by minimum spanning tree? Discuss how to achieve it?

4) Explain in detail the floor shop scheduling. Discuss the 0/1 knapsack problem.

5) Explain the breadth first search and traversal with a suitable example.

6) Explain the Hamiltonian cycles with a suitable example. What is meant by graph coloring? Discuss its uses.

7) Discuss about LC search. Discuss about non-deterministic algorithms.




More Question Papers

Enhance your teaching with our comprehensive Schemes of Work and Notes!

Popular Exams

Mid Term Exams

End Term 1 Exams

End Term 3 Exams

Opener Exams

Full Set Exams

Return to Question Papers    

© 2008-2024 by KenyaPlex.com. All Rights Reserved | Home | About Us | Contact Us | Copyright | Terms Of Use | Privacy Policy | Advertise