Given a sequence A formed by n positive numbers and a positive integer d, we are interested in a distant max-product subsequence (MPS) of A, which is a subsequence of A formed by elements whose indices are at least d units apart and have the maximum product. Describe a dynamic programming algorithm that reports the product of the MPS of A. For example, if A = [2, 10, 12, 9, 1, 3, 5] and d = 2, the output should be 10 × 9 × 5 = 450. In your solution, it suffices to complete the first two steps of the DP algorithm. That is, define subproblems, describe the optimal for a larger subproblem as a function of the optimal solution for smaller subproblems, and write a recursive formula for the optimal value of a subproblem (remember to include the base case). Assume the indices start at 1.

Given a sequence A formed by n positive numbers and a positive integer d, we are interested in a distant max-product subsequence (MPS) of A, which is a subsequence of A formed by elements whose indices are at least d units apart and have the maximum product. Describe a dynamic programming algorithm that reports the product of the MPS of A. For example, if A = [2, 10, 12, 9, 1, 3, 5] and d = 2, the output should be 10 × 9 × 5 = 450. In your solution, it suffices to complete the first two steps of the DP algorithm. That is, define subproblems, describe the optimal for a larger subproblem as a function of the optimal solution for smaller subproblems, and write a recursive formula for the optimal value of a subproblem (remember to include the base case). Assume the indices start at 1.

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

