18. What is the running time of the following algorithm? Input: The number n is a power of 2. 1: i = n 2: while i 1 do 3: 4: 5: 6: 7: end while 8: i = [1/2] 9: end while j=1 while j≤ n do Print (i, j) j=2.j

18. What is the running time of the following algorithm? Input: The number n is a power of 2. 1: i = n 2: while i 1 do 3: 4: 5: 6: 7: end while 8: i = [1/2] 9: end while j=1 while j≤ n do Print (i, j) j=2.j

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

Related questions

Q: 2. Consider the following algorithm ALGORITHM Do_Something(int n) //Input: An integer n> 0 if n > 1…

A: Question 1.) Analysis the time complexity of this algorithm. Do_something(int n) if n>1 do…

Q: Do not use static variables to implement recursive methods. USING JAVA Indicate the order of the…

A: Algorithm: Define an integer n as the value to be used for comparing the growth…

Q: Assume that n is a positive integer. for k:= 3 to n for j :=1 to 6n x := a[k] = b[j] next j next k…

A: To compute the actual number of elementary operations performed by the given algorithm segment,…

Q: How many loop iterations will the algorithm execute? (int i=0;i<n;i++)

A: In computer programming, loops let us do repeated operations effectively. As an example of a "for…

Q: Question # 13 Fill in the Blank Consider the Python code for finding the factorial of a whole number…

A: Answer is

Q: cci series begins with the terms 0 and 1 and has the property that each succeeding term is the sum…

A: Start Now declare variables i, b, c, fib we will initialize the variables b=0, c=1 and fib=0 Enter…

Q: 1. We are given the following algorithm segment as below: for j :=1 to 2n for k:=1 to 2n a[j] = 2 *…

A: Algorithm: An algorithm is a step-by-step process of solving a problem or accomplishing a task.…

Q: Given a string str and number n, write a program that recursively appends a copy of string str n…

A: The objective of the question is to create a function that recursively appends a copy of a given…

Q: . Use O notation to give asymptotic running times of the following algorithms in terms of the input…

A: for(int i=1; i<n; i = 2*i) // Outer loop for(int j=0; j<n; j++) // Inner loop std::cout…

Q: Given an input n, how many operations does this algorithm perform (as a function of n)? (For our…

A: 1. how many operations does this algorithm perform Answer: defiantly it has the two for loops but…

Q: Eulers number e is used as the base of natural logarithm. It may be approximated using the formula…

A: NOTE : As the question is not specific about the programming language to be used to write the…

Q: # Exercise 1. Implement the algorithm covered in lectures that determines if an integer n is prime.…

A: The code and the output is given in step 2.

Q: Consider the following program: Fib[n] if(n==0) then return 0 else if(n==1) then return 1 else…

A: Given program: Fib[n] If(n==0) then return 0 else if(n==1) then return 1 else return…

Q: many times the innermost loop will be iterated when the following algorithm segment is implemented…

A: for i:= 8 to 60 for j = 10 to 30 [Statements in body of inner loop. None contain branching…

Q: Write a recursive algorithm with the following prototype: int divide(int x, int y); that returns…

A: Solution :

Q: A number sequence, t(n), where n ≥ 1, is given by the following recursive algorithm, value a = 1, b…

A: Sequence Number a,b N value Formula to used && t value t(1) a=1, b=2 n=1 t=3*b+5…

Q: j:=1 to n For k:=1 to p

A: for i:=1 to m forj:=1 to n for k:=1 to p [Statements in body of inner loop. None contain…

Q: The following code implements Newton's algorithm for finding the square root of a number using…

A: Program Plan: Define sqRoot() function that finds the square root of a number using recursion.…

Q: In this problem, you will write different programs to x^N, where x ∈ R, n ∈ N. b) Devise a…

A: Please refer below for your reference: Language used is C++: 1) Using pow method: #include…

Q: This function uses a curious mix of iteration and recursion: function F(n) if n < 1 t<- O return 1…

A: It is essential to comprehend algorithms' computational complexity in order to assess their…

Q: a) AlgorithmX(n) 1. xfl 2. for i 1 to n² 3. x←max(x,i) 4. for j1 to n² 5. x←max(x.j) 6. return x b)…

A: a) Answer: The Big O analysis for the given code snippet is O(n^2), which means that the time…

Q: Calculate Big O for the following algorithm. Assume all variables are declared, have values, and the…

A: Consider the given algorithm, where all variables are declared properly. Sum=0; //Line 1…

Q: 2. Find an expression involving n that gives the total number of operations performed by the…

A: Consider for i:=0 to n as i-loop for j:=0 to i as j-loop

Q: The following iterative sequence is defined for the set of positive integers: Sn/2 if n is even Un =…

A: Lets first understand the problem and code: Here a number is given 1. if it is even then divide it…

Q: (Weiss 7.40): The following divide-and-conquer algorithm is proposed for finding the simultaneous…

A: Given: (Weiss 7.40): The following divide-and-conquer algorithm is proposed for finding the…

Q: se the recursion to solve the following problems 1. Calculate the sum of an array of n integers.…

A: In this question we have to write the code for the recursion to solve the following problems:1.…

Q: n choose k, C( n, k). That says having n items how many different ways you have to choose k items…

A: We need to provide recursion code in c++ for the calcualting nCk Example C(n,r)=C(15,3)…

Q: Find the running time complexity of algorithms given below. a. for (i=0;ii;j-) for(k=0;k<j;k++)…

A: for(i=0; i<n; i++) // this loop runs for n times. i.e Executes O(n) times…

Q: Algorithm Prime2 (n: integer):{T,F}; prime = F; d=2; while d < n/2 and prime = F do…

A: The operation "n mod d" will be performed as long as the while loop executes.

