Write a C++ program, no need to be object-oriented, to test the following three functions. Each function receives one parameter n, which is a positive integer. int F1(int n) { if (n if (n % 2 int result 0) return 1; 0) { F1(n / 2); return result * result; else 1); return 2 * F1(n } int F2(int n) { if (n return 2 * F2(n - 1); 0) return 1; int F3(int n) { if (n 0) return 1; return F3(n - 1) + F3(n - 1); } Test the functions by calling them with the following values for n: 1, 3, 5, 16, 24, 26, 30. Submit your test program and in your report answer the following questions: a. What does each function return as a function of input parameter n? b. Which function is the worst in terms of time efficiency? Support your answer by stating, without proof, the running time growth rate, as a function of n, of each of the above functions.

Write a C++ program, no need to be object-oriented, to test the following three functions. Each function receives one parameter n, which is a positive integer. int F1(int n) { if (n if (n % 2 int result 0) return 1; 0) { F1(n / 2); return result * result; else 1); return 2 * F1(n } int F2(int n) { if (n return 2 * F2(n - 1); 0) return 1; int F3(int n) { if (n 0) return 1; return F3(n - 1) + F3(n - 1); } Test the functions by calling them with the following values for n: 1, 3, 5, 16, 24, 26, 30. Submit your test program and in your report answer the following questions: a. What does each function return as a function of input parameter n? b. Which function is the worst in terms of time efficiency? Support your answer by stating, without proof, the running time growth rate, as a function of n, of each of the above functions.

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

In C programming, if the return type of a function is Void how can you implement assert statements? For example, Void ceasar(int n, char*x); //if char = c and n = 3 output == f how do i use assert statements as this does not work assert (caesar(3,c)==f);
int p =5 , q =6; void foo ( int b , int c ) { b = 2 * c ; p = p + c ; c = 1 + p ; q = q * 2; print ( b + c ); } main () { foo (p , q ); print p , q ; } Explain and print the output of the above code when the parameters to the foo function are passed by value. Explain and print the output of the above code when the parameters to the foo function are passed by reference. Explain and print the output of the above code when the parameters to the foo function are passed by value result. Explain and print the output of the above code when the parameters to the foo function are passed by name.
Programming Language :- C 7. A function is defined for a positive integer n as follows: 3n + 1, if n is odd f(n) = { n if n is even 2 We consider the repeated application of the function starting with a given integer n, as follows: f(n), f(f(n)), f(f(f(n))), It is conjectured that no matter which positive integer n you start from; this sequence eventually will reach to 1. If n = 13, the sequence will be 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. Thus if you start from n = 13, you need to apply function 10 times to reach 1. Write a recursive function that takes n as an input number and returns how many times function f has to be applied repeatedly to reach 1.
Consider the following function that takes two positive integers x and y as its input parameters. This function is supposed to be a recursive function but it is not. Which option best describes the reason? |def recursive_function2(x, y): if x < ® and y < ®: return False else: result - sum([x, y]) result +- 10 return rec_function2(x-1, y-1) A recursive function must call itself. This function calls a function with a different name. There is nothing wrong with this recursive function. ) This function does not import any module to call the function sum() O A recursive function can only call itself and must not call any other function e.g., sum()
Write a c++ program: Write a function named convertToLowestTerms that inputs two integer parameters by reference named numerator and denominator. The function should treat these variables as a fraction and reduce them to lowest terms. For example, if numerator is 20 and denominator is 60, then the function should change the variables to 1 and 3, respectively. This will require finding the greatest common divisor for the numerator and denominator then dividing both variables by that number. If the denominator is zero, the function should return false, otherwise the function should return true. Write a driver program that uses convertToLowestTerms to reduce and output several fractions.
Write a recursive function rec_string that produces the output shown below for the corresponding function calls. Write a main function to test the function. Method call rec_string(‘abcde’), will produce the following output: * e de cde bcde abcde Method call rec_string(‘abc’), will produce the following output: * c bc abc
LISP Function help please A function that generates a random day of the week, then displays a message saying that "Today is ... and tomorrow will be ...". Then use the built-in function random first to generate a number between 0 and 6 (including). The expression (random) by itself generates a random integer. You can call it with one parameter to return a value within the range from 0 to the value of the parameter-1. For example, (random 10) will return a value between 0 and 9. Next, use the number generated at the previous step to retrieve the symbol for the day of the week from the list. Use the built-in elt. Extract the symbol-name of the day first, then apply the built-in function capitalize to it. Use the result in the princ function call, and do the same thing for the next day. Make the function return true (t) instead of the last thing it evaluates, to avoid seeing the message printed more than once.
true false void ffx() is a function with no return value void ffx() is a function with no argument int ffx(char x) is a function with int return value int ffx(char *x) is a function with parameter passed by reference char ffx( int x) is a function with int return value int ffc(char &x) is a function with parameter passed by reference
Here, Python3 function sqr(n) that returns the square of its numeric parameter n
Define a function in C++ language that takes an integer n as the parameter and then multiplies it by 8 without using the '*' operator or any loop. Return the value of n after multiplying it with 8.
Write a function which takes two integer parameters for values to be added together and returns the result by value. The function may not print anything or read anything directly from the user (i.e. no cin/cout in the function). Assume that the values passed to the function will not be negative, but could be 0 or positive, and will both be integers. The function must implement addition recursively, and cannot use the standalone + operator (only ++) or call any other functions.
Problem: Recursive Power Method Design a python function that uses recursion to raise a number to a power. The function should accept two arguments: the number to be raised, and the exponent. Assume the exponent is a nonnegative integer. Write the main() function to input the required parameters as shown in thesample input/output. Sample Output:Average number of words per line: 26.0Enter a number: 2Enter a positive whole number between 1 and 100: 102.0 raised to the power of 10 is 1,024.00