# 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
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
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.

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