Scribd
Upload
817 views1 page

43-Mca-Or-Design and Analysis of Algorithm

This document contains instructions for an exam on design and analysis of algorithms. It provides 8 questions to choose from, with each question having two related parts. The exam allows students to answer any 5 of the 8 questions and lasts 3 hours, with a maximum of 60 marks. Questions cover topics like time and space complexity, heap sort, merge sort, quick sort, job sequencing, minimum spanning trees, floor shop scheduling, knapsack problem, breadth first search, Hamiltonian cycles, graph coloring, LC search, non-deterministic algorithms, Cook's theorem, travelling salesman problem, and NP-complete problems.

Uploaded by

Srinivasa Rao G
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
817 views1 page

43-Mca-Or-Design and Analysis of Algorithm

This document contains instructions for an exam on design and analysis of algorithms. It provides 8 questions to choose from, with each question having two related parts. The exam allows students to answer any 5 of the 8 questions and lasts 3 hours, with a maximum of 60 marks. Questions cover topics like time and space complexity, heap sort, merge sort, quick sort, job sequencing, minimum spanning trees, floor shop scheduling, knapsack problem, breadth first search, Hamiltonian cycles, graph coloring, LC search, non-deterministic algorithms, Cook's theorem, travelling salesman problem, and NP-complete problems.

Uploaded by

Srinivasa Rao G
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Code No: 43/MCA

OR

M.C.A IV Semester Supply Examinations, Apr/May -2008.

DESIGN AND ANALYSIS OF ALGORITHMS

Time: 3 hours Max. Marks: 60


Answer any five questions
All questions carry equal marks
---

1.a) What is meant by time complexity and space complexity? Discuss


its importance.
b) Explain the Heap sort with an example.

2.a) Explain the merge sort.


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

3.a) Discuss about job sequencing with deadlines.


b) What is meant by minimum spanning tree? Discuss how to achieve
it?

4.a) Explain in detail the floor shop scheduling.


b) Discuss the 0/1 knapsack problem.

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


example.

6.a) Explain the Hamiltonian cycles with a suitable example.


b) What is meant by graph coloring? Discuss its uses.

7.a) Discuss about LC search.


b) Discuss about non-deterministic algorithms.

8. Write short notes on the following


a) Cooks theorem
b) Travelling sales man problem
c) NP- complete.

$$$

You might also like