Consider the following recursive function: (M-4) void method(int z) { if (z > 0 && z < 10) { cout << z << " "; method(z + 1); } } What is the output of the following statements? a. method(0); b. method (5); c. method (10); d. method (-5);

Consider the following recursive function: (M-4) void method(int z) { if (z > 0 && z < 10) { cout << z << " "; method(z + 1); } } What is the output of the following statements? a. method(0); b. method (5); c. method (10); d. method (-5);

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 1TF

See similar textbooks

Similar questions

42) Look at the following method: public static int test2 (int x, int y) if (x < y) { return -5; } else { return (test2 (x - y, y + 5) + 6) ; } } What is returned for test2 (10, 20)? A) -5 B) 1 C) 6 D) 10 43) This term is used for methods that directly call themselves. A) Simple recursion C) Absolute recursion B) Direct recursion D) Native recursion 44) If the base case in a recursive method is never reached: A) The result will always be off by one. C) The method will call itself indefinitely. B) The method will call itself only once. D) The method will never call itself. 45) A(n) is an object that is generated in memory as the result of an error or an unexpected event. A) exception C) default exception handler B) exception handler D) error message 46) All of the exceptions that you will handle are instances of classes that extend this class. A) Exception C) IOException B) RunTimeException D) Error 47) All exceptions are instances of dasses that extend this class. A) Throwable C)…
(a)consider following code:public class CyclomaticComplexityDemo {public static void main(String[] args) {// TODO Auto-generated method stubint var1 = 10;int var2 = 9;int var3 = 8; 6 int var4 = 7;if (var1 == 10){if(var2 > var3){var2 = var3;}else{if (var3 > var4){var3 = var4;}else{var4 = var1;}}}else{var1=var4;}System.out.println("Printing value for var1, var2, var3, and var4"+var1+" "+var2+" "+var3+""+var4);}}i) Find the cyclometric complexity with all the techniques.ii) Find the independent paths
Problem Statement: The mathematician Conway imagined a game, called game of life, which considered cells that are susceptible to reproduce, disappear, or survive when they obey certain rules. These cells are represented by elements on a grid of squares, where a grid has an arbitrary size. Thus, each cell (except those on the boundaries of the grid) is surrounded by eight squares that contain other cells. The rules are stated as follows: 1. Survival: Each cell that has two or three adjacent cells survives until the next generation.2. Death: Each cell that has at least four adjacent cells disappears (or dies) by overpopulation. Also, each cell that has at most one adjacent cell dies by isolation.3. Birth: Each empty square (i.e., dead cell) that is adjacent to exactly three cells gives birthto a new cell for the next generation.It is worth noting that all births and deaths occur at the same time during a generation. Write a program that simulates this game and displays all successive…
Explain
// The language is java Part I: Use of recursive method (4 points for students who need recursion/extracredit) Description: Code a class called RecursiveMultiply in which it will accept two integer arguments entered from user; pass these integers to a recursive method that returns the multiplication result of these two integers. The multiplication can be performed as repeated addition, for example, if two integers are 7 and 4: 8 * 4 = 4 + 4 + 4 + 4 + 4 + 4 + 4 + 4 You will write the application with GUI and recursion to display the result in a noneditable text field, based on the user’s entry from two text fields, while an OK button is pressed. You will utilize the exception handling code as you did in your Lab 4 and Lab 5 to verify if data entered in the text fields are valid (numerical and positive data only). You will make your own decision if there is any explanation that is not described in this specification. Finally, code a driver program that will test your class…
For glass box testing of a recursive function, you should test cases where: a) the function returns without a recursive call, ie using a base case b) the function makes exactly one recursive call c) the function makes more than one recursive call d) all of these
Question 2: Implementing a Recursive Function Implement a method named "Recursive Problem". This method takes two arguments whose data types are "Objects". Object Data Type is a non-primitive data types, and it can be referenced with any primitive data type i.e. It can be assigned values that belong to either int or float or string or char data types
7. Recursive Power Method In Python, design a 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.
Exercise 4 (class Ackermann) The Ackermann recursive function is defined as follows: n +1 А(т - 1,1) A(m – 1, A(m, n – 1)) if m> 0 and n > 0. if m %3D А(т, п) — if m > 0 and n = 0 Its arguments are never negative and it always terminates. Write a Java method which returns the value of A(m,n). Write the following code fragment inside the main method to test Ackermann function and report what will happen. for (m = 0; m <= 4; m++) for (n = 0; n < 6 - m; n++) System.out.printf("A(%d, %d) = %d\n", m, n, ackermann(m, n));
Problem 3 (Comparing Student Data)Write a method called compare_average() that takes a student object as a parameter.This method must compare the average grades of the calling object with that of theparameter object and print the results. It does not return anything.See the sample output below. Alice has a higher average than BobBob has a higher average than CathyAlice has a higher average than Cathy
*C Language The greatest common divisor of integers x and y is the largest integer that divides both x and y. Write a recursive function GCD that returns the greatest common divisor of x and y. The GCD of x and y is defined as follows: If y is equal to zero, then GCD(x, y) is x; otherwise GCD(x, y) is GCD(y, x % y) where % is the remainder operator.
Method Overloading is a feature that allows a class to have two or more methods having same name, if their argument lists are different. Argument lists could differ in: 1. Number of parameters. 2. Data type of parameters. 3. Sequence of Data type of parameters. Write different version of method sum() that display the sum of the values received as parameter according to the following main method content: public static void main(String[] args) { sum ( 10, 10 ); sum ( 10, 10, 10 ); sum ( 10.0, 10.0 ); sum ( 10, 10.0 ); sum ( 10.0, 10); } You have to define five functions with the specified types. Then, demonstrate the Argument Promotion concept by reducing the number of method to two.