You have a knapsack that can hold 20 pounds.You can fill your knapsack with any items from the following list.ItemWeightValueObject A4 pounds$480Object B5 pounds$500Object C6 pounds$480Object D7 pounds$490Object E8 pounds$520Your goal is to pick the objects that maximize the total value of your knapsack, with the condition that the chosenobjects weigh at most 20 pounds.In the 0-1 Knapsack Problem, the solution is easily seen to be Objects B + D + E, which has a total weight of 5+7+8 =20 pounds, and a total value of $500+$490+$520 = $1510.%3DIn the Fractional Knapsack Problem, you are allowed to take f of each object, where f is some real number between 0and 1. For example, you can take all of Object A, 1/2 of Object C, all of Object D, and 3/4 of Object E.This leads to a solution with total weight 4 + 1/2 x (6) + 7 + 3/4 × (8) = 20 pounds and a total value of $480 + 1/2 ×($480) + $490 + 3/4 × ($520) = $1600.Can you do better?For the Fractional Knapsack Problem, determine the maximum total value of your backpack. Richard has blocked off six weeks from early-May to mid-June to create timetables for high schools in BritishColumbia. (His work in school timetabling is part of his consulting e and his research .)During these six weeks (i.e, 30 work days), schools request Richard for a certain time interval.For the purposes of this problem, assume there are eight schools (labelled A, B, C, D, E, F, G, H), where each school isonly available to work with Richard during these time intervals.A. [21,25]В. [8,14]C. [20,30]D. [24,29]E. [1,9]F. [2,6]G. [16,22]Н. [13,17]For example, School H is requesting Richard on Days 13, 14, 15, 16, 17. They need to work with Richard on all fivedays, and they are unavailable on all of the other days.Richard refuses to double-book clients. In other words, if he accepts a contract with School E, he will not work withSchool F (since the intervals [1,9] and [2,6] overlap), nor with School B (since the intervals [1,9] and [8,14] overlap).Richard charges the same amount for each timetable, regardless of the length of the school's contract. Thus, School H(with only five days of work) would pay Richard the exact same amount as School C (with eleven days of work).Naturally, Richard wants to maximize his total revenue.To do this, he needs your help to figure out which schools to work with.Determine the choice of schools that will enable Richard to maximize his total revenue.

Answer: Program in C++: #include <bits/stdc++.h> using namespace std; // Structure for an…

Answered: For the Fractional Knapsack Problem,…

Engineering

Computer Science

For the Fractional Knapsack Problem, determine the maximum total value of your backpack.

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

I need the answer as soon as possible
6...
Chemical reaction rates are proportional to a rate constant, k, which changes with temperature according to the Arrhenius equation k=k0e-Q/RT For a certain reaction Q = 8,000 cal/mole R = 1.987 cal/mole K k 0 = 1200 min 1 k0=1200min-1 For this question you will need to draw a graph in Matlab for the values of k for temperatures from 100 K to 500 K, in 15-degree increments.
Four individuals wish to traverse an unstable bridge; they all start on the same side. You have 17 minutes to get everyone to the opposite side. Night has fallen, and they have only one torch. Two individuals may cross the bridge at once at most. Any crossing party, whether one or two individuals, must carry a torch. The torch must be carried back and forth; it cannot, for instance, be hurled. Person 1 crosses the bridge in one minute, person 2 in two minutes, person 3 in five minutes, and person 4 in ten minutes. A dyad must trek together at the slower individual's cadence. Create the algorithm specification that solves the problem.
There are 22 gloves in a drawer: 5 pairs of red gloves, 4 pairs of yellow, and 2 pairs of green. You select the gloves in the dark and can check them only after a selection has been made. What is the smallest number of gloves you need to select to have at least one matching pair in the best case? in the worst case?
(a)Find an appropriate algorithm for the given problem. (b)Draw the graph. (c)Find the maximum speed. (You need to show the necessary steps of the simulations)
Could you show the big 0 notation for each line and explained the worst case, please? thanks in advance!
) Give two real-life problems / scenarios where you can use a graph algorithm to solve it. Explain how each problem can be modeled as a graph problem. You cannot use google maps and social networking sites
In no more than 5 lines, define the water fall model.
Create a mathematical model of population growth in which the growth ratio is highest at a certain optimal population size, but it goes down as the population deviates from the optimal size. Then simulate its behavior and see how its behavior differs from that of the logistic growth model....i need Python code and discussion
You have 1000 bottles of Coke, and one of them is tainted. You have ten test strips that can detect poison. A single drop of poison will permanently render the test strip positive.You can place any number of droplets on a test strip at once and reuse it as many times as you like (as long as the results are negative). However, you can only do tests once every day, and the results are returned after seven days. How would you solve the poisoned bottle in the shortest amount of time?Follow up: Write code to simulate your approach
Two Dice were tossed. What is the probability that the total of two dice will be greater than 9, given that the first die is a 5? (Show your work)