4. Consider the algorithm that takes an input n and runs the following pseudocode: for i := 1 to n for j:= 1 to i k := 4 · i · (j + 2) next j next i (a) Given an input n, how many operations does this algorithm perform (as a function of n)? (For our assume that iteration does not count as an operation; just multiplication, addition, and comparison.) purposes,

4. Consider the algorithm that takes an input n and runs the following pseudocode: for i := 1 to n for j:= 1 to i k := 4 · i · (j + 2) next j next i (a) Given an input n, how many operations does this algorithm perform (as a function of n)? (For our assume that iteration does not count as an operation; just multiplication, addition, and comparison.) purposes,

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

calculate number of operations in this algorithm for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { y[i] += A[i * n + j] * x[j]; } }
Suppose that each row of an n × n array A consists of 1's and 0's such that in any row of A all the 1's come before any O's in that row. Assuming that A is already in memory, describe an algorithm running in O(n) time for finding the row that contains the most 1's. Write the algorithm following the style of your course-notes.
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
Give the time complexity for the following algorithm. You need to identify the basic operation first. F(int n) { if (n>1) Return F(n/3)+F(n/3)+5; else return 1; } 1) What is the basic operation? 2) Set up the recurrence. Let T(n) be the # of basic operations 3) Solve the recurrence using the Master theorem
Write an efficient algorithm for the following problem (either pseudocode or java), and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm. Problem will be on repeat numbers input will be ARRAY[1,2, ... , n] number of positive numbes. Output will any one number that is repeated more than n/3 times. for example, if you have [1,1,2,2,2,1], since n = 6 and n/3 = 2, both 1 and 2 showed up more than n/3 times. the output will be either 1 or 2 (just one of the values are required) if you have [1,1,3,4,5,6,7,8,9], since 1 is only repeated twice, and n/3 = 3, output will be "none"
You want to design an algorithm, called minMax(A,p,r), that takes an array of integers and indexes of the first and last elements, and returns the minimum and maximum values in that range. Now write the pseudo code of a divide and conquer (and therefore, recursive) algorithm with the same time complexity (Θ(n)). You can assume that p ≤ r. Also, in your code, you can return two numbers by returning a pair, e.g. “return (a, b)”, and can save the output in a similar way, e.g. “(a, b) = minMax(parameters)”. (Short answer please)
Java Question 19:
Please show and explain so I can nderstand.
Sort the following functions in increasing order of growth following the Big-O notation (Please see attached if it is not displaying properly on your screen). (NB: There is no need typing the functions, just use the labels (a) to (h) to sort the functions accordingly.)
for i:=1 to n for i:=1 to 2n a = 2-n+i-j next j next i a. Number of additions, subtractions, multiplications, divisions that must be performed when the algorithm segment is executed (ignore operations handled by control flow structures): b. Use the theorem on polynomial orders to find an order for the algorithm segment.
With the Binary Search algorithm, the algorithm can be developed by the loop-based form as well as a recursive form. Which of the following is not true? O If the item is not found, the loop version returns when the range bounds reach, but the recursive version finishes when the recursive depth is more than half the initial search range. The search range starts with the whole array, and only the recursive version can work on a subrange passed through arguments. O Both forms of the program divide the search range repeatedly in half. O If the item is found, the loop version returns from the entire method, whereas the recursive version returns from one level of recursion.
Consider the following recursive algorithm, where // denotes integer division: 3//2 = 1, 5//2 = 2, etc. F(n):if n <= 1: returnF(n//2)for i from 0 to n for j from 0 to n//2 print(i+j) Let function T(n) denote the running time of this algorithm. Derive T(n) and prove its worst case timecomplexity