Suppose you have an algorithm that operates on a set of data with n elements. If the recurrence formula that computes the time requirement for the algorithm is given by T(n) = 87 + Dn if n > 1 if n = 1 where D and C are constants, which of the following gives the order of complexity of the algorithm? a. n lg n b. n² lg n c. n² d. n³ e. none of the other answers

Suppose you have an algorithm that operates on a set of data with n elements. If the recurrence formula that computes the time requirement for the algorithm is given by T(n) = 87 + Dn if n > 1 if n = 1 where D and C are constants, which of the following gives the order of complexity of the algorithm? a. n lg n b. n² lg n c. n² d. n³ e. none of the other answers

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

Suppose you have an algorithm that operates on a set of data with n elements. If the recurrence formula that computes the time requirement for the algorithm is given by T(n) = (2T(n − 1) + D (c if n > 1 if n = 1 where D and C are constants, which of the following gives the order of complexity of the algorithm? a. n b. n² c. n³ d. 2¹ e. None of the answers.
I need the answer as soon as possible
Let S = (a1a2,...an) be a sequence of integers. Design an algorithm to ﬁnd the subsequence SM = (ai,ai+1,...,aj) of S, with consecutive elements, such that the sum of the numbers in SM is maximum over all subsequences of S. Note that the sum is assumed to be 0 if the subsequence is empty. Your algorithm should run in O(n) time.
Computer Science Write the PSEUDOCODE for an algorithm that takes as input a list of numbers that are sorted in nondecreasing order, and finds the location(s) of the most frequently occurring element(s) in the list. If there are more than one element that is the most frequently occurring, then return the locations of all of them. Analyze the worst-case time complexity of this algorithm and give the O() estimate. (A list is in nondecreasing order if each number in the list is greater than or equal to the number preceding it.)
The algorithm of Euclid computes the greatest common divisor (GCD) of two integer numbers a and b. The following pseudo-code is the original version of this algorithm. Algorithm 1 Euclid1(a,b)Require: a, b > 0Ensure: a = GCD(a, b) while a ̸= b do if a > b then a ← a − b else b ← b − a end if end whilereturn a We want to prove the correctness of this algorithm using the loop invariant technique. Answer the following questions: a. Show the property is maintained during the execuation of the While loop (i.e., maintenance property). b. Prove the termination property and conclude. c. What would happen if a > 0 and b = 0 and thus the pre-condition is not satisfied?
The algorithm of Euclid computes the greatest common divisor (GCD) of two integer numbers a and b. The following pseudo-code is the original version of this algorithm. Algorithm 1 Euclid1(a,b)Require: a, b > 0Ensure: a = GCD(a, b) while a ̸= b do if a > b then a ← a − b else b ← b − a end if end whilereturn a We want to prove the correctness of this algorithm using the loop invariant technique. a. In a first attempt to prove the correctness of this algorithm, we propose the following loop invariant property: “GCD(a, b) is a factor of a and b”. Explain why this property willnot help you as is. b. Use your previous observation to propose another loop invariant property that willhelp you to prove the correctness of the version of Euclid’s algorithm presented above. c. Show that your loop invariant property is true before executing the While loop forthe first time (i.e., initialization property)
Create an algorithm that demonstrates the Fibonacci search procedure. The number of data elements n is chosen in such a way that: I Fk+1 > (n+1); and ii) Fk + m = (n +1) for some m 0, where Fk+1 and Fk are two consecutive Fibonacci numbers.
Let S = (a1a2; : : : an) be a sequence of integers. Design an algorithm to nd thesubsequence SM = (ai; ai+1; : : : ; aj) of S, with consecutive elements, such that the sum of thenumbers in SM is maximum over all subsequences of S. Note that the sum is assumed to be0 if the subsequence is empty. Your algorithm should run in O(n) time.
Rewrite the linearSearch algorithm given below to output all positions of the element x in the array L, where S is ( "owu tu the set of all elements in L. Algorithm LinearSearch(r, L, n) Input: Array L, value x, and number n of elements in S Output: Position i, 0 < i< n such that L[i] = x, or –1 if x ¢ S while (i < n) and (L[i] # x) do iti + 1 if i
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 binary search 3. if value exists in alist, print "successful" otherwise print "unsuccessful" Question options: a. O(log n) b. O(n) c. O(n log n) d. O(2^n) e. O(n^2) f. O(1)
Consider array A of n numbers. We want to design a dynamic programming algorithm to find the maximum sum of consecutive numbers with at least one number. Clearly, if all numbers are positive, the maximum will be the sum of all the numbers. On the other hand, if all of them are negative, the maximum will be the largest negative number. The complexity of your dynamic programming algorithm must be O(n2). However, the running time of the most efficient algorithm is O(n). Design the most efficient algorithm you can and answer the following questions based on it. To get the full points you should design the O(n) algorithm. However, if you cannot do that, still answer the following questions based on your algorithm and you will get partial credit. Write the recursion that computes the optimal solution recursively based on the solu- (a) tion(s) to subproblem(s). Briefly explain how it computes the solution. Do not forget the base case(s) of your recursion.
Write for the following problem a recursive algorithm whose worst-case timecomplexity is not worse than Θ(n ln n). Given a list of n distinct positiveintegers, partition the list into two sublists, each of size n/2, such that thedifference between the sums of the integers in the two sublists is maximized.You may assume that n is a multiple of 2.