Consider the following algorithm segment. Assume that n is a positive integer.for i: = 1 to 3nS:= 0for j:= 1 to i - 1s:= s+j• (i - j+ 1)next jr:= s2next i(a) What is the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed? For simplicity, count only comparisons that occurwithin if-then statements, and ignore those implied by for-next loops. Express your answer in terms of n. (Hint: See Example 11.3.3 and exercises 11.3.11a and 11.3.14a in the "Read It" link.)The number of operations is Consider the following algorithm segment. Assume that n is a positive integer.max := a[5]for i := 6 to nif max < a[i] then max := a[i]next i(a) What is the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed? For simplicity, count only comparisons that occurwithin if-then statements, and ignore those implied by for-next loops. To find the answer, it may be helpful to review Example 11.3.3 and the solutions to Exercise 11.3.11a and Exercise 11.3.14a. Express your answer in terms of n.The number of operations is(b) Apply the theorem on polynomial orders to the expression in part (a) to find that an order for the algorithm segment is n

Note: - As per the guidelines we can only answer one specific question at a time. Please resubmit…

Consider the following algorinm segment. ASSUME that n Is a positive integer. for i: = 1 to 3n S:= 0 for j:= 1 to i - 1 s:=s+j• (i - j+ 1) next r:= s? next i (a) What is the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed? For simplicity, count only comparisons that occur within if-then statements, and ignore those implied by for-next loops. Express your answer in terms of n. (Hint: See Example 11.3.3 and exercises 11.3.11a and 11.3.14a in the "Read It" link.) The number of operations is

Consider the following algorinm segment. ASSUME that n Is a positive integer. for i: = 1 to 3n S:= 0 for j:= 1 to i - 1 s:=s+j• (i - j+ 1) next r:= s? next i (a) What is the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed? For simplicity, count only comparisons that occur within if-then statements, and ignore those implied by for-next loops. Express your answer in terms of n. (Hint: See Example 11.3.3 and exercises 11.3.11a and 11.3.14a in the "Read It" link.) The number of operations is

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. What does this algorithm compute? What is its basic operation? How many times is the basic operation executed? What is the efficiency class of this algorithm? Suggest an improvement of the given algorithm, and indicate its efficiency class. If you cannot do it, try to prove that, in fact, it cannot be done.
Question 2 Consider the following algorithm: g1 = 7 g2 = 6 for k in range(3,8): gk = (k-1)·gk-1 + gk-2 What is the last term, g8, of the recursive sequence generated as a result of executing this algorithm? Your Answer: Question 2 options: Answer
Following are the various algorithms time complexities expressions. Find the dominant terms and specify the Big-Oh complexity of each algorithm. S. No. Expression Dominant term(s) O (. . .) 1. 75 + 0.001n1.3 + 0.025n + (1000)4 2. 500n + 100n + 50n log10 n 3. (10n1.5)4 + 0.3n + 5n6.5 + 2.5 · n2.75 4. 150n3 + n2 log2 n + n(log2 n)4 5. 3 log10 n + log2 log2 n 6. 100n4 + 0.01n2 + 200(log2 n)4 7. n3 + 0.01n + 100n2 + 5n3 8. 2n0.5 + n0.35 + 0.5n0.25 9. 0.01n2 log2 n + n(log2 n) 10. 50n3 log3 n + n5 log3 n + 100n4
Two algorithms A, B sort the same problem. When you go through each algorithm and break them down into their primitive operations, each can be represented as below A = n4 + 100n2 + 10n + 50 B = 10n3 + 2n2 + nlogn + 200 For very large values of n which of these algorithms explain why B will run in the shortest time to solve the problem
What is the leading term for the following expressions and specify the lowest Big O Complexity for each algorithm?
Consider the following algorithm.and Answer the questions a-e about this algorithm. a. What does this algorithm compute? b. What is its basic operation? c. How many times is the basic operation executed" d. What is the efficiency class of this algorithm? e. Suggest an improvement, or a better algorithm altogether, and in-dicate its efficiency class. If you cannot do it, try to prove that, in fact, it cannot be done.
Q10. Consider the following algorithm: g1 = 7 g2 = 6 For k starting at 3 and ending with 8: gk = (k-1)·gk-1 + gk-2 What is the last term, g8, of the recursive sequence generated as a result of executing this algorithm?
Algorithm: sum = 0 A = list(range(0,1000000)) B = [random.randint(0,1000000-1) for j in A] indx = B[0] for i in range(0,1000000): sum += A[indx] indx = B[indx] print(sum) How many arithmetic instructions are required by this algorithm? How many memory accesses are required by this algorithm? How many clocks are required by this algorithm?
The two different algorithms that perform the same complexity process are called B and C. The total number of operations (operations) performed with algorithm B is 64n. The total number of operations performed with the C algorithm is 16 n ^ 2. Here is my question: Determine the problem size n0 where B is better than C for n> n0 please.
Suppose you have algorithms with the two running times listed below. Suppose you have a computer that can perform 6 operations per second, and you need to compute a result in at most an hour of computation. For each of the algorithms, what is the largest input size n for which you would be able toget the result within an hour for: a) n^3b)10n^2
Consider the following non-recursive algorithm:Algorithm Euclid2(m, n)//Input: Integers m and n where m >=n//Output: Greatest Common Divisor of m and nwhile n ≠ 0 do r ← m mod n m← n n ← r return ma) What does this algorithm compute?b) What is the input size for this algorithm?c) What is the basic operation of this algorithm?d) How many times the basic operation is executed worst case scenario?e) How many times the basic operation is executed in best-case scenario?
Let n be a positive integer, and consider the following algorithm segment. for i := 1 to n for j := 1 to i [Statements in body of inner loop. None contain branching statements that lead outside the loop.] next j next i How many times will the inner loop be iterated when the algorithm is implemented and run?