BHARAT INSTITUTE OF ENGINEERING & TECHNOLOGY

B.Tech II year II SEM – MID-II EXAMINATION
BRANCH: II CSE A
SUBJECT: Design and analysis of Algorithms
Date: .4.2015 FN
Answer any two
Max. Marks: 10 Set-1
(a)Explain the P, NP, NP-Hard and NP- complete classes with suitable examples.
(b)Draw the portion of state space tree generated by LCBB for the knapsack
instances: n = 4; (P1; P2;P3 ; P4) = (10; 10; 12; 18); (w1w2;w3;w4) = (2;4; 6; 9 )
and M = 15
(c)I) Let w = {6; 15; 20; 10; 11; 18; 29} and m=35. Find all possible subsets of w
that sum to m. Draw the portion of the state space tree that is generated. (II)
Differentiate between Live node and E-node.
(d)Construct an optimal binary search tree for the following data: n=4,
(a1,a2,a3,a4)= ( do, if, int, while), p(1:4)= ( 3,3,1,1) and q(0:4)= ( 2,3,1,1,1).
(e)Find an optimal solution to the 0/1 knapsack instance, given n=3, weights and
profits as (w1,w2,w3)=(2,3,4) , p1,p2,p3)= (1,2,5) and knapsack capacity =6
generate the sets Si using dynamic programming.

BHARAT INSTITUTE OF ENGINEERING & TECHNOLOGY
B.Tech II year II SEM – MID-II EXAMINATION
BRANCH: II CSE A
SUBJECT: Design and analysis of Algorithms
Date: .4.2015 FN
Answer any two
Max. Marks: 10
Set-2
(a)Explain Branch and bound.
(b)Draw the portion of state space tree generated by LCBB for the knapsack
instances: n = 4; (P1; P2;P3 ; P4) = (10; 10; 12; 18); (w1w2;w3;w4) = (2;4; 6; 9 )
and M = 15
(c)I) Let w = {6; 15; 20; 10; 11; 18; 29} and m=35. Find all possible subsets of w
that sum to m. Draw the portion of the state space tree that is generated. (II)
Differentiate between Live node and E-node.
(d)Construct an optimal binary search tree for the following data: n=4,
(a1,a2,a3,a4)= ( do, if, int, while), p(1:4)= ( 3,3,1,1) and q(0:4)= ( 2,3,1,1,1).
(e)Find an optimal solution to the 0/1 knapsack instance, given n=3, weights and
profits as (w1,w2,w3)=(2,3,4) , p1,p2,p3)= (1,2,5) and knapsack capacity =6
generate the sets Si using dynamic programming.

3. (d)Find an optimal solution to the 0/1 knapsack instance. given n=3.1.p3)= (1.3.1.w4) = (2.4) . 18). Find all possible subsets of w that sum to m.w2.a4)= ( do. 10.Tech II year II SEM – MID-II EXAMINATION BRANCH: II CSE A SUBJECT: Design and analysis of Algorithms Date: . 15. 9 ) and M = 15 (c)I) Let w = {6.4. (II) Differentiate between Live node and E-node. (a1. p1.w3.w2. p(1:4)= ( 3. weights and profits as (w1.1) and q(0:4)= ( 2.1).w3)=(2. (P1.2.a4)= ( do.a2. (e)Explain N-Queens Problem.2. 18. Draw the portion of the state space tree that is generated. P2.1). 20. Marks: 10 Set-4 (f)Construct an optimal binary search tree for the following data: n=4. (w1w2. P4) = (10.1. 10. 6. Draw the portion of the state space tree that is generated. (i)Find an optimal solution to the 0/1 knapsack instance. (II) Differentiate between Live node and E-node.a3.w3)=(2. (P1. int.P3 . while). given n=3.3. 29} and m=35. Marks: 10 Set-3 (a)Construct an optimal binary search tree for the following data: n=4.3.0xplain N-Queens Problem. 9 ) and M = 15 (h)I) Let w = {6.4. (j)E0. .4. P4) = (10.w4) = (2. 29} and m=35.1.p2.2015 FN Answer any two Max.5) and knapsack capacity =6 generate the sets Si using dynamic programming.3. Find all possible subsets of w that sum to m. BHARAT INSTITUTE OF ENGINEERING & TECHNOLOGY B. weights and profits as (w1. 6. (g)Draw the portion of state space tree generated by LCBB for the knapsack instances: n = 4.a3.1.a2.1. (w1w2. 11. 10. 18. 18).4) .4.BHARAT INSTITUTE OF ENGINEERING & TECHNOLOGY B. 12. 12. 10. p(1:4)= ( 3.2015 FN Answer any two Max. int. p1.3. P2. if. (a1.p2. 20. 15.w3.p3)= (1.1) and q(0:4)= ( 2.5) and knapsack capacity =6 generate the sets Si using dynamic programming.P3 . (b)Draw the portion of state space tree generated by LCBB for the knapsack instances: n = 4. while).Tech II year II SEM – MID-II EXAMINATION BRANCH: II CSE A SUBJECT: Design and analysis of Algorithms Date: . if. 11.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.