You have Sum-of-Subsets with given set S = {3, 9, 14, 15, 20} and sum W = 37; Following backtracking algorithm specify for each node if it is promising or not, and if that node is a solution. Do not list nodes in the pruned part of the tree. You do not need to print and to draw here the actual tree (you may do it for yourself on the piece of paper). Just list all nodes. in the figure 5.14. Count in each row starts from the left most possible position, like (5.1), (5.2). (5.3) and so on. Paragraph B I U A 三、 ►11 о + v Lato (Recom... v 19px... ▼ </> node (0,0) is node (1,1) is node (1,2) is and so on Figure 5.14 The pruned state space tree produced using backtracking in Example 5.6. Stored at each node from top to bottom are the total profit of the items stolen up to the node, their total weight, and the bound on the total profit that Item 1 1[$40] 2 Item 2 [$30] (2, 1) $70 7 $115 (1, 1) $40 2 $115 (0, 0) $0 0 $115 (1,2) $0 0 $82 (2,2) $40 2. $98 could be obtained by expanding beyond the node. The optimal $50 Item 3 10 (3, 1) (3,2) (3, 3) (3,4) $120 $70 $90 $40 17 7 12 2 $80 $98 $50 solution is found at Item 4 the node shaded in 4 [$30] X (4, 1) (4, 2) (4,3) (4, 4) color. Each nonpromising node $80 $70 $100 $90 12 7 17 12 is marked with a cross. $80 $70 $90 ×
You have Sum-of-Subsets with given set S = {3, 9, 14, 15, 20} and sum W = 37; Following backtracking algorithm specify for each node if it is promising or not, and if that node is a solution. Do not list nodes in the pruned part of the tree. You do not need to print and to draw here the actual tree (you may do it for yourself on the piece of paper). Just list all nodes. in the figure 5.14. Count in each row starts from the left most possible position, like (5.1), (5.2). (5.3) and so on. Paragraph B I U A 三、 ►11 о + v Lato (Recom... v 19px... ▼ </> node (0,0) is node (1,1) is node (1,2) is and so on Figure 5.14 The pruned state space tree produced using backtracking in Example 5.6. Stored at each node from top to bottom are the total profit of the items stolen up to the node, their total weight, and the bound on the total profit that Item 1 1[$40] 2 Item 2 [$30] (2, 1) $70 7 $115 (1, 1) $40 2 $115 (0, 0) $0 0 $115 (1,2) $0 0 $82 (2,2) $40 2. $98 could be obtained by expanding beyond the node. The optimal $50 Item 3 10 (3, 1) (3,2) (3, 3) (3,4) $120 $70 $90 $40 17 7 12 2 $80 $98 $50 solution is found at Item 4 the node shaded in 4 [$30] X (4, 1) (4, 2) (4,3) (4, 4) color. Each nonpromising node $80 $70 $100 $90 12 7 17 12 is marked with a cross. $80 $70 $90 ×
New Perspectives on HTML5, CSS3, and JavaScript
6th Edition
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Patrick M. Carey
Chapter12: Working With Document Nodes And Style Sheets: Creating A Dynamic Document Outline
Section12.2: Visual Overview: Exploring Attribute Nodes
Problem 2QC
Related questions
Question
100%
please read the instruction carefully and answer the question correctly
Transcribed Image Text:You have Sum-of-Subsets with given set S = {3, 9, 14, 15, 20} and sum W = 37;
Following backtracking algorithm specify for each node if it is promising or not, and if that node is a
solution. Do not list nodes in the pruned part of the tree. You do not need to print and to draw here the actual
tree (you may do it for yourself on the piece of paper). Just list all nodes.
in the figure 5.14. Count in each row starts
from the left most possible position, like (5.1), (5.2). (5.3) and so on.
Paragraph
B
I U
A
三、
►11
о
+ v
Lato (Recom... v
19px... ▼
</>
node (0,0) is
node (1,1) is
node (1,2) is
and so on
![Figure 5.14
The pruned state
space tree produced
using backtracking
in Example 5.6.
Stored at each node
from top to bottom
are the total profit
of the items stolen
up to the node,
their total weight,
and the bound on
the total profit that
Item 1
1[$40]
2
Item
2 [$30]
(2, 1)
$70
7
$115
(1, 1)
$40
2
$115
(0, 0)
$0
0
$115
(1,2)
$0
0
$82
(2,2)
$40
2.
$98
could be obtained
by expanding
beyond the node.
The optimal
$50
Item 3
10
(3, 1)
(3,2)
(3, 3)
(3,4)
$120
$70
$90
$40
17
7
12
2
$80
$98
$50
solution is found at
Item 4
the node shaded in
4 [$30]
X
(4, 1)
(4, 2) (4,3)
(4, 4)
color. Each
nonpromising node
$80
$70
$100
$90
12
7
17
12
is marked with a
cross.
$80
$70
$90
×](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe4fdcb26-bf4f-4942-89d3-0c4d39b5733d%2F3b233c04-2365-419c-bebe-5bfb2cae1c74%2Fqyw2qlo_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Figure 5.14
The pruned state
space tree produced
using backtracking
in Example 5.6.
Stored at each node
from top to bottom
are the total profit
of the items stolen
up to the node,
their total weight,
and the bound on
the total profit that
Item 1
1[$40]
2
Item
2 [$30]
(2, 1)
$70
7
$115
(1, 1)
$40
2
$115
(0, 0)
$0
0
$115
(1,2)
$0
0
$82
(2,2)
$40
2.
$98
could be obtained
by expanding
beyond the node.
The optimal
$50
Item 3
10
(3, 1)
(3,2)
(3, 3)
(3,4)
$120
$70
$90
$40
17
7
12
2
$80
$98
$50
solution is found at
Item 4
the node shaded in
4 [$30]
X
(4, 1)
(4, 2) (4,3)
(4, 4)
color. Each
nonpromising node
$80
$70
$100
$90
12
7
17
12
is marked with a
cross.
$80
$70
$90
×
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
