My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: Asha Mathews Member Level: Gold Posted Date: 27 Jun 2007
|
2005 Andhra University M.C.A 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
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Watch TV Channels
|