Starting Out with Java: Early Objects, Student Value Edition (6th Edition)
6th Edition
ISBN: 9780134457918
Author: GADDIS, Tony
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 14, Problem 1MC
Program Description Answer
When a method is called from the main method then, it calls itself four times and the depth of the recursion will be four.
Hence, the correct option is “B”.
Expert Solution & Answer
Explanation of Solution
Four:
The depth of the recursion depends on the number of times the method calls itself.
Explanation for incorrect options:
One:
The depth of the recursion depends on the number of times the method calls itself and it is given that the method calls itself four times.
Hence, option “A” is wrong.
Five:
The depth of the recursion depends on the number of times the method calls itself and it is given that the method calls itself four times.
Hence, the option “C” is wrong.
Nine:
The depth of the recursion depends on the number of times the method calls itself and it is given that the method calls itself four times.
Hence, the option “D” is wrong.
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
java
Exercise 1:Write a program to do the following using the Math class:
Ask a user to enter two integer numbersFinds the square root of each numberFinds the minimumFinds the maximum.
Exercise 2:Write a program to calculate area of circle. The main method should pass the radius of the circle to a static method named calculateArea(). The program should display the calculated area inside the main method.
JAVA PROGRAM ASAP
************* THE PROGRAM MUST WORK IN HYPERGRADE AND PASS ALL THE TEST CASES.****************
Chapter 16. PC #8. Sum of Numbers (page 1073)
Write a method that accepts an integer argument and returns the sum of all the integers from 1 up to the number passed as an argument. For example, if 50 is passed as an argument, the method will return the sum of 1, 2, 3, 4, . . . 50. Use recursion to calculate the sum. Demonstrate the method in a program.
The program should ask the user to enter a number, which is then used to display the sum. if the user enters -1, then exit the program.
Test Case 1
Please enter a number to calculate the sum or -1 to exit:\n5ENTERThe sum of first 5 natural numbers is 15.\nPlease enter a number to calculate the sum or -1 to exit:\n10ENTERThe sum of first 10 natural numbers is 55.\nPlease enter a number to calculate the sum or -1 to exit:\n-1ENTER
Test Case 2
Please enter a number to calculate the sum or -1 to…
Problem: Min Method (Return the Smaller Number)
Create a method GetMin(int a, int b), which returns the smaller of two numbers. Write a program, which takes as input three numbers and prints the smallest of them. Use the method GetMin(…), which you have already created.
Sample Input and Output
Input
Output
Input
Output
123
1
-100-101-102
-102
Hints and Guidelines
Define a method GetMin(int a, int b) and implement it, after which invoke it from the main program as shown below. In order to find the minimum of three numbers, first, find the minimum of the first two and then the minimum of the result and the third number:
var min = GetMin(GetMin(num1, num2), num3);References:
Programming Basics with C#: Comprehensive Introduction to Programming with C#: Book + Video Lessons by Dr. Svetlin Ivanov NakovPaperback
Chapter 14 Solutions
Starting Out with Java: Early Objects, Student Value Edition (6th Edition)
Ch. 14.2 - It is said that a recursive algorithm has more...Ch. 14.2 - Prob. 14.2CPCh. 14.2 - What is a recursive case?Ch. 14.2 - What causes a recursive algorithm to stop calling...Ch. 14.2 - What is direct recursion? What is indirect...Ch. 14 - Prob. 1MCCh. 14 - This is the part of a problem that can be solved...Ch. 14 - This is the part of a problem that is solved with...Ch. 14 - This is when a method explicitly calls itself. a....Ch. 14 - Prob. 5MC
Ch. 14 - Prob. 6MCCh. 14 - True or False: An iterative algorithm will usually...Ch. 14 - True or False: Some problems can be solved through...Ch. 14 - True or False: It is not necessary to have a base...Ch. 14 - True or False: In the base case, a recursive...Ch. 14 - Find the error in the following program: public...Ch. 14 - Prob. 1AWCh. 14 - Prob. 2AWCh. 14 - What will the following program display? public...Ch. 14 - Prob. 4AWCh. 14 - What will the following program display? public...Ch. 14 - Convert the following iterative method to one that...Ch. 14 - Write an iterative version (using a loop instead...Ch. 14 - What is the difference between an iterative...Ch. 14 - What is a recursive algorithms base case? What is...Ch. 14 - What is the base case of each of the recursive...Ch. 14 - What type of recursive method do you think would...Ch. 14 - Which repetition approach is less efficient: a...Ch. 14 - When recursion is used to solve a problem, why...Ch. 14 - How is a problem usually reduced with a recursive...Ch. 14 - Prob. 1PCCh. 14 - isMember Method Write a recursive boolean method...Ch. 14 - String Reverser Write a recursive method that...Ch. 14 - maxElement Method Write a method named maxElement,...Ch. 14 - Palindrome Detector A palindrome is any word,...Ch. 14 - Character Counter Write a method that uses...Ch. 14 - Recursive Power Method Write a method that uses...Ch. 14 - Sum of Numbers Write a method that accepts an...Ch. 14 - Ackermarms Function Ackermanns function is a...Ch. 14 - Recursive Population Class In Programming...
Knowledge Booster
Similar questions
- T/F Java methods can return more than one item if they are modified with the reserved word continue, as in public continue int foo() {...}arrow_forwardUsing JAVA Recursive Power Method Write a method called powCalthat uses recursion to raise a number to a power. The method should accept two arguments: The first argument is the exponentand the second argument is the number to be raised(example”powCal(10,2)means2^10). Assume that the exponent is anonnegative integer. Demonstrate the method in a program called Recursive (This means that you need to write a program that has at least two methods: mainand powCal. The powCal method is where you implement the requirements above and the main method is where you make a method call to demonstrate how your powCalmethod work).arrow_forwardHow to answer the following questions Given the following code, what are the constraints on the input argument? int mystery(int num){ if (num == 0) return 0; else if (num > 100) return -1; else return num + mystery(num – 1); } A. It must be between 0 and 100 inclusive. B. It must be greater than 0. C. It must be less than 0 or greater than 100. D. It must be greater than or equal to 0. The number of recursive calls that a method goes through before returning is called: A. order of growth efficiency. B. the depth of recursion. C. combinatorial recursive count. D. activation stack frame. The following code is supposed to return the sum of the numbers between 1 and n inclusive, for positive n. An analysis of the code using the "Three Question" approach reveals that: int sum(int n){ if (n == 1) return 1; else return (n + sum(n)); } A. it fails the base-case question. B. it fails the smaller-caller question. C. it fails the general-case…arrow_forward
- Method: sumOdds(value: int): This method will sum all the odd values from 1 upto the value passed by parameter. This will display the sumas an integer value.Method: characterCount(phrase: str): This method will count the number of characters in the phrase that is passed by parameter. You cannot useany built in function ( ie len() ) and must use a looping activity. This should display the number of characters inthe phrase as an integerMethod: multiplicationPractice(): This method is to practice simple multiplication problems. The program should randomly generate twonumbers from 1-10 for the user to multiply. It should display the multiplication problem and allow the user toanswer the problem. It should display if the user got the answer correct or incorrect. The activity shouldcontinue until the user has gotten 3 different practice problems correct.Method: order(value1: int, value2: int, value3: int): This method is to order the 3 passed value from least to greatest. It should display…arrow_forwardCreate a C# statement that uses each of the following built-in methods you have used in previous chapters, then make an intelligent guess about the return type and parameter list for the method used in each statement you created. a. Console.WriteLine() b. String. Equals() c. String. Compare() d. Convert.Tolnt32 () e. Convert. Tochar() f. Array. Sort()arrow_forwardHere's the problem " (Math: approximate the square root) There are several techniques for implementingthe sqrt method in the Math class. One such technique is known as theBabylonian method. It approximates the square root of a number, n, by repeatedlyperforming a calculation using the following formula: nextGuess = (lastGuess + n / lastGuess) / 2 When nextGuess and lastGuess are almost identical, nextGuess is theapproximated square root. The initial guess can be any positive value (e.g., 1).This value will be the starting value for lastGuess. If the difference betweennextGuess and lastGuess is less than a very small number, such as 0.0001,you can claim that nextGuess is the approximated square root of n. If not, next-Guess becomes lastGuess and the approximation process continues. Implementthe following method that returns the square root of n.public static double sqrt(long n)" I have my java code here " import java.util.Scanner;public class Main2 {public static void main(String[]…arrow_forward
- 6.25 LAB: Step counter IN JAVA ** A pedometer treats walking 1 step as walking 2.5 feet. Define a method named feetToSteps that takes a double as a parameter, representing the number of feet walked, and returns an integer that represents the number of steps walked. Then, write a main program that reads the number of feet walked as an input, calls method feetToSteps() with the input as an argument, and outputs the number of steps. Use floating-point arithmetic to perform the conversion. Ex: If the input is: 150.5 the output is: 60 The program must define and call a method:public static int feetToSteps(double userFeet) import java.util.Scanner; public class LabProgram { /* Define your method here */ public static void main(String[] args) { /* Type your code here. */ }}arrow_forwardComputer Science I need the code for this in Alice programming Faery Magic Create a world that has at least 5 different objects from the Furniture Gallery and one Faery from the Fantasy/Faeries Gallery. The Faery has the power to make an object disappear. Everything that the faery touches disappear from the scene. Create an interactive game where the user can click one object at a time from the scene; then, the faery faces that object and moves toward it. Write a recursive method named CheckDistance, that checks whether the faery is very close to the object clicked by the user. If it is, the faery bends over to touch the object. After the faery touches the object, the object disappears (this is the base case of the recursion). If the faery is not yet close enough to the object to be able to touch it, the faery moves a small distance forward and the CheckDistance method is recursively called (this is the recursive case of the recursion). Include instructions for the game that appears…arrow_forwardExercise 6.14 JHTP: (Variable-Length Argument List) Write an application that calculates the product of a series of integers that are passed to method product using a variable-length argument list. Test your method with several calls, each with a different number of arguments. Exercise 6.17 JHTP: (Dice Rolling) Write an application to simulate the rolling of two dice. The application should use an object of class Random once to roll the first die and again to roll the second die. The sum of the two values should then be calculated. Each die can show an integer value from 1 to 6, so the sum of the clause will vary from 2 to 12, with 7 being the most frequent sum, and 2 and 12 the least frequent. Figure 6.21 shows the 36 possible combinations of the two die. Your application should roll the dice 36,000 times. Use a one-dimensional array to tally the number of times each possible sum appears. Display the results in a tabular format. Fig. 6.21 | The possible sums of two dice.arrow_forward
- Create a class named RecusiveMethod having a recursive method. The recursive method accepts an integer argument and displays all even numbers from 1 up to the number passed as an argument. For example, if 25 is passed as an argument, the method will display 2, 4, 6, 8, 10, 12, 14, ……24. Demonstrate the method.arrow_forwardQ1- Write a Java program with a method called multiplication Table that print calculates the multiplication table of a given number entered by the user. The method should take one argument and don't return a value.arrow_forwardPlease help me solve this with java A method named isAnOperation that takes a character and returns true if the character is one of the operations +, -, *, /, %, and false otherwise.The header of the method is as follows:public static boolean isAnOperation(char operation)2. A method named getResult that takes two floating point numbers and a character: the method returns a String that includes the two numbers, the operation, and the result. The header of the method is as follows:public static String getResult(double num1, double num2, char operation)For example, if the two floating point numbers are 12.5 and 11.4, and the operation + is passed to the method it must return the following String:12.5 + 11.4 = 23.93. In your main method:a. Read two floating point numbers from the user. You must prompt the user to enter the numbers with appropriate messages.b. Read the operation to be performed between the two numbers from the user. You must prompt the user to enter the operation with an…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT