Need help with consecutive sums problem and algorithm below in the image Let(a1,...an) be a sequence of distinct numbers some of which maybe negative. For ≤ i ≤j≤n, consider the sumSij = a₁ +.... taja) What is the running time of a brute force algorithm to calculate max Sij?b) Give an efficient algorithm to find the above maximum. In addition to giving the algorithm, describe the efficiency of your algorithm clearly.

Let (a1....an) be a sequence of distinct numbers some of which maybe negative. For ≤ i ≤j≤n, consider the sum Sijai+...+aj a) What is the running time of a brute force algorithm to calculate max Sij? b) Give an efficient algorithm to find the above maximum. In addition to giving the algorithm, describe the efficiency of your algorithm clearly.

Let (a1....an) be a sequence of distinct numbers some of which maybe negative. For ≤ i ≤j≤n, consider the sum Sijai+...+aj a) What is the running time of a brute force algorithm to calculate max Sij? b) Give an efficient algorithm to find the above maximum. In addition to giving the algorithm, describe the efficiency of your algorithm clearly.

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

Let m be a randomly chosen non-negative integer having at most n decimal digits, i.e. an integer in the range 0 sms 10" - 1. Consider the following problem: determine m by asking only 5- way questions, i.e. questions with at most 5 possible responses. For instance, one could ask which of 5 specific sets m belongs to. Prove that any algorithm restricted to such questions, and which correctly solves this problem, runs in time Q(n).
There are n people who want to carpool during m days. On day i, some subset si ofpeople want to carpool, and the driver di must be selected from si . Each person j hasa limited number of days fj they are willing to drive. Give an algorithm to find a driverassignment di ∈ si each day i such that no person j has to drive more than their limit fj. (The algorithm should output “no” if there is no such assignment.) Hint: Use networkflow.For example, for the following input with n = 3 and m = 3, the algorithm could assignTom to Day 1 and Day 2, and Mark to Day 3. Person Day 1 Day 2 Day 3 Limit 1 (Tom) x x x 2 2 (Mark) x x 1 3 (Fred) x x 0
1: Given a fixed integer B (B ≥ 2), we demonstrate that any integer N (N ≥ 0) can bewritten in a unique way in the form of the sum of p+1 terms as follows:N = a0 + a1×B + a2×B2 + … + ap×Bpwhere all ai, for 0 ≤ i ≤ p, are integer such that 0 ≤ ai ≤ B-1.The notation apap-1…a0 is called the representation of N in base B. Notice that a0 is theremainder of the Euclidean division of N by B. If Q is the quotient, a1 is the remainder of theEuclidean division of Q by B, etc.1. Write an algorithm that generates the representation of N in base B. 22. Compute the time complexity of your algorithm.
Determine φ (m), for m=12,15, 26, according to the definition: Check for each positive integer n smaller m whether gcd(n,m) = 1. (You do not have to apply Euclid’s algorithm.)
Suppose we have n pieces of candy with weights W[1 .. n] (in ounces) that we want to load into boxes. Our goal is to load the candy into as many boxes as possible, so that each box contains at least L ounces of candy. Describe an efficient 2-approximation algorithm for this problem. Prove that the approximation ratio of your algorithm is 2. [Hint: First consider the case where every piece of candy weighs less than L ounces.]
38. Suppose that, in a divide-and-conquer algorithm, we always divide an instance of size n of a problem into n subinstances of size n/3, and the dividing and combining steps take linear time. Write a recurrence equation for the running time T(n), and solve this recurrence equation for T(n). Show your solution in order notation.
There are n people who want to carpool during m days. On day i, some subset ???? of people want to carpool, and the driver di must be selected from si . Each person j has a limited number of days fj they are willing to drive. Give an algorithm to find a driver assignment di ∈ si each day i such that no person j has to drive more than their limit fj. (The algorithm should output “no” if there is no such assignment.) Hint: Use network flow. For example, for the following input with n = 3 and m = 3, the algorithm could assign Tom to Day 1 and Day 2, and Mark to Day 3. Person Day 1 Day 2 Day 3 Driving Limit 1 (Tom) x x x 2 2 (Mark) x x 1 3 (Fred) x x 0
Problem 4: Let S = {s1, s2, . . . , sn} and T = {t1, t2, . . . , tm}, n ≤ m, be two sets of integers. (i) Describe a deterministic algorithm that checks whether S is a subset of T. What is the running time of your algorithm? (ii) Devise an algorithm that uses a hash table of length n to test whether S is a subset of T. What is the expected running time of your algorithm?
We have two input arrays, an array A with n elements, and an array B with m elements, where m > n. There may be duplicate elements. We want to decide if every element of B is an element of A. a. Describe a brute-force algorithm. What is the worst-case time complexity? b. Describe an algorithm to solve this problem in O(m log n) worst case time. (Hint: You may apply instance simplification.)
In this exercise we will develop a dynamic programming algorithm for finding the maximum sum of consecutive terms of a sequence of real numbers. Thatis, given a sequence of real numbers a1, a2,… , an,the algorithm computes the maximum sum ∑k(top) i=j(bottom) a_iwhere 1 ≤ j ≤ k ≤ n. b) Let M(k) be the maximum of the sums of consecutiveterms of the sequence ending at ak. That is, M(k) =max1≤j≤k∑ki=j ai. Explain why the recurrence relationM(k) = max(M(k − 1) + ak, ak) holds for k = 2, ..., n.c) Use part (b) to develop a dynamic programming algorithm for solving this problem.d) Show each step your algorithm from part (c) uses tofind the maximum sum of consecutive terms of thesequence 2,−3, 4, 1,−2, 3.e) Show that the worst-case complexity in terms of thenumber of additions and comparisons of your algorithm from part (c) is linear.
4. Practice with the iteration method. We have already had a recurrence relation ofan algorithm, which is T(n) = 4T(n/2) + n log n. We know T(1) ≤ c.(a) Solve this recurrence relation, i.e., express it as T(n) = O(f(n)), by using the iteration method.Answer:(b) Prove, by using mathematical induction, that the iteration rule you have observed in 4(a) is correct and you have solved the recurrence relation correctly. [Hint: You can write out the general form of T(n) at the iteration step t, and prove that this form is correct for any iteration step t by using mathematical induction.Then by finding out the eventual number of t and substituting it into your generalform of T(n), you get the O(·) notation of T(n).]
Let's say there are n villages, {X1, . . . , Xn} on the country-road and we aim to build K < n restaurants to cover them. Each restaurant has to be built in a village, and we hope to minimize the average distance from each village to the closest restaurant. Please give an algorithm to compute the optimal way to place these K restaurants. The algorithm should run in O(k * n^2) time. Solutions with slightly higher time complexity also accepted.