1. a. Apply the bottom-up dynamic programming algorithm to the following instance of the knapsack problem: item 1 23 45 weight 3 2 1 4 5 value $25 $20 $15 $40 $50 capacity W = 6. b. How many different optimal subsets does the instance of part (a) have? c. In general, how can we use the table generated by the dynamic program- ming algorithm to tell whether there is more than one optimal subset for the knapsack problem's instance?

1. a. Apply the bottom-up dynamic programming algorithm to the following instance of the knapsack problem: item 1 23 45 weight 3 2 1 4 5 value $25 $20 $15 $40 $50 capacity W = 6. b. How many different optimal subsets does the instance of part (a) have? c. In general, how can we use the table generated by the dynamic program- ming algorithm to tell whether there is more than one optimal subset for the knapsack problem's instance?

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

Consider the problem of providing change for an amount of n-bahts while using the smallest possible quantity of coins. You may assume that each coin’s value is integer. Assume that the coins available for use have values that can be expressed as powers of c. To clarify, the denominations of the coins can be written as c0,c1,..., ck , where c is an integer greater than 1, and k is a positive integer. Prove that the greedy algorithm always yields an optimal solution.
Consider the following instance of 0-1 Knapsack problem: Item 11 12 14 15 Profit 6 5 9 Weight 5 5 8 The maximum weight of 16 Kg is allowed in the knapsack. The assumption is that each time an item is either taken completely or is left behind; she cannot take a fractional amount of an item or take an item more than once. Given the above set-up, using BRANCH AND BOUND methodology pick a subset of these items such that their total weight is no more than 16 Kg and their total value is maximized.
using dynamic programming, which is the optimal value in the case of knapsack problem, where the maximum capacity of knapsack is 6 Item: 1 2 4 1 Profit: 12 25 30 18 10 Weight: 2 3 4 3 1 Select one: 47 35 50 43 O O
You have to solve it Using Python Programming language.
Consider the two strings/sequences X = (B, A, N, A, N, A) (P, A, N, O, R, A, M, A) of characters. Apply the Edit Dis- tance algorithm to X and Y to compute an optimal solution. Show your work (the contents of the table), and use the table to give an JII. %3D and Y = optimal solution.
8. A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonablo time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate? O A Unreasonable algorithms may sometimes also be undecidable O B. Heuristics can be used to solve some problems for which no reasonable algorithm exsts O C. efficiency Two algorithms that solve the same problem must also have the same O B. Approximate solutions are often identical to optimal solutions
A student has been asked to put some parcels on a shelf. The parcels all weigh different amounts, and the shelf has a maximum safe loading weight capacity of 150 Kg. The weight of parcels are as follows (in Kg): The student has been asked to load the maximum weight possible parcels on the shelf subject to the maximum safe loading weight. State two possible approaches for a greedy algorithm solution to solve this problem. In each case, state clearly the result you would get from applying that approach to this problem, stating whether the solution is optimal or not. If your answer does not produce an optimal solution, what algorithm could be employed to find one?
Given the following input instance for the 0/1 Knapsack problem. Show how the algorithm given in the class works on this input instance. Complete the whole (M+1)x(n+1) table, and give the answer for the optimal solution, where M is the capacity of the knapsack and n is the number of objects. Object 1 Object 2 Object 3 Object 4 Object 5 Object 6 Profit p Weight w; | 2 3 3 5 5 1 4 4 5 3 2 5 М-10
Correct answer Will be upvoted else downvoted. subsquare is any square piece of the stand, I. e. any set S(i0,j0,k)={ci,j | i0≤i<i0+k,j0≤j<j0+k}S(i0,j0,k)={ci,j | i0≤i<i0+k,j0≤j<j0+k} with 1≤i0,j0≤n−k+11≤i0,j0≤n−k+1. Kostya actually doesn't have the foggiest idea the number of tiles he wants, so he considers the subsquares of every conceivable size. He doesn't need his restroom to be excessively bright. Assist Kostya with counting for each k≤nk≤n the quantity of subsquares of size k×kk×k that have all things considered qq various shades of tiles. Two subsquares are considered unique if their area on the stand is unique. Input The main line contains two integers nn and qq (1≤n≤15001≤n≤1500, 1≤q≤101≤q≤10) — the size of the stand and the cutoff on the quantity of particular tones in a subsquare. Each of the following nn lines contains nn integers ci,jci,j (1≤ci,j≤n21≤ci,j≤n2): the jj-th integer in the ii-th line is the shade of the tile in the cell (i,j)(i,j).…
The monotone restriction (MR) on the heuristic function is defined as h (nj ) 2 h (ni ) - c (ni , nj ). Please prove the following: 1. If h(n)
Let's look at the minimax search tree illustrated in Figure 2. In this diagram, black nodes represent decisions made by the MAX player, while white nodes represent decisions made by the MIN player. The squares at the terminal nodes represent payments, with the number indicating the amount paid from MIN to MAX (a 0 indicates no payment from MIN to MAX). MAX aims to maximize the payment they receive, while MIN aims to minimize the payment they make. If we apply the α-β pruning algorithm, we can analyze the minimax tree as shown in Figure 2. (a) Assume that we iterate over nodes from right to left; what are the arcs that are pruned by α-β pruning, if any? (b)Does you answer change if we iterate over nodes from left to right?