Consider the function below written in Python3: def foo(a, b=[1]): if a <= 1: return b b_new [b[i] + b[i+1] for i in range(len(b)-1)] return foo(a-1, [1] + b_new + [1]) Fill-in the blank with the correct answer. The recurrence relation for foo(a, b) when a > 0 and assuming n is the length of b is: T(a, n) = T ( +O(n %3D

Consider the function below written in Python3: def foo(a, b=[1]): if a <= 1: return b b_new [b[i] + b[i+1] for i in range(len(b)-1)] return foo(a-1, [1] + b_new + [1]) Fill-in the blank with the correct answer. The recurrence relation for foo(a, b) when a > 0 and assuming n is the length of b is: T(a, n) = T ( +O(n %3D

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

: Write a small matrix library The library should have the following functions: double sumOfRow(const double mat[][MAX_COL], const int row, const int maxRow); double sumOfCol(const double mat[][MAX_COL], const int column, const int maxRow); void fillWithRandomNum(double mat[][MAX_COL], const int maxRow); void printMatrix(const double mat[][MAX_COL], const int maxRow);
function myCompose(f,g){// TODO: return (f o g);// that is, a function that returns f(g(x)) when invoked on x.}
Write a function that takes in an integer n and computes n!. Do this without recursion. In [ ]: deffactorial_iter(n):"""Takes in an integer n>0 and returns the product of all integers from 1 to n."""# YOUR CODE HEREraiseNotImplementedError() In [ ]: In [ ]: assert factorial_iter(6) == 720 assert factorial_iter(7) == 5040 assert factorial_iter(10) == 3628800
Part (a) Write a python function that computes the binomial coefficient ("). The function should return the correct answer for any positive integer n and k where k=m pass Part (c) Suppose that the number of people in the trial is 100. Then: • Plot a curve that shows how the probability of type 1 error changes with the choice of m, for m = 1,...n assuming that the null hypothesis holds (in red), • On the same picture, plot the probability of type 2 error vs the value of m in the case in which the new drug is effective with proability 0.68 (in blue). You can plot the two curves using matplotlib.pyplot. You can select the color by passing color='r' or color='b' to the plt.plot() function. [4]: n - 100 # your code here def plot_curve (): pass [5]: plot_curve() Part (d) Based on the picture above, what value of m do you think would be suitable to keep both type 1 and type 2 error small at the same time? (You may assume that the company claims the new drug has 68% accuracy) [6]: # your…
A/ find code optimization method to this code and then find type to this code 1- For(i=1;i
int a[10] = {0,1,2,3,4,5,6,7,8,9};int *m = &a[0];int *p = &a[5];int *q = &a[1]; p = (int) m + (int) p - (int) q; what is the value of of *p
c++ PLEASE TRACE THE FUNCTION Given the code:void d(int n) { if(n<2) { cout << n << " "; return; } cout << n << " "; d(n/3);} 1. Trace the function when n is 12.
Complete the following function using pass-by-reference: void findMax(int &max, int a) which assigns value ‘a’ to ‘max’ if a > max. Write a pseudo-code then implement a program in C language to find the maximum in a sequence of numbers using this function.
function [P, A] = rect(L, W) P= 2 (L+ W); A =L*W; end Above function is defined to find perimeter and area of a rectangle. If a rectangle has length 10 mm and width 7 mm then the correct way to get perimeter and area of a given rectangle by executing this function is Select one: a. [A, B] = rect(10, 7) b. rect(7, 10) c. [A, B] = rect(7, 10) d. rect(10, 7)
8Consider the following ANSI C function: int SimpleFunction (int Y[ ], int n, int rx) { int total = Y[0], looplndex; for (looplndex = 1; looplndex <= n - 1; looplndex++) total = x x total + Y[looplndex]; return total; Let Z be an array of 10 elements with Z[i] = 1, for all i such that 0 sis 9. The value returned by SimpleFunction (Z, 10, 2) is (100 01
Programming Language: C Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true. If no such element is not found, the function returns -1. int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A. void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: 1. Start with accumulator = A[0] 2. For i=1...length-1 compute accumulator=f(accumulator, A[i]) 3. Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array. int reduce(int* A, int n, int (*f)(int,int)); Test for the functions: // used for test Q3-find bool is_even(int x) { return x%2 == 0; } bool is_positive(int x) { return x>0; } void…
C++ help please my function: bool palindrome(const int a[], int start, int end){ bool flag = true; for (int i = start; i <= end / 2 && a[i]!= 0; i++) { if (a[i] != a[end - i - 1]) { flag = false; cout << "Array Is Not Palindrome\n"; return false; } } if (flag == true) cout << "Palindrome"; return true;} the main: int a[]= {1,2,1,2,1};cout << "Array = [1,2,1,2,1}\n";cout << "Testing array palindrome using 3 parameters:\n";palindrome(a, 2, 3); please help my function is not doing what it is supposed to :( it returns true when its not supposed to