Compulsory Task 1 Answer the following questions: Dev What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i=1;i<= n; i++) sum = sum + 1* (i + 1); What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i = 5; i <= 2 * n; i++) System.out.println(2 * n + i - 1); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= 2 * n; i++) for (int j = 1; j <= n; j++) System.out.println(2* i + j); System.out.println(" "); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) Copyright © 2021 Hyperion Dev. All rights for (int k = 1; k <= n; k++) System.out.println(i + j + k); Each of the following expressions represents the number of inputs for certain algorithms. Write them in Big O notation (eg, n+2+ O(n)); on² + 6n + 4 5n² + 2n + 8 (n² + 1) (3n+ 5) o 5(6n + 4) O n+ 2logn - 6 o4nlogin + 3n + 8

Compulsory Task 1 Answer the following questions: Dev What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i=1;i<= n; i++) sum = sum + 1* (i + 1); What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i = 5; i <= 2 * n; i++) System.out.println(2 * n + i - 1); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= 2 * n; i++) for (int j = 1; j <= n; j++) System.out.println(2* i + j); System.out.println(" "); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) Copyright © 2021 Hyperion Dev. All rights for (int k = 1; k <= n; k++) System.out.println(i + j + k); Each of the following expressions represents the number of inputs for certain algorithms. Write them in Big O notation (eg, n+2+ O(n)); on² + 6n + 4 5n² + 2n + 8 (n² + 1) (3n+ 5) o 5(6n + 4) O n+ 2logn - 6 o4nlogin + 3n + 8

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

Can you please also explain what are the differences between the two algorithms?
Big-O Notation and Algorithms Instructions: Find the function for the number of steps that the algorithm performs (use summation). Also, what is the complexity of the algorithm? Instructions apply for each function in the picture (there are three)
Divide and Conquer is one of the important design method for Algorithm. What is the major feature to design an algorithm applying the Divide and Conquer idea ? 單選: a. Recursive in Assign, Calculate, Output. O b. Recursive in Assign, Divide, Conquer. O c. Recursive in Divide, Calculate, Combine. d. Recursive in Divide, Conquer, Combine. e. Recursive in Calculate, Conquer, Combine. We call it as 3C.
n-1 Geometric (n) = i=1 i=1 1 1 * n-1 П %3D Harmonic (n) = i=1 n Let's look at examples. If we use n = 4, the geometric progression would be 1 * 2 * 3 * 4 = 24, and the harmonic 1.1.1 1 progression would be 1* -= 0.04166. 2 3 4 24 Task #1 Tracing Recursive Methods 1. Copy the file Recursion.java (see Code Listing 16.1) from the Student Files or as directed by your instructor. 2. Run the program to confirm that the generated answer is correct. Modify the factorial method in the following ways: a. Add these lines above the first if statement: int temp; System.out.println ("Method call -- " + "calculating " "Factorial of: " + n); + Copyright © 2019 Pearson Education, Inc., Hoboken NJ b. Remove this line in the recursive section at the end of the method: return (factorial (n - 1) * n); c. Add these lines in the recursive section: temp = factorial (n - 1); System.out.println ("Factorial of: " (n - 1) + " is " temp); return (temp * n); 3. Rerun the program and note how the recursive calls…
Determine which characteristics of an algorithm the following procedures have and which they lack. procedure double(n: positive integer) while n > 0 n:= 2n
Design an algorithm for computing . Assume n is a whole number and the algorithm uses basic arithmetic operations (addition, subtraction, multiplication, division) and inequalities.
*)Algorithm Implementation *)Growth Curve
Question 8 Consider the following code where n and m can be any number of more than 20. Select the correct time complexity. int iter_count = 0; for (int i = 0; i < n; i *= 2) { for (int j = 0; j < m; j++){ iter_count += 1; } for (int i = }) 0; i
The following code implements Newton's algorithm for finding the square root of a number using repetition: n = 17 # we want the square root of 17 for exampleg = 4 # our guess is 4 initiallyerror = 0.0000000001 # we want to stop when we are this closewhile abs(n - (g**2)) > error: g = g - ((g**2 - n)/(2 * g))# g holds the square root of n at this point Implement this algorithm in a function sqRoot(n), that returns the square root using recursion. Assume that the function will be called with positive numbers only. Note: Your initial guess cannot be zero!
er 3) The algorithm solves the problem of 4) size n by dividing it into 64 sub- problems of size n/8, recursively solving each sub-problem, and then combining the solutions in O(n²) time 5) The algorithm solves the problem by breaking it into 8 sub-problems of 1/4 the scale, recursively solving each sub-maze, and then combining the solutions in linear time Th of sub the Q(r Rago 4 of E
Question 5 Dk .Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
rt 2 (Efficiency a) In the following pseudocode, what is the number of operations the algorithmperformsi". .........) (............ I def sum0fN (n): 2 the Sum = 0 3 4 5 for i in range (1, n+1): the Sum= the Sum + i) return the Sum 126