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?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 18SA

See similar textbooks

Similar questions

Note: Your solution should have O(n) time complexity, where n is the number of elements in l, and O(1) additional space complexity, since this is what you would be asked to accomplish in an interview. Given a linked list l, reverse its nodes k at a time and return the modified list. k is a positive integer that is less than or equal to the length of l. If the number of nodes in the linked list is not a multiple of k, then the nodes that are left out at the end should remain as-is. You may not alter the values in the nodes - only the nodes themselves can be changed.
Let X(1..n) and Y(1..n) contain two lists of n integers, each sorted in nondecreasingorder. Give the best (worst-case complexity) algorithm that you can think for finding(a) the largest integer of all 2n combined elements.(b) the second largest integer of all 2n combined elements.(c) the median (or the nth smallest integer) of all 2n combined elements.For instance, X = (4, 7, 8, 9, 12) and Y = (1, 2, 5, 9, 10), then median = 7, the nthsmallest, in the combined list (1, 2, 4, 5, 7, 8, 9, 9, 10, 12). [Hint: use the conceptsimilar to binary search]
The time complexity equation of merger-sort is T(n) = 2* T(n/2) + n, where T(1) = C and C is a constant. Solve this equation by giving detailed steps. If you have an equation like the following T(n) = 3* T(n/3) + n, where T(1)=T(2)=C, what would be T(n)?
For the problem, give pseudocode for your solution, and remember to include a proof of correctness and runtime. Note that in general, faster algorithms will receive more credit, so a brute force O(n 2 ) algorithm will not get many points if there is a faster O(n) or O(n log n) alterative. In IR2 , we define a slab to be a pair of parallel lines. Given a set of points P in IR2 , find the narrowest slab containing P, where the width of the slab is the vertical distance between its bounding lines.
You will analyze three algorithms to solve the maximum contiguous subsequence sum problem, and then evaluate the performance of instructor-supplied implementations of those three algorithms. You will compare your theoretical results to your actual results in a written report. What is the maximum contiguous subsequence sum problem? Given a sequence of integers A1, A2, ..., An (where the integers may be positive or negative), find a subsequence Aj, ... , Ak that has the maximum value of all possible subsequences. The maximum contiguous subsequence sum is defined to be zero if all of the integers in the sequence are negative. Consider the sequence shown below. A1: -2 A2: 11 A3: -4 A4: 13 A5: -5 A6: 2 The maximum contiguous subsequence sum is 20, representing the contiguous subsequence in positions 2, 3, and 4 (i.e. 11 + (-4) + 13 = 20). The sum of the values in all other contiguous subsequences is less than or equal to 20. Consider a second sequence, shown below. A1: 1…
Suppose we are to sort a set of 'n' integers using an algorithm with time complexity O (log2 n) that takes 0.5 ms (milliseconds) in the worst case when n = 20,000. How large an element can the algorithm then handle in 1 ms? (Note that only numeric answers can be provided.)
In the sequence alignment problem, suppose you knew that the input strings were relatively similar, in the sense that there is an optimal alignment that uses at most k gaps, where k is much smaller than the lengths m and n of the strings. Show how to compute the NW score in O((m+n)k) time.
we consider a problem where we are given a set of coins andour task is to form a sum of money n using the coins. The values of the coins arecoins = {c1, c2,..., ck}, and each coin can be used as many times we want. Whatis the minimum number of coins needed?For example, if the coins are the euro coins (in cents){1,2,5,10,20,50,100,200}and n = 520, we need at least four coins. The optimal solution is to select coins200+200+100+20 whose sum is 520.
Consider the LCS problem discussed in class. Suppose we only want to compute the length of the LCS of x[1..m] and y[1..n] (i.e. we do not care about the actual subsequence itself). This means we do not need to “traceback” to find the LCS. In this setting, show how the algorithm can be altered so that it only needs min(m,n) + O(1) space rather than m · n space (note that it must be min(m,n) and not O(min(m, n))).
Apply the bottom-up dynamic programming algorithm to the followinginstance of the knapsack problem: Item Weight Value 1 3 $25 2 2 $30 3 1 $15 4 4 $40 5 5 $50 Capacity W = 8.
What is the worst case size of SL and SR (in terms of n) when you divide a list of unsorted items of size n into groups of (2*9)+1 while selecting a pivot? Input your answer as a decimal to three places. E.g. 3n/8 would be 0.375
We argued in class that if the input is not uniformally distributed, the worst-case running time of Bucket Sort (using Insertion Sort in each bucket) in O(n^2). The reason: all those numbers could fall in the same bucket, and then the time of Insertion sorting then dominates. How many out of the total n numbers could fall in one bucket and the algorithm still run in linear time if the rest are evenly distributed? (Choose one option, no points if you choose more than one.) A. O(1)B. O(√n)C. O(On)D. O(log n)E. None of the above