(a) Find the total number of additions and multiplications that must be performed when the following algorithm is executed. Show your work carefully. for i := 1 to n for j = i to n a := 2 · (5 · i + j+ 1) next j next i (b) Find an order for the algorithm segment of part (a) from among the following: log, n, n, n · log, n, n², n³, and nª. Give a reason for your answer.

(a) Find the total number of additions and multiplications that must be performed when the following algorithm is executed. Show your work carefully. for i := 1 to n for j = i to n a := 2 · (5 · i + j+ 1) next j next i (b) Find an order for the algorithm segment of part (a) from among the following: log, n, n, n · log, n, n², n³, and nª. Give a reason for your answer.

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

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
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
please answer with proper explanation and step by step. don't give Direct answer. Question: If an algorithm takes n^2 operations, and the computer can perform 100 billion operations per second, what is a reasonable estimate of how long it will take to sort 2 billion elements (assuming there is ample memory, the computer doesn't crash, etc.)? a. 1 second b. 1 minute c. 1 hour d. 1 day e. 1 month f. 1 year g. 1 decade h. 1 century
Consider the Sort-and-Count algorithm explained in section 5.3 of our text: "Counting Inversions"Suppose that the initial list is: 92 71 36 91 27 48 14 34 81 26 24 65 78 51 37 22 Sort-and-Count makes two recursive calls. The first recursive call inputs the first half of the initial list: 92 71 36 91 27 48 14 34 and returns the sorted version of the first half, as well as the number of inversions found in the first half (22). The second recursive call inputs the second half of the initial list: 81 26 24 65 78 51 37 22 and returns the sorted version of the second half, as well as the number of inversions found in the second half (19). Sort-and-Count then calls Merge-and-Count. To Merge-and-Count, Sort-and-Count passes the sorted versions of the two halves of the original list: 14 27 34 36 48 71 91 92, and 22 24 26 37 51 65 78 81 Merge-and-Count begins merging the two half-lists together, while counting…
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.
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?
a) Consider a recursive function to return the Number of Binary Digits in the Binary Representation of a Positive Decimal Integer (n) using a recursive algorithm. int Process (int n) { if (n == 1) return 1; else return (Extra() + Process (n/4) + Process (n/4)); } Given that Extra(n) is a function of O(n)1) Find T(n) = number of arithmetic operations. 2) Calculate the complexity of this algorithm using Back Substitution.
Based on the example given on the image below, give a big-O estimate for the number of operations, where an operation is a comparison or a multiplication, used in this segment of an algorithm.
What is the leading term for the following expressions and specify the lowest Big O Complexity for each algorithm?
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?
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 m a) 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?
Consider the following algorthim and answer: 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.