Problem In this assignment, you are required to implement the fractional knapsack problem. In a fractional knapsack problem, there exists a knapsack of capacity W, set of n items and each item i has a positive benefit b, and a positive weight w, . Your goal is to write a program in a language of your own choice that chooses items with the maximum total benefit but with weight at most W. You are allowed to take fractional amount of an item if you need to do so. You must use a heap-based priority queue in your implementation. Input: The first line of the input takes n, the number of items. In the next n lines, for each item (from 1 to n), you take the weight and the corresponding benefit. In the last line you take the knapsack capacity W from the user.

Problem In this assignment, you are required to implement the fractional knapsack problem. In a fractional knapsack problem, there exists a knapsack of capacity W, set of n items and each item i has a positive benefit b, and a positive weight w, . Your goal is to write a program in a language of your own choice that chooses items with the maximum total benefit but with weight at most W. You are allowed to take fractional amount of an item if you need to do so. You must use a heap-based priority queue in your implementation. Input: The first line of the input takes n, the number of items. In the next n lines, for each item (from 1 to n), you take the weight and the corresponding benefit. In the last line you take the knapsack capacity W from the user.

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

You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack. A queen is standing on an chessboard. The chess board's rows are numbered from to , going from bottom to top. Its columns are numbered from to , going from left to right. Each square is referenced by a tuple, , describing the row, , and column, , where the square is located. The queen is standing at position . In a single move, she can attack any square in any of the eight directions (left, right, up, down, and the four diagonals). In the diagram below, the green circles denote all the cells the queen can attack from : There are obstacles on the chessboard, each preventing the queen from attacking any square beyond it on that path. For example, an obstacle at location in the diagram above prevents the queen from attacking cells , , and : Given the queen's position and the locations of all the obstacles, find and print the number of…
Write a C-program to read marks in the Programming and DataStructure Laboratory (out of 100) for N (to be read before) students.Consider the interval of marks 0-5, 6-10, 11-15, and so on. Note thatthe first interval contains 6 numbers, and other intervals are of 5numbers. Find the interval of marks having maximum number ofstudents in the class and compute the difference between its centerpoint from the mean of the distribution of marks.Provide results for the following inputs:1. N=2045, 56, 60, 15, 80, 90, 12, 85, 35, 58,63, 73, 52, 78, 47, 23, 14, 58, 18, 962. N=3054, 65, 6, 51, 8, 9, 21, 58, 53, 85,36, 37, 25, 87, 19, 93, 44, 85, 17, 69,40, 0, 3, 33, 16, 63, 95, 69, 74, 38
In this work, we ask you to design a deterministic Finite Automaton (FA) to recognise arithmetic expressions. When we say arithmetic expression, we mean a kind of expression you can type in a very basic desk calculator. That is, neither variables nor brackets are allowed. It contains only numbers and four arithmetic operators, +, -, *, and /. The following are some examples of arithmetic expression: 1. Any number string with or without signs - e.g. 3, -1, +10, 3.14, -0.70 and 099. 2. Number strings mixed with arithmetic operators e.g. 3+5, -1+2*3, 7/10-0.7, and -1.4-+8.2. An example of FA diagram for recognising a non- negative integer is given below. You may use it as a start point. You need to add a few more states and transitions to handle numbers with decimal point and signs (e.g. -5, +2, 0.21, -32.6, +99.05, but not the form 1.0E-3). Most importantly, you also need to add a few more things to deal with the arithmetic operators +, -, *, /. →start 0-9 digit 0-9
1.Implement Thirsty problem using semaphore . Scenario:To drink, a thirsty person must have three things; water, ice and a glass.There are three thirsty people, each having a different one (and only one) of the three required items. A fourth person, a server has unlimited supply of all three items. If nobody is drinking, the server places two of the three items (chosen at random) onto table. Thirsty person who can make a drink from those two items will pick them up and drink a glass of ice water. When done, thirsty person will notify the server and the process will repeat.
Please help me Josephus Problem is a theoretical problem related to a certain counting-out game. On thiscase, people are standing in a circle waiting to be executed. After a specified number ofpeople are skipped, the next person is executed. The procedure is repeated with theremaining people, starting with the next person, going in the same direction and skippingthe same number of people, until one person remains, and is freed.Arrange the numbers 1 , 2, 3 , ... consecutively (say, clockwise) in a circle. Now removenumber 2 and proceed clockwise by removing every other number, among those thatremain, until one number is left. (a) Let denote the final number which remains. Find formula for .(b) If there are 70 people, what is the safe number (the number that remains)?
The wolf-goat-cabbage ProblemDescription of the problem: There is a farmer who wishes to cross a river but he is not alone. He also has a goat, a wolf, and a cabbage along with him. There is only one boat available which can support the farmer and either of the goat, wolf or the cabbage. So at a time, the boat can have only two objects (farmer and one other). But the problem is, if the goat and wolf are left alone (either in the boat or onshore), the wolf will eat the goat. Similarly, if the goat and cabbage are left alone, then goat will eat the cabbage. The farmer wants to cross the river with all three of his belongings: goat, wolf, and cabbage.Complete the state space of this problem. The green state is valid state (you should expand it until to reach the goal state) and orange state is invalid state (you should not expand it).• w: wolf• g: goat• c: cabbage• f: framer• ||: rive.
A Python Programming in Physics and Materials Science. In physics, chemistry and materials science, percolation refers to the movement and filtering of fluids through porous materials.(Wikipedia.org). Consider a simplified model below. Imagine, this is a filter or maybe some layers of stones such that when a certain amount of fluid is put on top, it will reach the bottom only if there is a direct passage. In this case, the blue squares serve as the porous materials or the holes where fluid may pass. Your task is to simulate this simple percolation by representing them in a 2-dimensional array. The input would be in a string, while the output would either be yes or no to indicate whether the fluid can pass through the filter or not. Example: Input: “1,0,0,0,0;0,1,0,0,0;0,1,0,0,0;0,0,1,0,0;0,0,0,1,0” Output: Yes Note: It should also work with these two inputs: “1” -> Yes “0” -> No
Python programming: fanis chose to visit his uncle's ranch. There are s animals and n animal pens on the him. For utility reason, creature pens are built in one line. Uncle let Theofanis know that a ranch is fortunate on the off chance that you can disseminate all animals in all pens so that there are no unfilled pens and there is something like one ceaseless section of pens that has precisely k animals altogether. In addition, a ranch is great in case it's fortunate for any conveyance without void pens. Neither Theofanis nor his uncle knows whether their ranch is great or not. Would you be able to take care of them to figure it? information :The primary line contains a solitary integer t (1≤t≤105) — the quantity of experiments. The sole line of each experiment contains three integers s, n, and k (1≤s,n,k≤1018; n≤s). Output: For each experiment, print YES (case-unfeeling), if the homestead is great, or NO (case-heartless) in any case
In a fractional knapsack problem The first line of the input takes n, the number of items. In the next n lines, for each item (from 1 to n),you take the weight and the corresponding benefit. In the last line you take the knapsack capacity Wfrom the user.Output:In the output, you print out the items (in the increasing order) that has been selected, and for each itemhow much amount has been taken into consideration and what is the profit made from each item. Thelast line output the maximum profit that can be made.Sample Input54 128 322 406 301 5010Sample Output:Item 2 Amount 1 Profit 4Item 3 Amount 2 Profit 40Item 4 Amount 6 Profit 30Item 5 Amount 1 Profit 50Total Profit: 124
Code in C++ only. Correct answer will upvoted else downvoted. framework of size n×m, with the end goal that every cell of it contains either 0 or 1, is considered lovely if the total in each adjoining submatrix of size 2×2 is actually 2, i. e. each "square" of size 2×2 contains precisely two 1's and precisely two 0's. You are given a network of size n×m. At first every cell of this network is unfilled. How about we indicate the cell on the crossing point of the x-th line and the y-th segment as (x,y). You need to handle the inquiries of three sorts: x y −1 — clear the cell (x,y), in case there was a number in it; x y 0 — compose the number 0 in the cell (x,y), overwriting the number that was there already (assuming any); x y 1 — compose the number 1 in the cell (x,y), overwriting the number that was there beforehand (assuming any). After each question, print the number of ways of filling the unfilled cells of the grid so the subsequent network is delightful. Since the appropriate…
A man given a task to get the height of vertical trees in a garden. We have to see how we can help him programmatically if we have few of the parameters. The man is able to measure the angle of elevation of the top of the tree from his measuring instrument. The measuring instrument is 1-8m above ground level. When the man is standing 19m from the base of the tree, the angle he measures is 56°. With the help of given parameters we can find the height of the tree is 29.97m (taking the nearest ciel value it will be 30m) Function Description Complete the function getHeightOfTree in the editor below. The function must state what must be returned or printed. functionName has the following parameter(s): angle: this is an integer dist: this is an float Consider showing the result in ceil value. Height or Distance are given in meters. Constraints • angle should be an positive integer, and it cannot be greater than or equal to 90 degree. • Instrument height is constant, i.e. 1.8m • dist is a…
We have n glasses which can hold a varying amount of liquid. We will say that glass1 is size q1 quarts and glass2 is size q2 quarts, etc. We now give you a size, say x quarts. You must give me a glass of exactly x quarts. You are allowed to fill any glass to exactly its size and to pour any liquid from one glass into another. When you pour, you either have to empty the glass you are pouring from or fill the glass you are pouring into. Can you do it?More concrete example: G1 has size 10 quarts. G2 has size 4 quarts. G3 has size 1 quart. You can get a 5 quart drink by filling G1, pouring 4 quarts from it into G2 and 1 quart of it into G1. After that, G1 has exactly 5 quarts. In the same problem, we could get 8 quarts by filling G2 twice and emptying it into G1 twice. Given This: Write an algorithm to do this and determine its complexity.