Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
7th Edition
ISBN: 9780134802213
Author: Tony Gaddis
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 15, Problem 3AW
What will the following
public class Checkpoint
{
public static void main(String[] args)
{
int num = 0;
showMe(num);
}
public static void showMe(int arg)
{
if (arg < 10)
showMe(arg + 1);
else
System.out.println(arg);
}
}
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Trace and document every step of execution of the following program:
public class Trace {
public static void main(String[] args) { int[] num = {1, 3, 6, 9, 12 };
for (int i = 4; i >= 0; i--) { num[i] +=1; } num[0] *=num[4]; } }
In 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>20
Q27 for java programing:
public static void main(String[] args) {
Dog[] dogs = { new Dog(), new Dog()};
for(int i = 0 ; i < dogs.length; i++)
dogs[i].wo();
Cat[] cats = { new Cat(),new Cat(),new Cat()};
for(int i = 0 ; i < cats.length; i++)
cats[i].me();
System.out.print(Dog.getCount()+" woofs and");
System.out.println(Cat.getCount()+" mews");
System.out.println("=====>>>"+decision()); }
class Counter
{ private static int count;
public static void inc() { count++;}
public static int getCount() {return count;}
}
class Dog extends Counter{
public Dog(){}
public void wo(){inc();}
}
class Cat extends Counter{
public Cat(){}
public void me( ){inc();}
}
The Correct answer:
public static void main(String[] args) {
Dog[] dogs = { new Dog(), new Dog()};
for(int i = 0 ; i < dogs.length; i++)
dogs[i].wo();
Cat[] cats = { new…
Chapter 15 Solutions
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
Ch. 15.2 - It is said that a recursive algorithm has more...Ch. 15.2 - Prob. 15.2CPCh. 15.2 - What is a recursive case?Ch. 15.2 - What causes a recursive algorithm to stop calling...Ch. 15.2 - What is direct recursion? What is indirect...Ch. 15 - Prob. 1MCCh. 15 - This is the part of a problem that can be solved...Ch. 15 - This is the part of a problem that is solved with...Ch. 15 - This is when a method explicitly calls itself. a....Ch. 15 - Prob. 5MC
Ch. 15 - Prob. 6MCCh. 15 - True or False: An iterative algorithm will usually...Ch. 15 - True or False: Some problems can be solved through...Ch. 15 - True or False: It is not necessary to have a base...Ch. 15 - True or False: In the base case, a recursive...Ch. 15 - Find the error in the following program: public...Ch. 15 - Prob. 1AWCh. 15 - Prob. 2AWCh. 15 - What will the following program display? public...Ch. 15 - Prob. 4AWCh. 15 - What will the following program display? public...Ch. 15 - Convert the following iterative method to one that...Ch. 15 - Write an iterative version (using a loop instead...Ch. 15 - What is the difference between an iterative...Ch. 15 - What is a recursive algorithms base case? What is...Ch. 15 - What is the base case of each of the recursive...Ch. 15 - What type of recursive method do you think would...Ch. 15 - Which repetition approach is less efficient: a...Ch. 15 - When recursion is used to solve a problem, why...Ch. 15 - How is a problem usually reduced with a recursive...Ch. 15 - Prob. 1PCCh. 15 - isMember Method Write a recursive boolean method...Ch. 15 - String Reverser Write a recursive method that...Ch. 15 - maxElement Method Write a method named maxElement,...Ch. 15 - Palindrome Detector A palindrome is any word,...Ch. 15 - Character Counter Write a method that uses...Ch. 15 - Recursive Power Method Write a method that uses...Ch. 15 - Sum of Numbers Write a method that accepts an...Ch. 15 - Ackermarms Function Ackermanns function is a...Ch. 15 - Recursive Population Class In Programming...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
What would be the output in Self-Test Exercise 6 if the assignment were changed to the following? int extra = 0...
Problem Solving with C++ (9th Edition)
I before e except after c A friend of yours who is an educator is conducting research into the effectiveness of...
Starting Out with C++: Early Objects
The following code is supposed to output the string in lowercase letters but it has an error. What is wrong? St...
Absolute Java (6th Edition)
What is the difference between the names defined in an ML let construct from the variables declared in a C bloc...
Concepts Of Programming Languages
A sentence is in disjunctive normal form (DNF) if it is the disjunction of conjunctions of literals. For exampl...
Artificial Intelligence: A Modern Approach
Given that y=ax3+7, which of the following are correct Java statements for this equations? int y = a x x (x +...
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
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
- Please help debug this: Debugging Exercise 4-3, Farrell, Joyce, Java Programming, 9th edition, Cengage Learning public class DebugBox { private int width; private int length; private int height; private FixDebugBox() { length = 1; width = 1; height = 1; } public DebugBox(int width, int length, int height) { width = width; length = length; height = height; } public void showData() { System.out.println("Width: " + width + " Length: " + length + " Height: " + height); } public double getVolume() { double vol = length - width - height; return vol; } }arrow_forwardplease write it in C language. import java.util.*; public class EightQDfs { final int X = 4; void dispSol(int brd[][]) { for(int i = 0; i < X ; i++) { for(int j=0 ; j < X ; j++) { System.out.print(" " + brd[i][j]) + " "); System.out.println(); } } boolean isSafe(int brd[][] , int r , int c) //r is for row and c is column { int i , j; for(i = 0 ; i < c ; i++) if(brd[r][i] == 1) return false; for(i = r ; j = c ; i >=0 && j >= 0 ;i-- ,j--) if(brd[i][j] == 1) return false; for(i = r , j = c ; j >= 0 && i < X ; i++ , j--) if(brd[i][j] == 1) return false; return true; } boolean EQsolved(int brd[][] , int c) { if(c >= X) return true; for(int i= 0; i < X ;i++) { if(isSafe(brd , i , c)) { brd[i][c] = 1; if(EQsolved(brd , c + 1) == true ) return true; brd[i][c] = 0 ; } } return false; } boolean…arrow_forwardWhat will the following program display?public class Checkpoint{public static void main(String[] args){int num1 = 99;double num2 = 1.5;System.out.println(num1 + " " + num2);myMethod(num1, num2);System.out.println(num1 + " " + num2);}public static void myMethod(int i, double d){System.out.println(i + " " + d);i = 0;d = 0.0;System.out.println(i + " " + d);}}arrow_forward
- import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int n = scnr.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = scnr.nextInt(); } for (int i = n - 1; i >= 0; i--) { System.out.print(arr[i]); if (i > 0) { System.out.print(","); } } }}arrow_forwardWhat will happen when you compile and run the following code? #1. public class Test{ public static void main(String[] args){ int a = 10, b = 0; while( a + 2 < 10 || b - 2 > 0){ System.out.println(a); } } } #2. public class Test{ public static void main(String[] args){ int a = 0, b = 10; while(b - 40 > 0){ b -= 2; while(a + 12 < 10){ a += 2; if(a == b) continue; System.out.print(a + " " + b + ", "); } } } } show the output and solution, its java languagearrow_forwardIn Java trace the table for the do while loop public class Main { public static void main(String[] args) { int x,j,y; /// Question 1 j = 30; x=5; do { j=j-x-2; --x; }while (j > 20); j x j>20arrow_forward
- Rewrite the private static int recurseMax method without using Java API public class Recursion{ public static void main(String[] args){ // My tests (DO NOT MODIFY!) int[] a = {3,2,6,4,15,7,9,8,6}; p(recurseSum(a)); // Sum should be 60 p(recurseMax(a)); // Max should be 15 // End of tests! } // Recursive methods below here... public static int recurseSum(int[] a){ // TODO: This is the wrapper method. You must complete this AND implement helper method int total = recurseSum(a, a.length); return total; } private static int recurseSum(int[] a, int i){ if (i <= 0) return 0; return (recurseSum(a, i - 1) + a[i - 1]); } public static int recurseMax(int[] a){ int max = recurseMax(a, a.length); return max; } private static int recurseMax(int[] a, int i){ if(i == 1) return a[0]; return Math.max(a[i-1], recurseMax(a, i-1)); } //…arrow_forwardwhat is the problem with the following code. Give reason for your answer. public class MyClass\{ public static void main(String[] args) \{ int n[]={1,3,5,6} ; int b[]; b=n; \} \}arrow_forwardFill with appropriate java keywords/syntaxes in the following method overloading program. package analyze; class { method (double X, double Y, double Z){ return X * Y * Z; } double method (double M, double ) { return M / N; } public class Analyze { public static void main(String[] args) { Find fi = Find(); System.out.println( Method 1 : "+fi.method(2, 4, 6)); System.out.println("Method 2 : "+fi.method(3, 6)); } }arrow_forward
- JAVA Determine the output for the following code public class Beta extends Baap { public int h = 44; public int getH( ) { System.out.println("Beta " + h); return h; } public static void main(String[ ] args) { Baap b = new Beta(); System.out.println(b.h + " " + b.getH( )); Beta bb = (Beta) b; System.out.println(bb.h + " " + bb.getH( )); } } public class Baap { public int h = 4; public int getH( ) { System.out.println("Baap " + h); return h; } }arrow_forwardConsider the following code in Java 8:public interface Runnable{void run() ;}public final class Caller {public static void call (String before, String after, Runnable r) (System.out.println(before);r. run() ;System.out.println(after);} }public class MyClass{public static void main(String args[]) (Caller.call("BEFORE", "AFTER",); } }Complete the blark line with some code so that the program prints the folowing to the output: BEFOREHi there!AFTERarrow_forwardWhat will the following program display?public class Checkpoint{public static void main(String[] args){int a = 10;decrementNum(a);}public static void decrementNum (int n){if (n > 0)DecrementNum (n - 2);elseSystem.out.println(n); }}arrow_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 Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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
Java random numbers; Author: Bro code;https://www.youtube.com/watch?v=VMZLPl16P5c;License: Standard YouTube License, CC-BY