Consider the following C++ function. int mystery(int num1, int num2){if (num1 > 0){for (int i = 1; i <= num1; i++)num2 = num2 * i;return num2;}else if (num2 > 0){for (int i = 0; i <= num2; i++)num1 = num1 + i;return num1;}return 0;}What is the output of the following statements?a. cout << mystery(4, -5) << endl;b. cout << mystery(-8, 9) << endl;c. cout << mystery(2, 3) << endl;d. cout << mystery(-2, -4) << endl;

Consider the following C++ function. int mystery(int num1, int num2){if (num1 > 0){for (int i = 1; i <= num1; i++)num2 = num2 * i;return num2;}else if (num2 > 0){for (int i = 0; i <= num2; i++)num1 = num1 + i;return num1;}return 0;}What is the output of the following statements?a. cout << mystery(4, -5) << endl;b. cout << mystery(-8, 9) << endl;c. cout << mystery(2, 3) << endl;d. cout << mystery(-2, -4) << endl;

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

Implement in C Programming 6.6.3: Function with loop: Shampoo. Write a function PrintShampooInstructions(), with int parameter numCycles, and void return type. If numCycles is less than 1, print "Too few.". If more than 4, print "Too many.". Else, print "N: Lather and rinse." numCycles times, where N is the cycle number, followed by "Done.". End with a newline. Example output with input 2:1: Lather and rinse. 2: Lather and rinse. Done. Hint: Declare and use a loop variable. #include <stdio.h> /* Your solution goes here */ int main(void) { int userCycles; scanf("%d", &userCycles); PrintShampooInstructions(userCycles); return 0;}
In C++ Consider the following recursive function (Chapter 17, #9, modified) void recFun(int x) { if (x > 10) { recFun(x / 10); cout<< x % 10; } else cout<< x; } How can the code be modified so that the sum of all digits is printed?
Write a C++ program that includes the following function: a boolean function with the name of "evenorodd" that tests a number to see whether it is even or odd. your program should do the following in each iteration: ask the user to enter a number and each time by calling "evenorodd" function determines if the number is even or odd? then ask the user: "Do you want to continue?" if the answer is "Y" or "Yes", then repeat the process
Write a C++ function using recursion that returns the Greatest Common Divisor of two integers. The greatest common divisor (gcd) of two integers, which are not zero, is the largest positive inteteger that divides each of the integers. The code should follow the exact function declaration: int GCD(int number1, int number2);
Write a C++ program that would implement the function called filterString which accepts a string s that contains numbers and letters mixed up. The function must return an integer corresponding to the numbers in s in the order that they appear. If there are no numbers in s, the function should return 0. TEST CASES: filterString(‘123’) = 123 filterString(‘abc’’) = 0 filterString(‘aa 112 3dd’) = 1123 ASSUMPTIONS Assume that all the inputs are strings (no need for try-catch method) Please take note of test cases and assumption. Thank you!
Draw Flowchart of this program // C# program for implementation // of Lagrange's Interpolation using System; class GFG { // To represent a data point // corresponding to x and y = f(x) class Data { public int x, y; public Data(int x, int y) { this.x = x; this.y = y; } }; // function to interpolate the given // data points using Lagrange's formula // xi corresponds to the new data point // whose value is to be obtained n // represents the number of known data points static double interpolate(Data []f, int xi, int n) { double result = 0; // Initialize result for (int i = 0; i < n; i++) { // Compute individual terms // of above formula double term = f[i].y; for (int j = 0; j < n; j++) { if (j != i) term = term * (xi - f[j].x) / (f[i].x - f[j].x); } // Add current term to result result += term; } return result; } // Driver code public static void Main(String[] args) { // creating an array of 4 known data points Data []f = {new Data(0, 2), new Data(1, 3), new Data(2, 12), new Data(5,…
Write a program in C language that implements a simple hand calculator. The followings arithmetic functions are available on the calculator: addition, subtraction, multiplication, division, cosine, sine and tangent. The result of the function must have the same number of digits of precision as the highest precision operand of the function. An example of the program behavior is shown below. > 8.91 + 1 = 9.91 > 9.61*3.11 = 29.8871 > cos(3.14152759) = 0.99849715
Write a C program that creates a security access code from a social security number entered by a user as follows: Using a recursive function it adds all of the digits of the social security number and then using a regular function gets the square number of the sum and displays it. The access code displayed should be initialized as an integer number but using type casting is displayed as a floating number.
Implement in C Programming 6.25.1: LAB: Fibonacci sequence The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index n as a parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion. #include <stdio.h> int Fibonacci(int n) { /* Type your code here. */} int main(void) { int startNum; scanf("%d", &startNum); printf("Fibonacci(%d) is %d", startNum, Fibonacci(startNum)); return 0;}
Implement a recursive C++ function which takes two integers num and den as arguments and returns theinteger quotient that will result when num is divided by den. The prototype of your function should be:int quotient (int num, int den)Hint: Think about repeated subtraction
Write in C Language Description F(x) = x + 1 G(x, y) = x + y Please write a program to calculate the value of composite of F and G Input Input will be the composite of F and G. The parameter of F and G are integer only. Output An integer represent the value of function. Sample Input 1 F(G(1,F(3))) Sample Output 1 6
Write a C program where you have to take 2 numerical inputs and 1 input for operator {the operator input has to be either ‘+’, ’-’, ’*’). Depending on some comparisons, you need to carry out three operations: addition ( + ), subtraction ( - ) and multiplication ( * ). Each of these operations will be implemented in separate methods. (i) If the first number is greater than the second number, do subtraction and print the result. (ii) If the first number is less than the second number, do addition and print the result. (iii) If the second number is equal to the second number, do multiplication and print the result