Q: Given a sorted list of integers, output "Middle item: " followed by the middle integer. Assume the…

A: Python Exercise: Given a sorted list of integers, output "Middle item: " followed by the middle…

Q: int BinDig (int n) { if (n == 1) return 1; else return (1 + BinDig(n/2)); } Find T(n) = number of…

A: Answer is

Q: Consider the Python code for finding the factorial of an integer n using recursion. Line numbers…

A: The line of code that includes a recursive function call in the provided Python code for finding the…

Q: Computer Science Consider the following simple algorithm: Algorithm SimpleSum(n)…

A: Answer

Q: Given the following function: def F1(n): k=0 for i in range (1, (n*n*n*n)/2): for j in range(0, i):…

A: NOTE - both images are of same question Time complexity will be the number of times the statement (…

Q: Algorithm Prime2 (n: integer):{T,F}; prime = T; d=2; while d < n/2 and prime = T do…

A: - We need to check for the number of times n mod d is calculated for n = 77.

Q: Q1. Write a recursive method to compute the following series: 1 1 1 1 f(i) = 4 6. 2i Write a test…

A: Answer import java.util.*;import java.lang.*;import java.io.*;import java.math.RoundingMode;import…

Q: Solve the question using only a brute force algorithm. Explain your solution and question write…

A: Check the strings from the right end If the two characters at present to check are the same we…

Q: Algorithm Binary Search Input: L = a1, a2, ... , an list of distinct integers; x integer Output:…

A: Binary Search:- By periodically halving the search interval, the binary search algorithm finds items…

Q: Algorithm Prime2 (n: integer):{T,F}; prime = T; d=2; while d < n/2 and prime = T do…

A: In this given question there is an algorithm named prime2 and you have to how many times n mod d…

Q: Design an algorithm to find the kth number such that the only prime factors are 3, 5, and 7. Note…

A: An algorithm is a procedure used for solving a problem or performing a computation.

Q: Determine how many times the innermost loop will be iterated when the following algorithm segment is…

A: Introduction Iteration: The procedure in which a code fragment is run just once is referred to as…

Q: Algorithms in pseudo code **MUST** be placed in de blocks/fences, and use `cpp` as the syntax…

Q: int fun1(int n) Algorithm 3 Analyze the following Algorithms. Find their running time and asymptotic…

A: To perform the running time analysis recursive function, the following steps are followed : Form…

Concept explainers

Counting sort

The counting sort algorithm sorts an array’s contents by counting the repetition of each element that occurs in the array. A counting sort algorithm is a stable algorithm that works the best when the range of elements in the array is small, say for example from 0 to 9. The count which is the number of repetitions of an element in the array is mapped to an index of an auxiliary array, which is then saved in an auxiliary array. The counting sort algorithm has a stable time complexity of the order of O(size of array + size of auxiliary array). Let’s discuss the algorithm in detail as follows.

Question

18. What is the running time of the following algorithm?
Input: The number n is a power of 2.
1: i = n
2: while i 1 do
3:
4:
5:
6:
7:
end while
8:
i = [i/2]
9: end while
j=1
while j<n do
Print (i, j)
j=2.j

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Algorithm Prime2 (n: integer):{T,F}; prime = F; d=2; while d < n/2 and prime = F do if n mod d = 0 then prime = T else d = d+1 return prime; How many times is the operation "n mod d" performed, when the input for Algorithm Prime 2 is n=123? Group of answer choices 1 4 3 2 None of these.
sum = 0 for j in range(1,12): sum = sum + (9*j + 3) print(sum) What is printed as a result of executing this algorithm?
Assume n is the number of inputs and that the log function is base 2. Treat this piece of code as a pseudocode. Give the big-Oh characterization, in terms of n for the following algorithm: for i in range(n*logn): for j in range(i): for k range(1000): print('I did it!')
a) You are given two different codes for finding the n-th Fibonacci number. Find the time complexity of both implementations and compare the two. Implementation 1 def fibonacci_1 (n) : if n < 0: print ("Invalid input!") elif n <= 1: return n else: return fibonacci_1 (n-1) +fibonacci_1 (n-2) n = int (input ("Enter a number: ")) nth_fib= fibonacci_1 (n) print("The {}th fibonacci number is {}.". format (n, nth_fib)) Implementation 2 def fibonacci_2 (n) : if n<0: return "Invalid Input" if n<=1: return n fib [0] (n+1) fib[0] = 0 fib[1] = 1 for i in range (2, n+1): fib[i] = fib[i-1]+ fib[i-2] return fib[n] n = int(input ("Enter a number: ")) nth_fib = fibonacci_2 (n) print("The {} th fibonacci number is {}.". format (n, nth_fib))
Write a recursive algorithm with the following prototype: int divide (int x, int y); that returns x/y (integer division). You need not test for divide by 0. THE FUNCTION MUST BE RECURSIVE. (hint: base case should be when x
Suppose the runtime efficiency of an algorithm is presented by the function f(n) = 10n + 10². Which of the following statements are true? Indicate every statement that is true. A. The algorithm is O(n log n) B. The algorithm is O(n) and O(log n). C. The algorithm is O(log n) and 80(n). D. The algorithm is (n) and (log n). E. All the options above are false.
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!
5. Rearrange this complexity lists from lowest to highest ranking. a. 2n b. n! c. n5 d. 10000 e. N log2 (n) f. Log n
1. A certain computer algorithm executes four times as many operations when it is run with an input of size n as when it is run with an input of size n – 1. Here, n > 1 is an integer. When the algorithm is run with an input of size 1, it executes 12 operations. How many operations does the algorithm execute when it is run with an input of size 5? How many operations does the algorithm execute when it is run with an input of size n?