we use python and jupyter notebooks to program Problem 14 Find the running time function, T(n), of the program below.In [9]:12 def prob14(L):if len(L) <= 1:34return eoutput = 0for x in L:for y in L:output += x*y7for x in L:10output += xleft = L[ 0 : len(L)//2 ]rightreturn output + prob15(left) + prob15(right)11L[ len(L)//2 : len(L) ]121314ANSWER:T(n) = ..

Step 1:- Introduction:- To calculate the running time of the given function. We import the time.…

Problem 14 Find the running time function, T(n), of the program below. In [9]: 1 2 def prob14(L): if len(L) <= 1: 3 4 return e output = e for x in L: for y in L: output += x*y 7 8 for x in L: 10 output += x left - L[ 0 : len(L)//2 ] right - L[ len(L)//2 : len(L) ] return output + prob15(left) + prob15(right) 11 12 13 14 ANSWER: T(n) =

Problem 14 Find the running time function, T(n), of the program below. In [9]: 1 2 def prob14(L): if len(L) <= 1: 3 4 return e output = e for x in L: for y in L: output += x*y 7 8 for x in L: 10 output += x left - L[ 0 : len(L)//2 ] right - L[ len(L)//2 : len(L) ] return output + prob15(left) + prob15(right) 11 12 13 14 ANSWER: T(n) =

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

% Define the function f(x) f = @(x) -1*(x < 0) + 1*(x >= 0 & x <= 2); % Set the maximum value of N Nmax = 512; % Initialize the x-axis values for plotting x = linspace(-1,3,1000); % Compute the Fejér sums for various values of N F = zeros(length(x), Nmax); for N = 1:Nmax % Compute the Nth Fejér sum Sn = @(x) 0; for n = 1:N bn = (-1)^(n+1) / (n*pi); Sn = @(x) Sn(x) + bn*sin(n*pi*x); end FN = @(x) (1/N) * Sn(x); % Evaluate the Fejér sum at each point on the x-axis I tried to submit this to MATLAB, but can't seem to get it right.
Generate a graph of performance improvement for code below. Tip: Figure 5.17 in the textbook provides an example of a graph depicting performance improvements associated with loop unrolling. code: //normal code int main() { int n, sum=0; n=50; int a[50]; { for(int i=0; i<n; i++) { sum= sum +a[i]; } printf("sum is %d", sum); return 0; } //with unrolling int main() { int n, sum=0; n=50; int a[50] for(int i=0; i<n; i+=10) { scanf("%d", &a[i]); } sum= sum + a[0]; sum= sum + a[1]; sum= sum + a[2]; sum= sum + a[3]; sum= sum + a[4]; sum= sum + a[5]; sum= sum + a[6]; sum= sum + a[7]; sum= sum + a[8]; sum= sum + a[9]; printf("sum is %d", sum); return 0; }
Write a program using Scilab that includes the following lines x = linspace(0,1,N); y = sin(%pi*x/2); xi = linspace(0,1,100); The program should use the interp1 function to perform spline interpolation of the (x,y) data at the 100 xi points. These interpolated values should be compared to the exact values of the function sin(π x /2) and your program should use this to find the smallest number of samples N that gives an interpolation with an error of no more than ±0.00001
Write a concise Matlab script that would numerically find the convolution described in Problem 2. b) Let x = [3 2 6 8] and y = [4 1 3 5]. Write the shortest MATLAB expression to compute z that multiplies each element of x with the corresponding element of y. In other words, write the Matlab code that computes z = [12 2 18 40].
Let us define a sequence parity function as a function that takes in a sequence of binary inputs and returns a sequence indicating the number of 1’s in the input so far; specifically, if at time t the 1’s in the input so far is even it returns 1, and 0 if it is odd. For example, given input sequence [0, 1, 0, 1, 1, 0], the parity sequence is [0, 0, 0, 1, 0, 0]. Implement the minimal vanilla recurrent neural network to learn the parity function. Explain your rationale using a state transition diagram and parameters of the network.
The power function can be defined as follows: What is the worst-case running time complexity of this function? Select one: a. O(n2)O(n2) b. O(n)O(n) c. O(n−−√)O(n) d. O(logn)
Scenario: In a biased N-bit binary number system with bias B, positive and negative numbers are represented as their value plus the bias B. For example, for 5-bit numbers with a bias of 15, the number 0 is represented as 01111, 1 as 10000, and so forth. Biased number systems are sometimes used in floating point mathematics. Consider a biased 8-bit binary number system with a bias of 12710 Question: What is the representation and value of the most negative number?
For each of the following two code segments, decide whether it is suitable for parallel execution and response according to your justification: add OpenMP pragmas to make the loop parallel or briefly explain why the code segment is not suitable for parallel execution. (A): for ( i = 0; i < n; i++ ) { x [ i ] = 3 * i + 5; y [ i ] = log ( x [ i ] ); } (B): x [ 0 ] = 1; x [ 1 ] = 2; for ( i = 2; i < n; i++ ) x [ i ] = x [ i – 1 ] * x [ i – 2 ] ;
Coding in Python with NumPY and Matplotlib functions. Suppose x has values of 0.0, 1.5, 2.4, 4.2 and y has values 12.5, -3.0, 6.4, 32.1 Plot the x, y pairs on a graph as square markers of magenta color. Do not draw a curve through the data points.
Implement this algorithm in C program . Show the gantt chart as output. Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive).
Write PHP Program to compute inside heat transfer coefficient based on the following conditions; (hid)/k=C(NRe)0.8(Pr)1/3(NVis)0.14 where; C=0.021 for gases C=0.023 for non-viscous liquid C=0.027 for viscous liquid Pr=(Cpμ)/k, NRe=(ρud)/μ, μ=0.8x10-3 Ns/m2, ρ=995kg/m3, d=0.025m u=1.116m/s, Cp=4.2x103 kg/m3, k=0.25 W/m.K, Nvis ≈ 1.0
There are two algorithms called alg1 and alg2 for a problem of size n. alg1 runs in n2 microseconds and alg2 runs in 100n log n microseconds. alg1 can be implemented using 4 hours of programmer time and needs 2 minutes of cpu time. on the other hand, alg2 requires 15 hours of programmer time and 6 minutes of cpu time. if programmers are paid 20 dollars per hour and cpu time costs 50 dollars per minute, how many times must a problem instance of size 500 be solved using alg2 in order to justify its development cost?