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

Why can the number of iterations only increase so far when utilizing the waterfall model?
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?
annotate the attached graph with the maximum flow
Alert: Don't submit AI generated answer. Alert: Don't submit hand written solution strictly.
With Given the endpoints (21, 11) and (31, 19), using Bresenham’s Line Algorithm for abs (m) < 1,i. Calculate the slope of the lineii. Determine the initial decision parameteriii. Generate the successive decision parametersiv. Create a Scan Conversion table based on the parameters deduced in (i), (ii), and (iii)v. Plot the line and graphically re-calculate its gradient
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
Why can the number of iterations only increase so far when utilizing the waterfall model?
Problem 2. The two problems below can be solved using graph coloring. For each problem, represent the situation with a graph, say whether you should be coloring vertices or edges and why, and use the coloring to solve the problem. a. Your Quidditch league has 5 teams. You will play a tournament next week in which every team will play every other team once. Each team can play at most one match each day, but there is plenty of time in the day for multiple matches. What is the fewest number of days over which the tournament can take place? b. Ten members of Math Club are driving to a math conference in a neighboring state. However, some of these students have dated in the past, and things are still a little awkward. Each student lists which other students they refuse to share a car with; these conflicts are recorded in the table below. What is the fewest number of cars the club needs to make the trip? Do not worry about running out of seats, just avoid the conflicts. Student: A B C D E F…
If a problem has 12 boolean variables, how many full joint probabilities would you need to add up to find P(a v b)