Scribd
Upload
19 views

Design Analysis of Algorithms

This document contains past year question paper for the Design and Analysis of Algorithms course from B.Tech III Year II Semester (R09) Regular & Supplementary Examinations June 2014. The question paper has 8 questions covering topics like randomized algorithms, set representation, matrix multiplication algorithms, minimum spanning trees, reliability analysis, n-queens problem, knapsack problem, non-deterministic algorithms and complexity classes. Students had to answer any 5 questions out of the 8 questions asked.

Uploaded by

Naresh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
19 views

Design Analysis of Algorithms

This document contains past year question paper for the Design and Analysis of Algorithms course from B.Tech III Year II Semester (R09) Regular & Supplementary Examinations June 2014. The question paper has 8 questions covering topics like randomized algorithms, set representation, matrix multiplication algorithms, minimum spanning trees, reliability analysis, n-queens problem, knapsack problem, non-deterministic algorithms and complexity classes. Students had to answer any 5 questions out of the 8 questions asked.

Uploaded by

Naresh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

www.android.previousquestionpapers.com | www.previousquestionpapers.com | www.ios.previousquestionpapers.

com

Code: 9A05403
R09
B.Tech III Year II Semester (R09) Regular & Supplementary Examinations June 2014
DESIGN & ANALYSIS OF ALGORITHMS
(Electronics & Computer Engineering)
Time: 3 hours Max. Marks: 70
Answer any FIVE questions
All questions carry equal marks

*****
1 (a) State and explain different categories of randomized algorithms.
(b) Present an algorithm to compute the power of n.

2 Explain in detail the set representation with suitable example.

3 (a) What are the advantages of Strassens matrix multiplication over normal one?
(b) Present an algorithm for quick sort by using iterative method.

4 What are minimum cost spanning trees? Explain the implementation of it by

5
using Prim’s algorithm.

Q P
Design a three stage system with device types D1, D2 and D3 the costs are the Rs
45. Rs. 25 and Rs. 30 respectively. The cost of the system is to be not more than

6 P
Rs. 150. The reliability of the devices are 0.8, 0.75 and 0.6 respectively.

Draw and explain the tree organization of the 4-queen solution space.

7 (a) Write an algorithm to solve the knapsack problem with branch and bound
algorithm.
(b) Explain the solution to the O/1 knapsack problem by using FIFOBB.

8 (a) Explain about non deterministic algorithm.


(b) Discuss NP-hard and NP-complete problems.

*****

www.android.universityupdates.in | www.universityupdates.in | www.ios.universityupdates.in

You might also like