3.Apply the greedy algorithm to solve the continuous-knapsack problem of the following instances. There are 3 items. Each item has value and weight as follows. v1=5 w1-120, v2=5 w2=150, and v3=4 w3-200 Note that vi = value of item i and wi= weight of item i. The knapsack of capacity W is 300. What is the value of the most valuable subset of the items that fit into the knapsack?

3.Apply the greedy algorithm to solve the continuous-knapsack problem of the following instances. There are 3 items. Each item has value and weight as follows. v1=5 w1-120, v2=5 w2=150, and v3=4 w3-200 Note that vi = value of item i and wi= weight of item i. The knapsack of capacity W is 300. What is the value of the most valuable subset of the items that fit into the knapsack?

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

Write Algorithm for Straightforward pairings for a round robin tournament.in: round index r (0 ≤ r ≤ 2 · (n − 1)/2); number of players n (1 ≤ n)out: sequence R of n player indices indicating the match pairings between players R2i and R2i+1, when i = 0,..., n/2 − 1; if n is odd, Rn−1 indicates the restingplayer
Let's revisit our first problem, where we want to set up a series of chess matches so we can rank six players in our class. As we did before, we will assume that everyone keeps their chess rating a private secret; however, when two players have a chess match, the person with the higher rating wins 100% of the time. But this time, we are only interested in identifying the BEST of these six players and the WORST of these six players. (We don't care about the relative ordering or ranking of the middle four players.) Your goal is to devise a comparison-based algorithm that is guaranteed to identify the player with the highest rating and the player with the lowest rating. Because you are very strong at Algorithm Design, you know how to do this in the most efficient way. Here are five statements. A. There exists an algorithm to solve this problem using 6 matches, but there does not exist an algorithm using only 5 matches. B. There exists an algorithm to solve this problem using 7 matches,…
Computer engineering question
This assignment uses several heuristic search techniques to find possibly optimal truth assignments for variables in the given Boolean formulas (see the bottom of the assignment). The formulas are in conjunctive normal form (ANDs of ORs). The fitness of an assignment is the number of clauses (ORs) that the assignment satisfies. If there are c clauses, then the highest fitness is bounded by c. However, if the formula is not satisfiable, then you cannot simultaneously make all c clauses true. You will use three of the following seven techniques: DPLL Resolution Genetic algorithms Local search Simulated annealing GSAT WalkSAT You must choose at least one complete algorithm to implement - DPLL or Resolution.
Consider the doctor-patient problem. There is a Doctor's clinic which has one Doctor, one patient chair, and n chairs for waiting for patients if there are any to sit on the chair. If there is no patient, then the Doctor sleeps in his own chair. When a patient arrives, he has to wake up the Doctor. If there are many patients and the Doctor is treating a patient, then the remaining patients either wait if there are empty chairs in the waiting room or they leave if no chairs are empty. Write a solution (Algorithm / Pseudocode) using semaphores.
Show the differences between breadth first search and best first search in 8 Puzzle game. Start and goal states are given below. Sequence of operation must be up, down, left, right for blank tile and heuristic function is number of tiles out of place. Maximum 4 levels may be searched.
Suppose that a manufacturing company builds n different types of robots, sayrobots 1, 2, . . . , n. These robots are made from a common set of m types of materials, saymaterials 1, 2, . . . , m. The company has only a limited supply of materials for each year,the amount of materials 1, 2, . . . , m are limited by the numbers b1, b2, . . . , bm, respectively.Building robot i requires an aij amount from material j. For example, building robot 1requires a11 from material 1, a12 from material 2, etc. Suppose the profit made by sellingrobot i is pi. Write an integer linear program for maximizing the annual profit for thecompany
1. Let S = {1,2...n} be a set activities, where activity i € S has a start time si, a finish time f; and a profit p, asSociated with it. Design an dynamic programming algorithm for computing a set of compatible activities of maximum profit. Argue that the time complexity of you algorithm is O(n log(n)). (You must start with the correct definitions, and then write a recurrence relation.)
A robot can move horizontally or vertically to any square in the same row or in the same column of a board. Find the number of the shortest paths by which a robot can move from one corner of a board to the diagonally opposite corner. The length of a path is measured by the number of squares it passes through, including the ﬁrst and the least squares. Write the recurrence relation if you solve the problem by a dynamic programming algorithm.
Suppose you are provided an even number of people going on an adventure, and there are only two-seated rafts. All rafts are identical, weighing 20kg each. Each person is described by two parameters, their strength and weight. The speed of a raft can be calculated as the sum of strengths of both persons sitting in it, divided by the total weight of the loaded. We would like to choose the allocation of people to rafts so as to maximize the speed at which the whole group can travel, assuming that the group travels at the speed of the slowest raft in it. Develop a python code to find the maximum speed of the group which can be achieved by optimally choosing places for each person. Sample Input: 4 50 50 50 60 70 100 100 60 Sample Output: 0.8421052590012552
10 by 10 grid, . The agent in the top right corner, fast route to left bottom corner, some cells = easy terrain = 1 time unit. Some cells = rough terrain = 5 time units. Some cells = impassible terrain and cannot be traversed. -Write a Breathe first search Python function: A function that generates a list of lists to represent the 2D grid, where each grid cell contains the number of time units taken to traverse through it. Each cell should have a probability of 0.4 of being easy terrain, 0.4 of being rough terrain and 0.2 of being untraversable. E.g, map = RandomMap()
Please provide a solution for the Knapsack Problem using Genetic Algorithm: