grade 12 computer science chapter Recursion* Returns true if there exists a subset of the items in* weights[start..weights.length] that sum to goal.* pre: items in weights[start..weights.length] > 0* post: true has been returned if there exists a subset* of items in weights[start..weights.length] that sum to goal. A well-known problem in computer science is called the knapsack problem. A variation is as follows:Given a collection of weights of (possibly) different integral values, is it possible to place some of theweights in a knapsack so as to fill it to some exact total weight?For example, if the weights are 3, 5, 6, and 9, then it is possible for such totals as 3, 8, 11, 14, 17,etc. to be made exactly, but 2, 4, 22, etc. are not possible.Create a Knapsack application that solves this problem.Save & RunLoad HistoryShow CodeLens1 public class Knapsack{/* Returns true if there exists a subset of the items in4* weights[start..weights.length] that sum to goal.pre: items in weights[start..weights.length] > 0post: true has been returned if there exists a subsetof items in weights[start..weights.length] that sum to goal.78* /9.public boolean fillKnapsack (int [] weights, int goal, int start)1011}12 }13

Answered: A well-known problem in computer…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

grade 12 computer science chapter Recursion

* Returns true if there exists a subset of the items in
* weights[start..weights.length] that sum to goal.
* pre: items in weights[start..weights.length] > 0
* post: true has been returned if there exists a subset
* of items in weights[start..weights.length] that sum to goal.

A well-known problem in computer science is called the knapsack problem. A variation is as follows:
Given a collection of weights of (possibly) different integral values, is it possible to place some of the
weights in a knapsack so as to fill it to some exact total weight?
For example, if the weights are 3, 5, 6, and 9, then it is possible for such totals as 3, 8, 11, 14, 17,
etc. to be made exactly, but 2, 4, 22, etc. are not possible.
Create a Knapsack application that solves this problem.
Save & Run
Load History
Show CodeLens
1 public class Knapsack{
/* Returns true if there exists a subset of the items in
4
* weights[start..weights.length] that sum to goal.
pre: items in weights[start..weights.length] > 0
post: true has been returned if there exists a subset
of items in weights[start..weights.length] that sum to goal.
7
8
* /
9.
public boolean fillKnapsack (int [] weights, int goal, int start)
10
11
}
12 }
13

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions