Siven an array of real numbers A[1..n], the maximum sum of contiguous subarray is 1 Σ OPT:= max sikis A[k]. k=" (a) Design a simple brute-force search O(n²) time algorithm to compute OPT. (b) Define the subproblem as follows: Let M (1) be the maximum sum of all contiguous subarrays ending at position i. Clearly M (1) = A[1]. What is the recurrence relation for computing M (i)? Use this to give a more efficient algorithm to compute OPT.

Siven an array of real numbers A[1..n], the maximum sum of contiguous subarray is 1 Σ OPT:= max sikis A[k]. k=" (a) Design a simple brute-force search O(n²) time algorithm to compute OPT. (b) Define the subproblem as follows: Let M (1) be the maximum sum of all contiguous subarrays ending at position i. Clearly M (1) = A[1]. What is the recurrence relation for computing M (i)? Use this to give a more efficient algorithm to compute OPT.

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 following algorithm that uses a sorted list of n elements (alist). What is the worst case runtime of this algorithm? for each element in alist 1. ask the user for an input, call it value 2. search value in alist using the binary search algorithm 3. if value exists in alist, print "successful" otherwise print "unsuccessful" Question 10 options: O(2^n) O(n log n) O(log n) O(n^2) O(n) O(1)
There’s a length n (n ≥ 3) array and we’d like to fill in each element of the array with an integer.The integers should be in {1, 2, . . . , k} and any 3 adjacency entries cannot have the same number. Given nand k , design a polynomial time algorithm to compute the number of ways to fill this array. Please alsojustify the correctness and the time complexity of your answers.
Hi I was wondering if I could get help with this question. I know that the first five will make the largest sum of 9 but I don't where to go from there Thanks
Algorthim of how to find the largest element missing in an unsorted array of n positive integers and the running time of the algorthim is in O(n). Example of this is that the n=6 array C= [5,90,8,6,26,9] The largest element missing in the array is 7
solve
I need help the question
Question A: Mapping. The two-sum problem is a popular algorithm problem. Given an array of integers and an integer target, return indices of the two numbers such that they add up to the target. You may assume that each input would have exactly one solution, and you may not use the same element twice. For example, suppose we have an array arr = [1,10,100]. If the target is 11, you should return [0,1] because arr[0] + arr[1] = 1+ 10 = 11. If the target is 101, you should return [0,2] because arr[0] + arr[2] = 1+ 100 = 101. Complete this problem in O(n). Hint: using a hash table.
I need the algorithm, proof of correctness and runtime analysis for the problem. No code necessary ONLY algorithm. And runtime should be O(n^2).
1. Let S be a set of n arbitrary but distinct numbers. (a) Give a deterministic algorithm to output the largest n³/4 of the numbers in S in sorted order. Your algorithm must use O(n) comparisons. (b) Show that any deterministic comparison-based algorithm that correctly outputs the median on inputs of n distinct elements must use at least n 1 comparisons. To be completely precise, the median is defined to be the [n/2]th smallest element.
Many computer applications involve searching through a set of data and sorting the data. A number of effi cient searching and sorting algorithms have been devised in order to reduce the runtime of these tedious tasks. In this problem we will consider how best to parallelize these tasks.Consider the following binary search algorithm (a classic divide and conquer algorithm) that searches for a value X in a sorted N-element array A and returns the index of matched entry:BinarySearch(A[0..N−1], X) {low = 0high = N −1while (low <= high) {mid = (low + high) / 2if (A[mid] >X)high = mid −1else if (A[mid] <X)low = mid + 1elsereturn mid // found}return −1 // not found}Assume that you have Y cores on a multi-core processor to run BinarySearch. Assuming that Y is much smaller than N, express the speedup factor you might expect to obtain for values of Y and N. Plot these on a graph.Next, assume that Y is equal to N. How would this affect your conclusions in your previous answer? If you…
A robber is planning to rob the houses along a street. The constraint is, that he cannot rob adjacent houses. If done, it will alert the police. For the below-given algorithm and input, your task is to draw a DP matrix AND return the maximum earnings in a single night: nums = [4,3,6,2,7,10,5] Algorithm: def rob(self, nums: List[int]) -> int: dp = [0]*len(nums) // Initialize dp array n = len(dp) if len(nums) == 1: return nums[0] elif len(nums) == 2: return max(nums[0],nums[1]) dp[0]=nums[0] dp[1]=max(nums[1],nums[0]) for i in range(2,len(nums)): dp[i] = max(nums[i]+dp[i-2],dp[i-1]) return dp[n-1]
Problem 2. Suppose we have an array A[1 : n] which consists of numbers {1,...,n} written in some arbitrary order (this means that A is a permutation of the set {1,...,n}). Our goal in this problem is to design a very fast randomized algorithm that can find an index i in this array such that A[i] mod 8 € {1,2}, i.e., the reminder of dividing A[i] by 8 is either 1 or 2. For simplicity, in the following, we assume that n itself is a multiple of 8 and is at least 8 (so a correct answer always exist). For instance, if n = 8 and the array is A = [8,7, 2,5, 4, 6,3, 1], we want to output either of indices 3 or 8. (a) Suppose we sample an index i from {1,...,n} uniformly at random. What is the probability that i is a correct answer, i.e., A[i] mod 8 E {1,2}? (b) Suppose we sample m indices from {1,...,n} uniformly at random and with repetition. What is the probability that none of these indices is a correct answer? Now, consider the following simple algorithm for this problem: Find-Index-1(A[1:…