In the rod cutting problem, we are given a rod of length n, along with pi, which indicates the price of a rod/piece of length pi, for i = 0,1, 2, ....,n. Consider the following instance: Po = 0, pi = 2, p2 = 7,p3 = 15, p4 = 16 and n = 4. Let r; denote the maximum profit you can obtain by cutting a rod of length i into smaller pieces (or by making no cuts). What is the respective value of rɔ, rı, ...,rq? You must show how you obtained the values by applying the recurrence.

In the rod cutting problem, we are given a rod of length n, along with pi, which indicates the price of a rod/piece of length pi, for i = 0,1, 2, ....,n. Consider the following instance: Po = 0, pi = 2, p2 = 7,p3 = 15, p4 = 16 and n = 4. Let r; denote the maximum profit you can obtain by cutting a rod of length i into smaller pieces (or by making no cuts). What is the respective value of rɔ, rı, ...,rq? You must show how you obtained the values by applying the recurrence.

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

If the first number in a sequence is a positive integer, x Let ao= x, an is defined as follows if an is even, then an+1 = an/2 if an is odd, then an+1 =3 *an+ 1 Then there exists an integer k, such that ak =1 For example, if: 75, then k = 14 and the numbers in the sequence are: 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1. The largest number in the sequence is 340 and it is a position 4 in the sequence (assuming 75 is at position 1) Design and implement a complete C++ program that will • read a series of integers (greater than 0) from a file and for each integer display (to the screen) − the integer − the number of steps it takes to reach 1 − the largest value in the sequence and its position
You are going to purchase items from a store that can carry a maximal weight of 'w' into your knapsack. There are 5 items in store available and each items weight are Wi and the worth of these items are Pi dollars. What items should you take and how using Knapsack algorithm?The weight of knapsack depend upon the sum of your two digits of age for example suppose your age is 25 then sum of age becomes 7. The list of items and their respective weight withprice are given in table. Items Weight Price A Total count of your first name Total count of your first namedivide by 2 B 3 Your roll no mod 5 C Second digit of your roll no 5 D Total count of your last name Total count of your first namedivide by 2 E Your roll no mod 3 S Sum of roll no mod 13
Fast Answer and must be correct this time else downvote
We examine a problem in which we are handed a collection of coins and are tasked with forming a sum of money n out of the coins. The currency numbers are coins = c1, c2,..., ck, and each coin can be used as many times as we want. What is the bare amount of money required?If the coins are the euro coins (in euros) 1,2,5,10,20,50,100,200 and n = 520, we need at least four coins. The best option is to choose coins with sums of 200+200+100+20.
An investor has $621,000 to invest in bonds. Bond A yields an average of 8% and the bond B yields 7%. The investor requires that at least 5 times as much money be invested in bond A as in bond B. You must invest in these bonds to maximize his return. This can be set up as a linear programming problem. Introduce the decision variables: dollars invested in bond A dollars invested in bond B Compute . $ . Round to the NEAREST CENT
Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y= 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10 Ex: If the input is: 8733 -5 -1 Then the output is: x = 3 , y = 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: There is no solution Assume the two input equations have no more than one solution. Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy. 461710.3116374.qx3zqy7 LAB ACTIVITY 1 2 a = int(input()) 3 b= int(input()) 4 c = int(input()) 5 5.20.1: LAB: Brute force equation solver 111 6 Read…
Consider the following program, in which a, b, and c are the last 3 digits of your student ID number (for example, if you student ID is 170123456, then you should substitute 4 for a, 5 for b, and 6 for c in the program): maximise axı + 3x2 + x3 subject to -bx1 – x2 + 2x3 > 6 -x2 + x3 = 1 - cx1 + 2x2 – 2x3 0 (i) Give the initial starting tableau for the 2-phase simplex algorithm for this program. (ii) Carry out the 2-phase simplex algorithm on this problem. You should give an optimal solution to the program or say why an optimal solution does not exist. Show your work and explain how you determined if the program is feasible or not at the end of the first phase.
A thief is about to rob the house. The cops are on their way. He has to quickly fill his bag and escape. Considering the items listed below, list the items to include in his bag so that the total weight is less than or equal to 10kg (the weight limit) and the total benefit is maximized. TV: 5kg - 9$ Jewelry : 2kg - 7$ (probably imitation) Clock : 2kg - 3$ An old radio : 4kg - 2$ Show me the array representation, if you want to take full credits.
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.
Minimize the function given below F (A,B,C,D)=€(0,1,2,3,5,8,13,11)
We want to buy the car depending on its cost for 10 years. Here is the algorithm for deciding which car to buy dependir a price of OMR 4.000 per liter of gas and usage of 15,000 kilometers per year. For each car, compute the total cost as follows: annual fuel consumed = annual miles driven / fuel efficiency %3D annual fuel cost = price per gallon x annual fuel consumed operating cost = 10 x annual fuel cost total cost = purchase price + operating cost If total cost1 total cost2 Choose car2. Else Choose car1 or car2 Use these sample values: Car 1: purchase price: OMR 25,000, fuel efficiency: 10 kms/liter, Car 2: purchase price: OMR 20,000, fuel efficiency: 15 kms/liter What is the outcome of the algorithm. O a. Choose car 2 O b. Choose car 1 O c. Choose car1 or car2 O d. Choose car1 and car2
If you have been given the full amount required and the list represents the amount of change in your pocket, decide whether you can afford the item or not. Change will always be represented as follows: quarters, dimes, nickels, pens. Illustration: change Enough ([25, 20, 5, 0], 4.25) should prove true, as having 25 quarters, 20 dimes, 5 nickels and 0 pens gives you 6.25 + 2 + .25 + 0 = 8.50. Examples changeEnough ([2, 100, 0, 0], 14.11) → false changeEnough ([0, 0, 20, 5], 0.75) →> true changeEnough ([30, 40, 20, 5], 12.55) → truth changeEnough ([10, 0, 0, 50], 3.85) → false change Enough ([1, 0, 5, 219], 19.99) → false Solve in Java script