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.

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

Sign up to vote on this title
UsefulNot useful