Answered: big o notation def f(n): for i in…

Engineering

Computer Science

big o notation def f(n): for i in range(n): x = 0 while x < n: print(x + n) x = x + 1

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: def sumA(n): sum = 0 for i in range(n+1): sum += 1 return sum # Test code n = int(input ("Enter a…

A: Your answer is given below as you required with an output.

Q: int sum (int n) {//assume n is non-negative if (0 == n) return 0; else n+ sum (n-1); |

A: the correct code should be like that

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

A: Answer is

Q: the only method you are alowed to use is substitution method, a)t(n)=7t(n/8) + 2n is O(n)…

A: Substitution method : solves the given recurrence relation by repeatedly substituting the previous…

Q: Write a program that computes the following: sigma summation i=0 to N (i^3 +2N)

A: - We need to highlight the sum of the provided series with a code. - We are using C++ here.

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: Given the following summation. 1(1)= + +.+ |(i)= - 1+v2 VZ+V3 +Vi+1 Write a java program that prints…

A: /* (summation) write a program to compute the following summation input = I = 625 output…

Q: O(log n) + O(n) = ?

A: EXPLANATION: The big-O notation represents the upper bound of the complexity for any given problem.…

Q: #include void print(int n){ } printf("Hello"); if(n++ == 0) return; print(n); n++; int main() { void…

A: Answer to given question is given below:

Q: eady complete, the next integer in the sequence will be returned. For example: Input: nums =…

A: The code provides two functions: find_missing_number and find_missing_number2, both of which achieve…

Q: Examine the following for loop and determine how many times this loop will be executed. for kk = [O…

A: syntax of for loop in matlab: for index value bodyend

Q: #include using namespace std; int fib(int n) { if (n >n; cout << "The next number in the Fibonacci…

A: Given To know about the C++ programing language.

Q: def problem_a(n) sum=0 k=n while k>0: for i in range(k): sum +=1 k=k//2 return sum what will…

A: I am going to assume that the indentation of code is as follows.... Because any other indentation…

Q: result = 0 for n in range(7): result = n - 2 if (result % 2) != 0: print('-', end=' ') continue…

A: The range given is upto 7 . Now for n = result = 7-2 = 5 which satisfies the condition if (result…

Q: import sys def CtoF(cel): fah = 32 + (cel * 9)/5 sys.stdout.write('The temperature is…

A: Hi. Let's move on to the code in the next step. I have included comments in the code that will help…

Q: 4. P(n, n) = P(n, n −– 1), n ≥ 2. True False

A: Answer : True is the correct answer I attached an image please have a look once.

Q: in range [0..n] in O(n) time and space. The difference between consecutive integers cannot be…

A: code step by step:The find_missing_number() function takes a list of numbers nums as input.Two…

Q: Write a program that reads N from the user and compute the following series: (N-1)-((N-2)^2) /8+…

A: using C++ language for this problem algorithm= styep-1 initialize the variable step2 generate a…

Q: What is the output of this code

A: result = 0 #initialize result to 0 for n in range(6): #n from 0 to 5 result = n - 3…

Q: In N-version programming which is the independent generation of N, the value of N is a) greater…

A: Question. In N-version programming which is the independent generation of N, the value of N is a)…

Q: I need help fixing this python code since it's displaying an error message display below. : def…

A: Introduction: Step 1. Start Step 2. Make a new list called my list. Step 3. Request that the user…

Q: Consider the following code. Assume alist is a list of n numbers. Select the best answer that…

A: ANSWER O(N**2)

Q: Trace the following code and write what it does. void Finals(X, Y, m, n) int i1, ju1, k1; while (i…

A: We are given the following code and we need to trace what it does. void Finals(X, Y, m, n){ int…

Q: QI/What is the output of the following programs ? 1- IN TEGER K, M, N N- 1 DO 10 K- -5, 3 N-N+ 2 DO…

A: Since you have asked multiple questions, according to the company's policy we will solve the first…

Q: a. What does the program write when its input in 107 Ⓡ 100 (Е 30 10 29 B 55 b. What does the program…

A: While loop is an iterative loop which takes condition first and then execute set of statements…

Q: Q15: Analyze the time complexity of the below powering code. This code shows the divide and conquer…

A: Maters theorem is used to find out the time complexity of the recursive programs if the recurrence…

Q: S(x, n) = 1 +- x-n (x- n)2 (x- n)3 (x - n)" Plot the function for x E [0,3] and n = 4 (you are…

A: import numpy as np importing numpy library for using linespace() import matplotlib.pyplot as plt…

Q: This runs in O(n) def constant(item): if n ==1: return "Hello World" else: return "Goodnight" True…

A: In this function, based on the value of n, we are returning either of Strings Hello World or…

Q: What is the running time of the piece of code below i =n |3| While(i > 1): i = i – yn A) O(n) B)…

A: The problem is based on the basics of time complexity calculation in computer systems.

Q: Find the error/s in the following code, highlight and write the correct code. MATLAB n = 5; A =…

A: in the above program there are small errors are there 1. in line two A=eye(n) the line end should…

Q: int i-1,j; while(1){ j-i; i=j+i; What is the time complexity of above loop.

A: Time complexity of a loop is the time dependency of the termination of loop on the loop variable.

Q: def powers0f2(n): if n < 1: return 0 elif n == 1: print (1) return 1 else: prev= powers0f2(int…

A: Here in this question we have given a code and we have asked to find the run time of the following…

Q: Example: Write an values (w/o temp var) algorithm to takes two numbers and swap their

A: Swapping a number is exchanging a value between the variables. For example, a= 10, b = 20 then after…

Q: Java Write a program to find number of trailing zero in a factorial number in time complexity less…

A: Java program to count a number of trailing zeros in the factorial numbers.

Question

big o notation

def f(n):

for i in range(n):

x = 0

while x < n:

print(x + n)

x = x + 1

return

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

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))
Calculate the run time for the code below: int x=6, y=9 int z; Z=x + y; z++; cout << z; O a. O( log n) O b. O(n logn) O c. O(n) O d. O(1)
ST(1/2) - +n T(n) = Answer: Display response n> 1 n<1
Trace the following code and write what it does. void Finals(X, Y, m, n) { int i=1, j-1, k=13; while (i <=m && j<=n) { if (X[i]
Find the values of n and m to solve this puzzle int n = ? int m = ? int t = 76; int s = 0; char *msg = "Do you like spaghetti? Try some spaghetti! It's good, right?\n" "What, you prefer structured loops? How mundane.\n"; goto LTOP; LEND: failure(msg); LOM1: n = (n<<2) - n + 1; LCHK: if(s == t && m == t){ goto LAFT; } s++; goto LTOP; LOC1: if(n & 1){ goto LOM1; } goto LEM1; LTOP: if(!(n>1)){ goto LEND; } goto LOC1; LEM1: n = n >> 1; goto LCHK; LAFT: return;
Find the value of n that solves this puzzle. At what value of n does s reach 39?The code is in C int n = ? int m = 39 int t = 39; int s = 0; while(n>1){ if(n & 1){ n = (n<<2) - n + 1; } else { n = n >> 1; } if(s == t && m == t){ return; } s++; } failure("Seems you forgatz the essence of Collatz");
Q- tracing the following code and correct the error if you found the find the output x = [4 -2 3 -7 5 -1] ; %3D for k = 1:6 y(k) = 0; for n = 1:6 y(k) = y(k)+x(n)*exp(-11*2*pi* (k-1)*(n-1)/N); end end subplot(3, 1, 1); stem(y); title('FFT'); for n = 1:5 x1(n) = 0; for k = 1: 5 x1(n) =x1(n)+(1/N)*y(k)*exp(1i*2 pi (k-1) (n-1)/N); end end subplot(3,1,2); stem(x1); title('IFFT');
How can I apply this python code wherein I have an input n. Then create a list from 2, n and remove the multiples of n. Example: Input: 10 Output: 2, 3, 4, 5, 6, 7, 8, 9 def createList(n): #Base Case/s #TODO: Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #TODO: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once you've completed all the TODO for this function return [] def removeMultiples(x, arr): #Base Case/s #TODO: Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #TODO: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once you've completed all the TODO for this function return []
What does each of the following Python programs print to the terminal? P.#3| 1 def f1(m): m = m +1 3 print(m) 4 def main(): 6 m = 18 7 f1(m) 8. print(m) 9 10 main() 2.
Exercise 2: In probability theory, one problem that often arises is determining the number of ways in which p objects can be selected from n distinct objects without regard to the order in which they are selected. Such selections are called combinations. The number of combinations ofp objects from a set with n objects is C (n, p) and is given by: n! C(n, p) = (п - р)! * р! Write a Python program which will calculate and display on the screen the number of possible combination C based on the values of n and p; where both n and p are positive integers less than 21 and n> p. Implement and use at least the following three functions: fact(..): A function when passed a positive integer value, will calculate and return the factorial of that number. comb(.): A function when passed n and p (n: total number of objects and p: number of objects taken at a time) will calculate and return the total number of possible combinations (using the formula above). It calls function fact(.) main(..): reads…
10*/n + 5n*log(n) belongs to O e(n) O 0(n) O e(n²). O e(nxlog(n))