(1) Consider the following pseudocode of a function which takes an integer n ≥ 0 as input.Function foo(n)if n=0 then| Return;endfor i=0 to n - 1 doPrint "*¹;endfoo(n-1);Let T(n) be the number of times the above function prints a star (*) when called with input n ≥ 0.What is T(n) exactly, in terms of only n (and not values like T(n-1) or T(n-2))? Prove your statement.

Pseudocode is a high-level, human-readable description of a computer program's logic and algorithmic…

(1) Consider the following pseudocode of a function which takes an integer n ≥0 as input. Function foo(n) if n == 0 then Return; end for i=0 to n - 1 do | Print '*'; end foo(n-1); Let T(n) be the number of times the above function prints a star (*) when called with input n ≥ 0. What is T(n) exactly, in terms of only n (and not values like T(n-1) or T(n-2))? Prove your statement.

(1) Consider the following pseudocode of a function which takes an integer n ≥0 as input. Function foo(n) if n == 0 then Return; end for i=0 to n - 1 do | Print ''; end foo(n-1); Let T(n) be the number of times the above function prints a star () when called with input n ≥ 0. What is T(n) exactly, in terms of only n (and not values like T(n-1) or T(n-2))? Prove your statement.

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 8SA

See similar textbooks

Similar questions

Code in Python Write a function, print_integers_less_than(n), which takes an integer parameter n and prints each integer k which is at least 0 and is less than n, in ascending order. Hint: use a simple for loop. For example: Test Result print_integers_less_than(2) 0 1 print_integers_less_than(5) 0 1 2 3 4 print_integers_less_than(-3)
In loop functions.py, define a function named permutations that takes two paramters, n and r, in that order. This function returns the number of different permutations of length r from set of size n. Essentially to calculate these permutations, the function should compute the product (n - r+1)*(n-r+2)*(n-r+3)*...*(n-2)*(n-1) or n!/(n-r)!. No if statements or built in math functions should be used. For or while loops are best reccomended.
1. Given the following function: int Fn (int N) { } if (N == 0) return 2; else return N + Fn (N/3); a) What type of function is this, Iterative or Recursive? Give justification. b) Given N = 17, what will be the output from this function? Show your work.
What does the function return for any positive values of x and n ? The answer should be a general formula in terms of x and n. int what_do_I_do ( int x, int n ) { if ( n = = 1 ) return x; else return x + what_do_I_do ( x, n – 1 ); } C++ be quick please
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…
solve in assembley language, MIPS Square Root Calculation: Newton’s iterative method can be used to approximate the square rootof a number x. Let the initial guess be 1. Then each new guess can be computed as follows:guess = ((x/guess) + guess) / 2; Write a function called square_root that receives a double-precision parameter x, computes,and returns the approximated value of the square root of x. Write a loop that repeats 20 timesand computes 20 guess values, then returns the final guess after 20 iterations. Use the MIPSfloating-point register convention (Section 9.6) to pass the parameter x and to return thefunction result. All computation should be done using double-precision floating-pointinstructions and registers. Compare the result of the sqrt.d instruction against the result ofyour square_root function. What is the error in absolute value?
2) Let multidimensional array with size 3 x 4 be a {1,2,3,4,5,6,7,8,9,10,11,12} and b be the last digit of your student number. Accordingly, if we run the given functions in the following order, what will be the output? Explain step by step. b= 5 function1(b); print(A,b); function2(A,b); print(A, b); function3(A[b%4][b%3],b); print(A,b); void print(int a(][3],int b){ printf("\nb=%d",b); for(int i=0;i<4;i++}{ printf("\n"); for(int j=0;j<3;j++}{ printf("%3d",a[i][]); } void function1(int a)}{ a=a+2; void function2(int A[][3],int b){ for(int j=0;j<3;j++){ A[2]]=A[2][i]+b; } void function3(int a,int b){ a=a+b;
in javascript please create a function that does the following and is named as such please don't copy and paste the incorrect answer sequence( start, step ) This function takes two numeric inputs, start and step, and returns a function of no inputs. The ith invocation of the resulting function will generate the value: start + step * i. The first invocation is said to be the 0th. Examples var x = sequence( 3, 15 ) [ x(), x(), x() ] => [ 3, 18, 33 ] var y = sequence( 28, -5 ) [ y(), y(), y() ] => [ 28, 23, 18 ]
Write a recursive function called draw_triangle() that outputs lines of '*' to form a right side up isosceles triangle. Function draw_triangle() has one parameter, an integer representing the base length of the triangle. Assume the base length is always odd and less than 20. Output 9 spaces before the first '*' on the first line for correct formatting. Hint: The number of '*' increases by 2 for every line drawn. Ex: If the input of the program is: 3 the function draw_triangle() outputs: * *** Ex: If the input of the program is: 19 the function draw_triangle() outputs: * *** ***** ******* ********* *********** ************* *************** ***************** ******************* Note: No space is output before the first '*' on the last line when the base length is 19. if __name__ == '__main__': base_length = int(input()) draw_triangle(base_length)
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
Given the following function f, what will be the output of the function call f(3)? int f(int n){ if(n==0) return 1; else return n*f(n+1); }
Write a function count_evens() that has four integer parameters, and returns the count of parameters where the value is an even number (i.e. evenly divisible by 2). Ex: If the four parameters are: 1 22 11 40 then the returned count will be: 2 Hint: Use the modulo operator % to determine if each number is even or odd. Your program must define the function:count_evens(num1, num2, num3, num4) python # Define your function here if __name__ == '__main__': num1 = int(input()) num2 = int(input()) num3 = int(input()) num4 = int(input()) result = count_evens(num1, num2, num3, num4) print('Total evens:', result)