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.

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

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.