2005 Andhra University MCA DESIGN AND ANALYSIS OF ALGORITHMS Question paper for exam preparation. Question paper for 2005 Andhra University MCA DESIGN AND ANALYSIS OF ALGORITHMS Question paper, 2005 Andhra University MCA DESIGN AND ANALYSIS OF ALGORITHMS Question paper. SiteMap

## Exam Preparation

 • AIPMT Exam Preparation • Civil Services Exam Preparation • IIT JEE Exam Preparation • Class 12th Standard Exam Preparation • Class 11th Standard Exam Preparation • Class 10th Standard Exam Preparation • Class 9th Standard Exam Preparation • Class 8th Standard Exam Preparation

## Question Papers

 • Class 9th Standard Question Paper • Class 10th Standard Question Paper • Class 11th Standard Question Paper • Class 12th Standard Question Paper • BA Question Paper • BBM Question Paper • BCA Question Paper • BCom Question Paper • BE Question Paper • BSc Question Paper • BTech Question Paper • LLB Question Paper • LLM Question Paper • MA Question Paper • MBA Question Paper • MCA Question Paper • MCom Question Paper • MSc Question Paper • MTech Question Paper

# 2005 Andhra University MCA DESIGN AND ANALYSIS OF ALGORITHMS Question paper

University Question Papers
2005 Andhra University MCA DESIGN AND ANALYSIS OF ALGORITHMS Question paper
MCA 2.1.4

DESIGN AND ANALYSIS OF ALGORITHMS

First Question is Compulsory

Answer any four from the remaining

Answer all parts of any Question at one place.

Time: 3 Hrs.
Max. Marks: 100

1. Explain:
a. Asymtotic Notation.
b. Lower Bounds.
c. NP-hard Problems.
d. Minimal spanning Tree.
e. Convex Hull Problem.
f. Memory Functions.
g. Topological Sorting.

2. Describe divide and conquer strategy for multiplying two n-bit numbers. Derive its time complexity.

3. a. Explain quick sort Algorithm.
b. Show how the quick sort algorithm sorts the following sets of keys.
(1,1,1,1,1,1,1) and (5,5,8,3,4,3,2)

4. a. Explain how you can use greedy technique for Huffman coding.
b. Explain the greedy technique with knopsack problem as an example.

5. Explain problem Reduction using linear programming as an example.

6. Explain Dynamic Programming Technique for construction of optimal binary search trees with the help of an example.

7. Outline Template of a backtracking algorithm. Explain a backtracking solution to the Hamiltonian circuit problem.

8. Explain branch and bound technique. Apply it to the following instance of Assignment problem.

Job1 Job2 Job3 Job4
Person A 9 2 7 8
Person B 6 4 3 7
Person C 5 8 1 8
Person D 7 6 9 4