2. First apply greedy approach to solve this 0-1 knapsack problem. After that solve the given problem using dynamic programming approach. Compare the results between dynamic programming and greedy approach, which approach gives optimal result? Find out the maximum profit and which items should be picked up. (Knapsack Weight=25).

2. First apply greedy approach to solve this 0-1 knapsack problem. After that solve the given problem using dynamic programming approach. Compare the results between dynamic programming and greedy approach, which approach gives optimal result? Find out the maximum profit and which items should be picked up. (Knapsack Weight=25).

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

PLEASE HELPPPP with work and code to go along with it
Given a knapsack of capacity W = 1.5Kg, solve the following 0/1 knapsack problem using DP. Illustrate the procedure and determine the subset of items. Item Weight (Kg) Value ($) 1 0.6 800 2 0.3 400 3 0.4 600 4 0.9 1000 0.5 500
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 TELE 1 3 1 11 2 2 2 10 3 4 3 30
A person is cutting a long board of wood into different length of pieces . Each cutting has fixed width 2 cm lengths. Given that each cutting with different length has a different price, Now, we are required to help this person to find the optimal cuts in order to increase his income. Consider following example showing different cut’s lengths and their equivalent prices. Input: board length = 4 Length [ ] = [1, 2, 3, 4, 5, 6, 7, 8] Price [ ] = [2, 6, 8, 10, 14, 17, 19, 20] Output: Best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12 [Explanation: the possible cuts and profit of each is as follows: As noted the best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12
8. A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonablo time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate? O A Unreasonable algorithms may sometimes also be undecidable O B. Heuristics can be used to solve some problems for which no reasonable algorithm exsts O C. efficiency Two algorithms that solve the same problem must also have the same O B. Approximate solutions are often identical to optimal solutions
A student has been asked to put some parcels on a shelf. The parcels all weigh different amounts, and the shelf has a maximum safe loading weight capacity of 150 Kg. The weight of parcels are as follows (in Kg): The student has been asked to load the maximum weight possible parcels on the shelf subject to the maximum safe loading weight. State two possible approaches for a greedy algorithm solution to solve this problem. In each case, state clearly the result you would get from applying that approach to this problem, stating whether the solution is optimal or not. If your answer does not produce an optimal solution, what algorithm could be employed to find one?
Using the following coin denominations as an example: 1, 5, 20 and 23, explain why the greedy solution for the change-making problem does not result in an optimal solution
N Mel and wand d 000 (3) Consider the following knapsacu problem. The size of Knap Sack is 60. Compute the maximum profit using Greedy algorithm and Identity the objects placed in the the bag 2 Object 3 405 5 Profit 30 40 45 77 90 15 Weight 5 25 10 22
Cse