A triple (x, y, z) of positive integers is pythagorean if x2 + y2 = z2. Using the functions studied in class, define a function pyth which returns the list of all pythagorean triples whose components are at most a given limit. For example, function call pyth(10) should return [(3, 4, 5), (4, 3, 5), (6, 8, 10), (8, 6, 10)]. [Hint: One way to do this is to construct a list of all triples (use unfold to create a list of integers, and then a for-comprehension to create a list of all triples), and then select the pythagorean ones. def unfold[A, S](z: S)(f: S => Option[(A, S)]): LazyList[A] = f(z) match { case Some((h, s)) => h #:: unfold(s)(f) case None => LazyList() } code in scala
Solutions to a dynamic programming problem have (at minimum) three things: – A recurrence relation – A brief description of what your recurrence function represents and what each case represents. – A brief description of the memory element/storage and how it’s filled in. – Always give complete solutions, not just examples.– Always declare all your variables, in English. In particular, always describe the specific - problem your algorithm is supposed to solve. – Never use weak induction.
Solutions to a dynamic programming problem have (at minimum) three things: – A recurrence relation – A brief description of what your recurrence function represents and what each case represents. – A brief description of the memory element/storage and how it’s filled in. – Always give complete solutions, not just examples.– Always declare all your variables, in English. In particular, always describe the specific - problem your algorithm is supposed to solve. – Never use weak induction.
Consider the following problem. You are given a list of words, each con- sisting of a sequence of one or more letters. The goal is to arrange the words in a sequence so that: ⚫the last letter of the first word is the same as the first letter of the second word ⚫the last letter of the second word is the same as the first letter of the third word .... and so on... ⚫the last letter of the next-to-last word is the same as the first letter of the last word 1 For a given sequence of words, we could ask the question, "is it possible to arrange the entire list of words into one such sequence?" Argue that this problem is in NP. Argue whether the problem posed in the question 2 above is in P.
Consider a Local Search procedure such as Random Hill Climbing which employs the 2-change modification as neighbourhood function and the following instance of the Travelling Salesman Problem: 10 During the execution of the search, the highlighted (in bold) tour is visited. This current tour has a length of (62): [A → C → B → E → D → A] Select ALL correct statements. D a. The 2-change modification neighbourhood for TSP is reversible. O b. None of the statements is correct. O c. The modification, REMOVE ((A, C), (B, E)) and ADD ((A, B), (C, E)), is not a valid 2-change modification. O d. The current tour is a local minimum. O e. REMOVE ((A, D), (B, E)) and ADD ((A, B), (D, E)) is a valid 2-change modification, but not accepted for the next iteration step. O f. The modification, REMOVE ((A, D), (C, B)) and ADD ((C, D), (A, B)), yields in a tour which is accepted for the next iteration step. g. [A → C → B → E → D → A] is a neighbour of the tour [A → E → D → B → C → A] O h. The…
Correct answer will be upvoted else downvoted. Computer science. Child Ehab has a piece of Cut and Stick with an exhibit an of length n composed on it. He intends to snatch some scissors and do the accompanying to it: pick a reach (l,r) and cut out each component al, al+1, ..., ar in this reach; stick a portion of the components together in a similar request they were in the exhibit; end up with different pieces, where each piece contains a portion of the components and each component has a place with some piece. All the more officially, he segments the arrangement al, al+1, ..., ar into aftereffects. He thinks a dividing is lovely if for each piece (aftereffect) it holds that, assuming it has length x, no worth happens rigorously more than ⌈x2⌉ times in it. He didn't pick a reach yet, so he's pondering: for q ranges (l,r), what is the base number of pieces he really wants to parcel the components al, al+1, ..., ar into with the goal that the dividing is delightful.…
Given the definition in Haskell: fmap :: (a -> b) -> [a] -> [b] fmap g xs = reverse (map g xs) With Functor law: (fmap g . fmap h) xs = fmap (g . h) xs Using list xs :: [Int], prove the definition does not satisfy the law:
Given two sequences X and Y, we want to find Z i.e., the longest common subsequence (LCS) of both X and Y. Because we know that subsequences of interest are of length >= a and <= b, we threshold the LCS definition to |Z| in [a, b] (where |Z| is the sequence length). In python state the recursive formula for this problem. Implement the algorithm with bottom-up approach dynamic programming and backtracking. Create an iterative function that prints the longest common subsequence(LCS).
2. The function f is defined for non-negative integers a and b recursively as follows: f (а, b) 3D1 if a = 0 or b = 0 f (a - 1, b f (a f (а, а) 1) + 2a - 1 if a if a > b if a < b b b, b) + f (b, b) + f (b а, а) } Compute f (2, 3) by drawing a recursion tree showing all of the computation required and then use your tree to compute the answer.
Recall a set A is countable if |N| ≥ |A|. Recall that Cantor’s theorem shows that P(N) = {X ⊆ N}is uncountable. We will show that F = {X ⊆ N | |X| < ∞} is countable, with an onto functiong : N → F that is computable.Write a program/function (e.g., in Python) that runs forever and prints every element of F,e.g., if run it would print something like{0}{1}{0,2}{3}{0,2}{0,5,7}{1}{0,1}{}{2}...(Note that you must prove that the program works, i.e., it prints every element of F, and onlyelements of F.)
Change two lines of code of: def solution(A, K): n = len(A) for i in range(n - 1): if (A[i] + 1 < A[i + 1]): return False if (A[0] != 1 and A[n - 1] != K): return False else: return True SO that it solves the question : you are given a implementation of a function def solution (A,K) This function, given a non-empty array A of N integers (sorted in non-decreasing order) and integer K, checks whether A contains numbers 1,2..K (every numbers from 1 to K at least once and no other numbers (for example given array A, K=3 ; A(0)=1, A(1)=1, A(2)=2, A(3)=3, A(4)=3 then the function should return True while for the following array A, K=2; A(0)=1, A(1)=1, A(2)=3 then the function should return False.) Assume that: -N and K are integers within the range (1....300,000) -each element of array A is an integer within the range (0...1,000,000,000) -array A is sorted in non-decreasing order
Given a set of object-values, A = {1, 3, 4, 7} and VAL = 6. Implement the Dynamic Programming paradigm to determine whether it is possible to form a summation that equals to value of VAL using any combination of the elements of A where the frequency of use for each element is just one.