find the BIG O complexity of the two function do this by writing the big O complexity of each line in the snippet def tri(n):if n == 1:return [1]prev = [0] + tri(n-1)for i in range (len (prev)-1):prev[i]return prevtimmm=prev[i] + prev[i+1]def quad (arr):n = len(arr)if n == 1:return arr[0]if n < 1:return -1beg, mid, end = 0, n//2, nquad (arr[beg:mid])qu =ad = quad (arr[mid:end])return qu if qu > ad else ad

Answer: We need explain what are the time complexity for the given code.. so we will see in the more…

def tri(n): if n == 1: return [1] prev= [0] + tri(n-1) for i in range(len(prev)-1): prev[i] return prev = prev[i] + prev[i+1] def quad (arr): n = len (arr) if n == 1: return arr[0] if n < 1: return -1 beg, mid, end = 0, n//2, n quad (arr[beg:mid]) qu = ad = quad(arr[mid:end]) return qu if qu › ad else a

def tri(n): if n == 1: return [1] prev= [0] + tri(n-1) for i in range(len(prev)-1): prev[i] return prev = prev[i] + prev[i+1] def quad (arr): n = len (arr) if n == 1: return arr[0] if n < 1: return -1 beg, mid, end = 0, n//2, n quad (arr[beg:mid]) qu = ad = quad(arr[mid:end]) return qu if qu › ad else a

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

Q-2: Submit your code and screenshot of it performing the calculations along with results, see submission notes below regarding submitting code: Implement the following functions (in C#, C/C++, Python or Java - if other language let me know in advance) and provide the results for each of the n in the table below. n = {2, 10, 100, 1000, 10000} Function I: for( double į= 0.0; j
Attempt to unify the following pairs of expressions. Either show their most general unifiers or explain why they will not unify. p(A,B,c) and p(Q,r,S)
Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"
2a. Classification task For the following two classes of observations (class cross and class circle), state and explain whether it is possible for a perceptron to leam the required output. + +
function FUN(n) 2: for i +1 ton do 3: 4: while x > 0 do x + x – i end while 5: 6: 7: end for 8: end function What is the time complexity of the function above? Select one: O n O nlogn O n² log n O n?
6. X is (a,b,c,d), Y is {1,2,3,4). {(a,1), (b,2), (c,2), (d,4)) is a function from X to Y.
Exercise 5 The greatest common divisor (GCD) of a and b is the largest number that divides both of them with no remainder. One way to find the GCD of two numbers is based on the observation that if r is the remainder when a is divided by b, then gcd(a, b) = gcd(b, r). As a base case, we can use gcd(a, 0) = a. Write a function called gcd that takes parameters a and b and returns their greatest common divisor.
Find X(z) for the sequence x(n) =(a)" u(n) Note1: a, n must be defined as symbolic variables Note2: Use disp() function instead of pretty() Note3: You should write the code and the result