Scribd
Upload
19 views2 pages

Be Cse 6 Sem Design and Analysis of Algorithms 11589 May 2019

Daa

Uploaded by

akshainiesri
Copyright
© © All Rights Reserved
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
19 views2 pages

Be Cse 6 Sem Design and Analysis of Algorithms 11589 May 2019

Daa

Uploaded by

akshainiesri
Copyright
© © All Rights Reserved
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/ 2

Code No.

11589/CBCS
FACULTY OF ENGINEERING
B.E. VI – Semester (CBCS) (CSE) (Main) Examination, April/May 2019
Subject: Design & Analysis of Algorithms
Time: 3 Hours Max. Marks:70
PART – A (2 x 10 = 20 Marks)
1. Explain asymptotic notations.
2. What is Knapsack Problem?
3. Why Multi stage graphs are needed?
4. Write Weighing Union algorithm?

1
5. Solve the recurrence relation

45
T(n) = T(1) n=1

-2
= a T(n/b)+f(n) n > 1

for a, b=2, T(1) = 2 and f(n) = n


U
6. Define E-Node, live node and dead node.
O
7. List out the NP-Hard code generation problems.
8. Define DFS with example.
1

9. List the differences between divide and conquer and Greedy method.
45

10. State purging Rule and list out its applications.


-2

Part – B (5 x 10 = 50 Marks)
11. Explain Heap sort with algorithm and construct Max heap tree for the set of
Numbers 15,8,20,12,9,1,34,4 (10M)
U

12. a) What is single source shortest path problem. Explain with an example. (5M)
b) Define Spanning tree and explain Kruskal€s algorithm for finding minimum cost
O

spanning tree for the given graph.

..2

http://www.osmaniaonline.com
Code No. 11589/CBCS
..2..

13. What is multistage graph? Find the shortest path in the graph given bellow using
Dynamic Programming. (10M)

1
14. Solve the knapsack problem using backtracking for the following problem:

45
P={11,21,31,33,43,53,55,65}, w={1,11,21,23,33,43,45,55}, m=110, n=8. (10M)

15. Draw the portion of the state space generated by LCBB for the knapsack

-2
Instance. n=4,(p1,p2,p3,p4)=(10,10,12,18),(w1,w2,w3,w4)=(2,4,6,9)
and m=15. (10M)
U
16. Explain job sequencing with deadlines algorithm and also find the solution
for the instance n=7,(p1,p2,…p7)=(3,5,20,18,1,6,30) and
O
(D1,D2,..,D7)= (1,3,4,3,2,1,2) (10M)

17. For the identifier set (a1,a2,a3,a4)=(count, float, if, while) with P(1)=1/20, P(2)=1/5,
P(3)=1/10,P(4)=1/20,q(0)=1/5, q(1)=1/10, q(2)=1/5,q(3)=1/20, and q(4)=1/20
1

construct the OBST. (10M)


45

************
-2
U
O

http://www.osmaniaonline.com

You might also like