Use Dynamic programming to solve "0/1 Knapsack Problem" Unbounded Knapsack Problem (many copies for the item) The W 7 (max weight) Items # of available copies Item weight Item benefit 1 3 1 11 2 2 2 10 3 4 3 30

Use Dynamic programming to solve "0/1 Knapsack Problem" Unbounded Knapsack Problem (many copies for the item) The W 7 (max weight) Items # of available copies Item weight Item benefit 1 3 1 11 2 2 2 10 3 4 3 30

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

Similar questions

Recall the rod cutting problem we discussed in class and in the book. While it might be possible for a theoretical person to cut the rod of length n, up to n times to achieve the maximum possible sale value, enterprising children do not possess the stamina to cut the rod so many times. They instead get tired or bored after only k cuts. Design a dynamic programming algorithm to maximize the value of selling cut rods if at most we can cut the rod k times. Please use elements in the table P to calculate the value of a continuous rod, e.g. an uncut rod of length i has value pi. Further you should analyze: 1. The time complexity of a baseline solution that does not use dynamic programming or memoization that exhaustively explores all potential solutions 2. The time complexity of your dynamic programming solution 3. Describe how you could change your algorithm to so to reconstruct the actual cuts in order achieve the highest value for the rod pieces.
esc 3 A Question 14 of 20: Select the best answer for the question. 14. Use Gauss-Jordan elimination to solve the following linear system: -3x + 4y = -6 5x - y = 10 O A. (2,0) O B. (2,-5) O C. (-6,2) O D. (2,2) O Mark for review (Will be highlighted on the review page) > חח D G $ 4 { 3 R ند 19 F % 50 T Oll SADE A GY O U *∞ C 8 A
A trucking company's vehicle has a load capacity of 17 cubic feet. Calculate the highest valuable cargo that the 0/1 knapsack algorithm can create with the following goods. Name A B C D E Available quantity 7 4 5 3 4 Size in cubic feet 2 3 5 7 8 Value 3 4 8 9 11
Multiple Linear Regression A nursing instructor wishes to see whether a student's grade point average and age are related to the student's score on the state board nursing examination. She selects five students and obtains the following data. Student A B D E GPAX₁ 3.2 2.7 2.5 3.4 2.2 Age x₂ 22 27 24 28 23 State board score y 550 570 525 670 490 My Solutions > a) Refer to fitlm. From its output, determine the b0, b1, and b2. Do not simply enter the values but work with objects in MATLAB. You can also search How to get the p-value as an output of fitlm on MATLAB Answers. b) Predict a student's state board score who has a GPA of 3.0 and who is 25 years old. The multiple regression equation is y = bo+b₁x₁ + b2x2. c) Obtain the Coefficient of Determination (R²) from fitlm's output. Check LinearModel. d) Obtain the F-statistic using coefTest. Its value must be the same as that of fitlm with some discrepancy due to rounding off.
Part 3 You are part of a team responsible for running a successful video streaming service with millions of views daily. For marketing and research reasons, you have been asked to implement an algorithm that efficiently finds the k most viewed videos daily. You should expect k<
esc 3 A Question 14 of 20: Select the best answer for the question. 14. Use Gauss-Jordan elimination to solve the following linear system: -3x + 4y = -6 5x - y = 10 O A. (2,0) O B. (2,-5) O C. (-6,2) O D. (2,2) O Mark for review (Will be highlighted on the review page) > חח D G $ 4 { 3 R ند 19 F % 50 T Oll SADE A GY O U *∞ C 8 A
Knapsack 0/1 problem: Given N items where each item has some weight and profit associated with it and also given a bag with capacity W, [i.e., the bag can hold at most W weight in it]. The task is to put the items into the bag such that the sum of profits associated with them is the maximum possible. Given the problem is solved using a dynamic programming approach and the matrix derived is given below, answer the below set of questions by analyzing the DP matrix. weights = [2, 3, 4, 5], profits = [1, 2, 5, 6], Capacity W = 8 Capacity 2 3 Profits weights|0 1 2 5 16 14 |-> 5 10 0 O 10 1 2 3 4 0 O 0 1 1 0 1 0 1 O 10 1 2 2 2 5 2 O 15 50 1 356 6 O 1 3 6 18 00378 7 10 10 1 3 7 7 1 18
Artificial Inteligence
2 To 000 Total = 0 TL 1 001 Total = 0.5 TL 1 010 Total = 1 TL A Coca-Cola vending machine can accept coins of value 0.5 TL (Turkish Lira) and 1 TL. The door (output hole) of the vending machine is released (i.e. a Coca-Cola can is dropped/sold) when the amount of money received is equal to or greater than 2.5 TL. Assume that the machine accepts one coin at a time. Also assume that the machine goes to the initial state after releasing the door. Complete the given ASM chart according to the above description. Hint: = 1 iff a coin of value 0.5 TL is input to the machine. input signal x input signal y = 1 iff a coin of value 1 TL is input to the machine.
Rod cutting problem: A cutting factory buys long steel rods and then and cuts them into shorter rods, which it then sells. Each cut is free. The selling price is based on the length of the cut. The factory want to determine the best cuts in order to maximize its revenue. Below, the price that the factory can make for each length of rod is given. Determine the maximum revenue, rn, obtainable by cutting up the rod and selling the pieces using bottom-up dynamic-programming approach. Length, I 1 2 3 4 5 6 7 Price, pi 2 4 5 6 9 10 12 r5 = ?