Question: Design and analysis os algorithms A thief robbing a store finds n items. The i item is worth v, dollars and weighs w, pounds, where

Design and analysis os algorithms

A thief robbing a store finds n items. The i item is worth v, dollars and weighs w, pounds, where v, and w, are integers. The thief wants to take as valuable a load as possible, but he can carry at most W pounds in his knapsack, for some integer W=13. Which items should he take? Where, W= 12. 1, 2} and V= {4, 2. 10)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

This problem is a classic example of the knapsack problem which is an NPhard problem There is no known polynomialtime algorithm to solve the knapsack ... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Operating System Questions!

The following data were collected on nonconfor-mances for a period of 10 days: a. On what day is the proportion of nonconformances largest? Smallest? b. What are the LCL and UCL? c. Are there any...

From the following information calculate the cost of ending inventory and cost of goods sold using the (a) FIFO, (b) LIFO, (c) Weighted-average methods. The ending inventory reveals ten itemsunsold....

Discuss whether the "Net zero economy target" is a systematic risk factor not included in the current literature.

1. (5 pts). Consider the "O-1 knapsack problem: A thief robbing a store finds n items. The ith item is worth 4 dollars and weighs wa pounds, where and we are integers. The thief wants to take as...

The 0-1 knapsack problem is the following: a thief robbing a store finds n items. The ith item is worth v_i dollars and weighs w_i kilos with i and w_i positive integers. The thief wants to take as...

Knapsack problems (see also Cormen at al.) The 0-1 knapsack problem is the following: a thief robbing a store finds n items. The ith item is worth v_i dollars and weighs w_i kilos with i and w_i...

2 Knapsack problems (see also Cormen at al.) The 0-1 knapsack problem is the following: a thief robbing a store finds n items. The ith item is worth vi dollars and weighs wi kilos with i and wi...

Laker Company reported the following January purchases and sales data for its only product. The Company uses a periodic inventory system. For specific identification, ending inventory consists of 305...

Joey is planning to invest his savings in a fixed income fund. He manages to deposit $700 at the end of the first year, $500 at the end of the second year, $300 at the end of the third year, and $600...

Find the general solution o f the given differential equation. ( x + 1 ) d y d x + ( x + 2 ) y = 4 x e - x y ( x ) = 2 x 2 + C ( x + 1 ) e x Give the largest interval I over which the general...

Consider the following hypothesis test: H0: 20 Ha:

Consider the following hypothesis test: H 0 : p .75 H a : p

Flom Company is considering the cash purchase of 100% of the outstanding stock of Vargas Company. The terms are not set, and alternative prices are being considered for negotiation. The balance sheet...

At June 30, 2018, the end of its most recent fiscal year, River Consultants Ltd.'s post-closing trial balance was as follows: The company underwent a major expansion in July. New staff was hired and...

Consider the following hypothesis test: H0: p = .20 H0: p .20 A sample of 400 provided a sample proportion p = .175. a. Compute the value of the test statistic. b. What is the p-value? c. At = .05,...

if you were put in charge of a new environment of an organizations assets, the area which likely has the greatest value, and should be your greatest concern

Prove that we can also express the total cost of a tree for a code as the sum, over all internal nodes, of the combined frequencies of the two children of the node.

Just as with ordinary serial algorithms, we sometimes want to implement randomized multithreaded algorithms. This problem explores how to adapt the various performance measures in order to handle the...

Prove that the fractional knapsack problem has the greedy-choice property.

Use the data given in exercise S7-1. On May 19, 2018, Knowlton sold its investment in BCE shares for $26 per share. 1. Journalize the sale. No explanation is required. 2. How does the gain or loss...

Marine Transport Ltd.'s statement of cash flows, as adapted, appears as follows: Requirement As a member of an investment club, you have been asked to review Marine Transport's major investing...

During fiscal year 2017, Donuts 'R' Us Inc. reported net loss of $135.8 million. Donuts received $1.0 million from the sale of other businesses. Donuts made capital expenditures of $10.4 million and...