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

Given a set of n positive integers, C = {c1,c2, ..., cn} and a positive integer K, is there a subset of C whose elements sum to K? A dynamic program for solving this problem uses a 2-dimensional Boolean table T, with n rows and k + 1 columns. T[i,j] 1≤ i ≤ n, 0 ≤ j ≤ K, is TRUE if and only if there is a subset of C = {c1,c2, ..., ci} whose elements sum to j. Which of the following is valid for 2 ≤ i ≤ n, ci ≤ j ≤ K? a) ?[?, ?] = ( ?[? − 1, ?] ?? ?[?, ? − ?? ]) b) ?[?, ?] = ( ?[? − 1, ?] ??? ?[?, ? − ?? ]) c) ?[?, ?] = ( ?[? − 1, ?] ?? ?[? − 1, ? − ?? ]) d) ?[?, ?] = ( ?[? − 1, ?] ??? ?[? − 1, ? − ?? ]) In the above problem, which entry of the table T, if TRUE, implies that there is a subset whose elements sum to K? a) ?[1, ? + 1] b) ?[?, ?] c) ?[?, 0] d) ?[?, ? + 1]
Given a set of n positive integers, C = {c1,c2, ..., cn} and a positive integer K, is there a subset of C whose elements sum to K? A dynamic program for solving this problem uses a 2-dimensional Boolean table T, with n rows and k + 1 columns. T[i,j] 1≤ i ≤ n, 0 ≤ j ≤ K, is TRUE if and only if there is a subset of C = {c1,c2, ..., ci} whose elements sum to j. Which of the following is valid for 2 ≤ i ≤ n, ci ≤ j ≤ K? a) T[i, j] = ( T[i − 1, j] or T[i, j − ci]) b) T[i, j] = ( T[i − 1, j] and T[i, j − ci ]) c) T[i, j] = ( T[i − 1, j] or T[i − 1, j − ci ]) d) T[i, j] = ( T[i − 1, j] and T[i − 1, j − cj ]) In the above problem, which entry of the table T, if TRUE, implies that there is a subset whose elements sum to K? a) T[1, K + 1] b) T[n, K] c) T[n, 0] d) T[n, K + 1]
In a company, there are several branches. Let us consider a branch of that company having N employees, if the manager is allotted to that branch(s) then he is known to everyone else in that branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find the manager in that branch. Input from the user in main ( ), the square matrix M where if an element of row i and column j is set to 1 it means that ith person knows jth person. You need to write a function managerId ( ) which returns the id of the manager if present or else returns -1. The function managerId ( ) takes two arguments - the square matrix of N *N and its size N. Call managerId ( ) from the main ( ) output the information about the manager. Assume all diagonal elements to be 1 (as everyone knows him/herself) and there is at most one manager in the company.
Give a dynamic programming algorithm using the following optimal subproblem structureLCIS+(i; j) : is the longest closed to increasing subsequence that ends and XiXj , i.e., its last elementis Xj and its second to last element is Xi. Give a recursive formula, prove its correctness and write abottom-up implementation.
A problem called S reduces to a problem called T if a T solver can be used as a subroutine to solve S. In pseudocode: Solves(...): ... SolveT(...) ... Assuming that this reduction is correct, answer the following questions regarding what the reduction tells us. If we know that an algorithm exists for solving Problem S, what does that tell us about Problem T? [ Select ] If we know that an algorithm cannot exist for solving Problem S, what does that tell us about Problem T? [Select ] [ Select ] An algorithm cannot exist for solving Problem TT. what does that tell us about Problem S? If we know An algorithm exists for solving Problem T Nothing [ Select] If we know that an algorithm cannot exist for solving Problem T, what does that tell us about Problem S? [ Select ]
Evaluation of Polynomial Function A polynomial of degree n is a function of the form f(x) = anx" + an-1x"-1 +...+ azx2 + a1x + ao where the as are real numbers (sometimes called the coefficients of the polynomial). Although this general formula might look quite complicated, particular examples are much simpler. For example, f(x) = 4x3 – 3x² + 2 %3D is a polynomial of degree 3, as 3 is the highest power of x in the formula. This is called a cubic polynomial, or just cubic.
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).
Q3 In a company, there are several branches. Let us consider a branch of that company having N employees, if the manager is allotted to that branch(s) then he is known to everyone else in that branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find the manager in that branch. Input from the user in main (), the square matrix M where if an element of row i and column j is set to 1 it means that ith person knows jth person. You need to write a function managerId () which returns the id of the manager if present or else returns -1. The function managerId () takes two arguments - the square matrix of N *N and its size N. Call managerId () from the main () output the information about the manager. Assume all diagonal elements to be 1 (as everyone knows him/herself) and there is at most one manager in the company. Example: No of persons N = 3 Input matrix: 0 1 1 1 0 1 Output: manager is person 3 1 0 1
A problem called S reduces to a problem called T if a T solver can be used as a subroutine to solve S. In pseudocode: Solves(...): ... SolveT(...) ... Assuming that this reduction is correct, answer the following questions regarding what the reduction tells us. If we know that an algorithm exists for solving Problem S, what does that tell us about Problem T? [ Select] If we know that an algorithm cannot exist for solving Problem S, what does that tell us about Problem T? [ Select] If we know that an algorithm exists for solving Problem T, what does that tell us about Problem S? [ Select ] [ Select ] An algorithm cannot exist for solving Problem S,r solving Problem T, what does that tell us about Nothing An algorithm exists for solving Problem S
A subsequence of a sequence is obtained by deleting zero or more values in the sequence. For example, acdfh is a subsequence of abcdefghi. The order must be preserved. The longest common subsequence problem takes two strings as input and outputs the length of the longest string that is a subsequence of both input strings. Describe an efficient dynamic programming algorithm for the longest common subsequence problem. Start by writing recursive equations using the shop around principle. Concentrate on the last values in the input strings. If they are the same, keep them and look for a longest common subsequence of the two strings with their last characters removed. If the last two characters are different, you can only keep one of them. Try keeping one, and throwing the other one away. Then keep the other one. Take a maximum, since you are looking for a longest common subsequence. Then implement the equations using memoization.
Using c++ Apply both breadth-first search and best-first search to a modified version of MC problem. In the modified MC, a state can contain any number of M’s and any number of C’s on either side of the river. Assume the goal is always to move all the persons on the left side to the right side. The Initial state should be a parameter given to the program at beginning of execution. As in the original problem, boat capacity =2, the boat cannot move by itself, and on either side C’s should not outnumber M’s. For best-first search, you need to come up with an appropriate heuristic. In addition to solving the problem, your grade will also be based on th effectiveness of the heuristic. As an example, the program should execute as follows. Initial state… Enter number of M’s on left side of the river: 3 Enter number of C’s on left side of the river: 1 Enter number of M’s on right side of the river: 0 Enter number of C’s on right side of the river: 0 Enter location of the boat: L The output…
You are given a sequence of integers A1, A2,..., AN and an integer M. For any valid integers p, q, let's define F(p,q) as the dot product of the subsequences Ap, Ap+1, . .., Ap+M–1 and Aq, Aq+1, ..., Aq+M–1, i.e. F(p, q) = Eo Apti · Aqti- ¬M-1 You should process Q queries. In each query: • You are given two integers pos and val. Change the value of Apos to val. • Then, find the sum S = SN-M+1N-M+1 Li=1 Lj=1 F(i, j). %3D Develop a python code that prints a single line containing one integer S % 999000000 Sample Input: 321 321 32 Output: 49