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

Given an array of real numbers A[1..n], the maximum sum of contiguous subarray is OPT:= max ΣA[k]. ISKISR k=1 (a) Design a simple brute-force search O(n²) time algorithm to compute OPT. (b) Define the subproblem as follows: Let M (2) be the maximum sum of all contiguous subarrays ending at position 2. 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.
Consider an n by n matrix, where each of the n2 entries is a positive integer. If the entries in this matrix are unsorted, then determining whether a target number t appears in the matrix can only be done by searching through each of the n2 entries. Thus, any search algorithm has a running time of O(n²). However, suppose you know that this n by n matrix satisfies the following properties: • Integers in each row increase from left to right. • Integers in each column increase from top to bottom. An example of such a matrix is presented below, for n=5. 4 7 11 15 2 5 8 12 19 3 6 9 16 22 10 13 14 17 24 1 18 21 23 | 26 | 30 Here is a bold claim: if the n by n matrix satisfies these two properties, then there exists an O(n) algorithm to determine whether a target number t appears in this matrix. Determine whether this statement is TRUE or FALSE. If the statement is TRUE, describe your algorithm and explain why your algorithm runs in O(n) time. If the statement is FALSE, clearly explain why no…
Given a sorted array of n comparable items A, and a search value key, return the position (array index) of key in A if it is present, or -1 if it is not present. If key is present in A, your algorithm must run in order O(log k) time, where k is the location of key in A. Otherwise, if key is not present, your algorithm must run in O(log n) time.
Given a matrix of size N x M where N is the number of rows and M is the number of columns, write an algorithm to find the shortest path from the top-left cell to the bottom-right cell that passes through all the cells with a prime value and avoids cells with composite values. The algorithm should have a time complexity of O(NM log(max(N,M))).
Consider a list of n positive integers a1, a2, 9 an. Given a query positive integer m, we are required to determine if there is a prefix (that is, a₁, a2, ..., a;) of this list that sums to m. To solve such query problems, we precompute all prefix sums (there are n of them) and keep them in an array whose ith element is a₁ + a₂ + + ai. Now, the most efficient way of searching this list for m is to do a (a) Linear search (b) Binary search (c) Random search (d) None of the above Ans:
Analysis of Linear search (Worst, Average and Best Cases)#include <stdio.h>// Linearly search x in arr[]. If x is present then return the index,// otherwise return -1int search(int arr[], int n, int x){ int i; for (i=0; i<n; i++) { if (arr[i] == x) return i; } return -1;}
Let T be a sorted array of n elements. An element x is said to be a majority element in T if the number of elements i, with T[i] = x, is greater than n/2. Give an algorithm (code or pseudo-code) that can decide whether T includes a majority element (it cannot have more than one), and if so, find it. Your algorithm must run in linear time.
Given two sorted arrays A and B, design a linear (O(IA|+|B|)) time algorithm for computing the set C containing elements that are in A or B, but not in both. That is, C = (AU B) \ (AN B). You can assume that elements in A have different values and elements in B also have different values. Please state the steps of your algorithm clearly, prove that it is correct, and analyze its running time. Pls give the code in C++, or very clear steps of the algorithm
Given an array A containing N numbers. The problem is to find the minimum gcd among all non-decreasing subarrays. Note: Gcd of k number is the greatest number which divides all k numbers. Example 1: Input : arr[] = {1, 2, 3, 2, 4, 1, 7} Output : 1 Explanation : Some non decreasing subarrays are - {1, 2, 3} gcd = 1, {2, 4} gcd = 2, {1, 7} gcd = 1, minimum gcd = 1
Write an algorithm called MatrixRowMultiple(A[0…n – 1, 0… n – 1]) which takes an n x n matrix A and outputs if true, if each element in the first row is twice the value of the corresponding element of row 2. Otherwise, it returns false. (ii) Determine the worst case complexity of the algorithm which you have developed.
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:…
Po.