Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Concept explainers
Textbook Question
Chapter 5.3, Problem 12SC
What does this
public static int mystery(int n)
{
n++;
n++;
return n;
}
public static void main(String[] args)
{
int a = 5;
System.out.println(mystery(a));
}
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Trace the execution of the call mystery(4) for the following recursive method using the technique shown in slide#15. What does this method do?
public static mystery(int n)
{
if (n == 0)
return 0;
else
return n*n + mystery(n-1);
}
Answer the above exercise using activation frames.
Write a recursive Java method that calculates the sum of n positive integer numbers. The math function is: f(n) = 1 + 2 + 3 + … + n.
Code:
public static int Func(int n) { if (n <= 1) return n; return n + Func(n - 1); }
Has an error.
Write a recursive program in Java to find the sum of integers from -100 to 0 and display the sum in the output.
Chapter 5 Solutions
Big Java Late Objects
Ch. 5.1 - Consider the method call Math.pow(3, 2). What are...Ch. 5.1 - What is the return value of the method call...Ch. 5.1 - The Math.ceil method in the Java standard library...Ch. 5.1 - It is possible to determine the answer to Self...Ch. 5.2 - What is the value of cubeVolume(3)?Ch. 5.2 - Prob. 6SCCh. 5.2 - Provide an alternate implementation of the body of...Ch. 5.2 - Declare a method squareArea that computes the area...Ch. 5.2 - Consider this method: public static int...Ch. 5.3 - What does this program print? Use a diagram like...
Ch. 5.3 - Prob. 11SCCh. 5.3 - What does this program print? Use a diagram like...Ch. 5.4 - Prob. 13SCCh. 5.4 - What does this method do? public static boolean...Ch. 5.4 - Implement the mystery method of Self Check 14 with...Ch. 5.5 - How do you generate the following printout, using...Ch. 5.5 - Prob. 17SCCh. 5.5 - Prob. 18SCCh. 5.5 - Prob. 19SCCh. 5.5 - The boxString method contains the code for...Ch. 5.6 - Consider the following statements: int...Ch. 5.6 - Consider this method that prints a page number on...Ch. 5.6 - Consider the following method that computes...Ch. 5.6 - The comment explains what the following loop does....Ch. 5.6 - In Self Check 24, you were asked to implement a...Ch. 5.7 - Explain how you can improve the intName method so...Ch. 5.7 - Prob. 27SCCh. 5.7 - What happens when you call intName(0)? How can you...Ch. 5.7 - Trace the method call intName(72), as described in...Ch. 5.7 - Prob. 30SCCh. 5.8 - Which lines are in the scope of the variable i...Ch. 5.8 - Which lines are in the scope of the parameter...Ch. 5.8 - The program declares two local variables with the...Ch. 5.8 - There is a scope error in the mystery method. How...Ch. 5.8 - Prob. 35SCCh. 5.9 - Consider this slight modification of the...Ch. 5.9 - Consider this recursive method: public static int...Ch. 5.9 - Consider this recursive method: public static int...Ch. 5.9 - Prob. 39SCCh. 5.9 - The intName method in Section 5.7 accepted...Ch. 5 - In which sequence are the lines of the Cubes.java...Ch. 5 - Write method headers for methods with the...Ch. 5 - Give examples of the following methods from the...Ch. 5 - Prob. 4RECh. 5 - Consider these methods: public static double...Ch. 5 - Prob. 6RECh. 5 - Design a method that prints a floating-point...Ch. 5 - Write pseudocode for a method that translates a...Ch. 5 - Describe the scope error in the following program...Ch. 5 - For each of the variables in the following...Ch. 5 - Prob. 11RECh. 5 - Perform a walkthrough of the intName method with...Ch. 5 - Consider the following method: public static int...Ch. 5 - Consider the following method that is intended to...Ch. 5 - Suppose an ancient civilization had constructed...Ch. 5 - Give pseudocode for a recursive method for...Ch. 5 - Give pseudocode for a recursive method that sorts...Ch. 5 - Write the following methods and provide a program...Ch. 5 - Write the following methods and provide a program...Ch. 5 - Prob. 4PECh. 5 - Prob. 5PECh. 5 - Prob. 6PECh. 5 - Prob. 7PECh. 5 - Prob. 8PECh. 5 - Write methods public static double...Ch. 5 - Write a recursive method public static String...Ch. 5 - Write a recursive method public static boolean...Ch. 5 - Use recursion to implement a method public static...Ch. 5 - Use recursion to determine the number of digits in...Ch. 5 - Write a method that computes the balance of a bank...Ch. 5 - Write a method that tests whether a file name...Ch. 5 - It is a well-known phenomenon that most people are...Ch. 5 - Prob. 3PPCh. 5 - Use recursion to compute an, where n is a positive...Ch. 5 - Leap years. Write a method public static boolean...Ch. 5 - In Exercise P3.13 you were asked to write a...Ch. 5 - Prob. 10PPCh. 5 - Write a program that reads two strings containing...Ch. 5 - Prob. 12PPCh. 5 - Write a program that reads words and arranges them...Ch. 5 - Prob. 14PPCh. 5 - Write a program that reads two fractions, adds...Ch. 5 - Write a program that prints the decimal expansion...Ch. 5 - Write a program that reads a decimal expansion...Ch. 5 - Write two methods public static void...Ch. 5 - Write a program that reads in the width and height...Ch. 5 - Repeat Exercise P5.19 with hexagonal circle...Ch. 5 - Postal bar codes. For faster sorting of letters,...Ch. 5 - Write a program that reads in a bar code (with :...Ch. 5 - Write a program that converts a Roman number such...Ch. 5 - A non-governmental organization needs a program to...Ch. 5 - Having a secure password is a very important...Ch. 5 - Prob. 30PPCh. 5 - Prob. 31PPCh. 5 - Electric wire, like that in the photo, is a...Ch. 5 - The drag force on a car is given by FD=12v2ACD...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Prime Number List This exercise assumes that you have already written the is_prime function in Programming Exer...
Starting Out with Python (4th Edition)
Find the errors in the following code: 8. The following statement should assign 0 to 2 if a is less than 10; ot...
Starting Out with Java: Early Objects (6th Edition)
In Exercises 53 through 56, determine the output produced by the lines of code where Courier New is the font se...
Introduction to Programming Using Visual Basic (10th Edition)
How do you change the alignment of an HBox container?
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Future Value Suppose you have a certain amount of money in a savings account that earns compound monthly intere...
Starting Out with C++ from Control Structures to Objects (9th Edition)
What is a data sublanguage?
Database Concepts (8th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Write a recursive method in java public static long numPaths(int r, int c) which can solve the following scenario: a checker is placed on a checkerboard. What are the fewest moves to get to the upper left corner(0,0)? You can only move sideways or vertically. No diagonal moves. Once you have that calculation, how many different ways are there to get to the upper left corner? this is my code but I am getting stock overflow, I'm not reaching my base case. public static long numPaths(int r, int c) { //base case if (r==0 && c==0 || r==0 || c==0) return 1; else { return numPaths(r, c--) + numPaths(r--, c); } }arrow_forwardWrite a recursive method in java that sums all values between s and n inclusive /* assume s is less than or equal to n to start */ public static int sum(int s, int n) { }arrow_forwardIn Java trace the table for a while loop public class Main { public static void main(String[] args) { // Question 2 j = 30; x=5; for (int i=1;i<=2;i++) { while (j > 20) { j=j-x*i; ++x; }// end of while }// end of for j x i j<=2 j>20arrow_forward
- ANSWER SHOULD BE WRITTEN IN JAVA CODE USING RECURSION Problem Statement Given a string as input return true or false depending on whether it satisfies these rules: 1) The string begins with an 'x' 2) Each 'x' is followed by nothing, 'x' or 'yy' 3) Each 'yy' is followed by nothing or 'x'arrow_forwardThis is the file: // Peevish_Postman.java import java.util.*; /* * CPS 150 * Algorithms & Programming I * * Lab Project: The Peevish Postman Problem (Java Boolean Arrays) * * Name: */ public class Peevish_Postman { public static void main(String[] args) { boolean[] doors; final int NUM_DOORS = 100; final boolean OPEN = true; final boolean CLOSED = false; // Initialize the doors doors = new boolean[NUM_DOORS+1]; // We will not use doors[0] for (int i = 1; i <= NUM_DOORS; i++) { doors[i] = CLOSED; } // Print the initial state of each door (1-100) for (int i = 1; i <= NUM_DOORS; i++) { System.out.print("Door " + i + " is "); if (doors[i]) { System.out.println("open."); } else { System.out.println("closed."); } } // ADD YOUR CODE BETWEEN THIS LINE ... // ... AND THIS LINE // Print the final state of each door (1-100) for (int i = 1; i <= NUM_DOORS; i++) { System.out.print("Door " + i + " is "); if (doors[i]) { System.out.println("open."); } else {…arrow_forwardWrite a Java program that counts the number of divisors of a number n given by the user.arrow_forward
- For recursive formulas, is there a set rule of using a(n) to represent a(n+1)? For example, for the factorial example in the lecture, a(n+1) = (n+1)*a(n). Could it also be a(n) = n*a(n-1)?arrow_forwardUsing methods, write a syntactically and semantically a correct Java program in the text field below that will simulate the Fibonacci Series using Recursion technique. Example Output: Fibonacci Series of 10 numbers: 0 1 1 2 3 5 8 13 21 34arrow_forward• Write a Java program to print sum of series numbers using a recursion The recursive lava logic is as follows. Start with a number and then add that number to one less than itself. Repeat that logic until you hit zero. Once zero is encountered, the total sum of all numbers from the starting number down to zero has been calculated 1 Determine the base case. 2: Determine the recursive case. Example1:Input: 3 Output: 6 Explanation: 1+2+3=6 Example2:Input:5 Output: 15 Explanation: 1+3+4+5 = 15arrow_forward
- Answer the given question with a proper explanation and step-by-step solution. public class mathFormula { // Iterative implementation public static int iterative(int n) { if (n == 0) return 1; if (n == 1) return 2; int f1 = 1, f2 = 2, fn = 0; for (int i = 2; i <= Math.abs(n); i++) { fn = f1 - f2; f1 = f2; f2 = fn; } return (n < 0 && n % 2 == 0) ? -fn : fn; } // Recursive implementation public static int recursive(int n) { if (n == 0) return 1; if (n == 1) return 2; if (n > 1) return recursive(n - 1) - recursive(n - 2); return -recursive(-n); } // Memoization implementation public static int memoization(int n) { int[] memo = new int[Math.abs(n) + 1]; memo[0] = 1; memo[1] = 2; return memoizationHelper(n, memo); } public static int memoizationHelper(int n, int[] memo) { if (memo[Math.abs(n)] != 0) return (n < 0 && n % 2 == 0) ? -memo[Math.abs(n)] : memo[Math.abs(n)]; memo[Math.abs(n)] = memoizationHelper(n - 1, memo) - memoizationHelper(n - 2, memo); return (n…arrow_forwardWrite a java program that uses a recursive algorithm to print all the valid (properly closed and open brackets) combinations of a number of parentheses taken from the user. For example your program should behave similar to the below: Enter a number your input is : 3 output :((())), ( () () ), (()) (), () (()), () () ()arrow_forwardWrite a Java program to find the calculate the average of 3 subjects for 5 students using do… while loop. Ouput Enter the Student Name:xxxx Sub1=99 Sub2=99 Sub=99 Sum=sum of 3 subjects Average= sum/3arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Computational Software for Intelligent System Design; Author: Cadence Design Systems;https://www.youtube.com/watch?v=dLXZ6bM--j0;License: Standard Youtube License