You are givenn items sorted based on hi ratio and the knapsack capacity is W. Now, what is the time complexity of fractional knapsack problem? O(n log n) O(n) O(n*n) O(nW) You are given 4 items as {value, weight} pairs in this format {{20, 5}, {60, 20},{25, 10}, {X,25}}. You can assume that the array is sorted ratio. The capacity of knapsack is 39. The item no. 4 (whose weight is 25 ) is taken fractionally to fill upto the knapsack value weight based on the capacity. That fraction is represented in format. What is the lowest possible value of a?

You are givenn items sorted based on hi ratio and the knapsack capacity is W. Now, what is the time complexity of fractional knapsack problem? O(n log n) O(n) O(n*n) O(nW) You are given 4 items as {value, weight} pairs in this format {{20, 5}, {60, 20},{25, 10}, {X,25}}. You can assume that the array is sorted ratio. The capacity of knapsack is 39. The item no. 4 (whose weight is 25 ) is taken fractionally to fill upto the knapsack value weight based on the capacity. That fraction is represented in format. What is the lowest possible value of a?

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 are a movie theater manager. You are given a two-dimensional array with 6 rows and 6 columns - 36 elements with O value, that represent empty theater seats. All 36 tickets for session were sold, so you need to identify all of the seats with value 1. Write a program that replaces all O values in the given array, by 1 and outputs the resulting matrix. Use nested for-loops to iterate over two-dimensional matrix.
If A={8,12,16,20} and B={12,16,20,24,28}, what is the value of P (A and B)?
Java Only Solution: Let's consider a rectangular R table containing N rows and M columns. Rows are numbered 1 to N from top to bottom. Columns are calculated from 1 to M from left to right. Each element of R is a non-negative number. R is pronounced steadily if the total number of elements in the ith line is not less and then the total number of elements in the i-line (1) th for each i lapho is 2 Kanye N and the total element in the Nth line is less than or equal to M. Your job is to find the number of fixed tables of different sizes N x M modulo 1 000 000 000 000 Using the Java Programming language. Input: 1 11 Output: 2
You are given 4 items as (va/ue, weightpairs in this format {{20, 5}, {60, 20}, (25, 10},{X,25}}You can assume that the array is sorted based on the ratio. The capacity of knapsack is 50. The item no. 4 (whose weightis 25) is taken fractionally to fill upto the knapsack capacity. That fraction is represented in format. What is the lowest possible value of 67 For the question above, assume the total value stored in the knapsack is 135 after you have filled upto the knapsack capacity What is the value of Xin other words, the valun the item no. 4) ? dive your aniswer to at least to decimal paces.
A matrix is an array of numbers of size m by n (i.e., m x n). When we multiply 2 matrices, we multiply the matching numbers, then sum them up. Multiplying a matrix of size m x n with another matrix of size n x q will result in a matrix of size m x q. An example is shown in Figure 1: [ ? ? ? ? ? ? ] x [ ? ? ? ? ] = [ ?? +?? ?? + ?? ?? + ?? ?? + ?? ?? + ?? ?? + ?? ] Matrix 3 x 2 Matrix 2 x 2 Matrix 3 x 2 Figure 1: Multiplication of Matrix 3 x 2 and 2 x 2 Write a C++ program that multiplies 2 matrices and return the sum of the transposed matrix. Your program shall include the following: a) Define two 2 dimensional arrays, M and N that each represents a matrix of size 3 x 2 and a matrix of size 2 x 2. Request the user to enter the values for the 2 arrays using advanced pointer notations (refer to your slides for the list of array pointer notations). b) Create a function named multMatrix() that passes as arguments, the values of array M and N, multiplies them and store the results in a new…
EXAMPLE:Suppose we have the following weighted intervals. start finish weight 11 14 4 10 13 5 9 11 5 11 14 3 8 9 2 To solve the problem, we start out by sorting the intervals by finish time. This gives us the following. start finish weight 8 9 2 9 11 5 10 13 5 11 14 4 11 14 3 Next we calculate the p-values. P(j) = k where interval k is the last interval prior to interval j in the list below which does not conflict with interval j, or P(j) = 0 if all intervals prior to interval j conflict with it. # start finish weight P 1 8 9 2 0 2 9 11 5 1 3 10 13 5 1 4 11 14 3 2 5 11 14 4 2 Finally, we use the formula OPT(j) = max{OPT(j-1), weight(j)+ OPT(P(j))} to fill in the OPT value for each j. (The base case where j=1 is that…
Imagine a collection of nuts and bolts that are all together in one pile on a table. Describe, in pseudocode, how you would find all matching pairs of nuts and bolts. You need to find one solution for each of the problem-solving approaches given below. For each of your solution, determine how many comparisons of pairs of nuts and bolts you might have to make in the best- and worst- case scenario. You can assume that there are complete pairs, no single nuts or bolts, and that for each bolt, there is exactly one nut that fits. Describe a solution to the nuts and bolts problem (in pseudocode) using a Divide and Conquer Approach.
Exercise Generate a log-log plot of your period T vs. dynamic mass ma. This is the same plot that you drew on the log-log graphing paper from your materials pack. Perform these steps: 1. Define lists or numpy arrays that contain your experimental data. For example, md = [0.10, 0,15, 0.20] defines a list of dynamic masses 0.1, 0.15 and 0.20 kg, and T = [0.75, 0.83, 0.91] defines a list of periods (in seconds). 2. Generate a log-log plot of T vs. ma that shows your data as points (not lines!) using plt.loglog() with the 'o' option. The dynamic mass should be on the horizontal (x) axis. 3. Add grid lines for both the "major" and "minor" ticks, and both axes. Look up the documentation of plt.grid() to see how this is done. Remember that you can get the documentation for any command by running it in a cell of its own and appending a question mark, e.g. plt.grid?. 4. The axis tick labels will likely show up in scientific notation (e.g. 6 × 10−²). For our values (mostly in the 0.1...1 kg…
You are given 4 items as (value, weightpairs in this format {{20, 5), (60, 20), (25, 10), (X, 25}}You can assume that the array is sorted based on the ratio. The capacity of knapsack is 50. The item no. 4 (whose weights 25) is taken fractionally to fill upto the knapsack capacity. That fraction is represented in format. What is the lowest possible value of ? weight
IN JAVA, USING RECURSION PLEASE Create a method int[][] generateMatrix(int row, int col, int boundary1, int boundary2, int iteration) that generates a random matrix with random numbers between [min(boundary1, boundary2), max(boundary1, boundary2)). The sum of the diagonal and the sub-diagonal should be the same. If not, regenerate it again, until a matrix that satisfies the condition is generated (return that matrix). If you try iteration times and none of the matrixes satisfy the condition, return null.
Given two arrays A and B of equal size N, the task is to find if given arrays are equal or not. Two arrays are said to be equal if both of them contain same set of elements, arrangements (or permutation) of elements may be different though.Note : If there are repetitions, then counts of repeated elements must also be same for two array to be equal. Example 1: Input: N = 5 A[] = {1,2,5,4,0} B[] = {2,4,5,0,1} Output: 1.
Imagine a collection of nuts and bolts that are all together in one pile on a table. Describe, in pseudocode, how you would find all matching pairs of nuts and bolts. You need to find one solution for each of the problem-solving approaches given below. For each of your solutions, determine how many comparisons of pairs of nuts and bolts you might have to make in the best- and worst-case scenario. You can assume that there are complete pairs, no single nuts or bolts and that for each bolt, there is exactly one nut that fits. Describe a solution to the nuts and bolts problem (in pseudocode) using a Divide and Conquer Approach.