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
Concept explainers
Question
Chapter 14, Problem 4AW
Program Plan Intro
- Define the class definition.
- Define the main method using public static void main(String[] args).
- Define the int data fields and pass the required arguments.
- Close the main method.
- Define the recursive method.
- Print the required data fields using System.out.println() method.
- Define if condition and compare the arguments.
- Add the arguments with the required value.
- Close the recursive method.
- Close the public class.
- Define the main method using public static void main(String[] args).
- Define the int data fields and pass the required arguments.
- Close the main method.
- Define the recursive method.
- Print the required data fields using System.out.println() method.
- Define if condition and compare the arguments.
- Add the arguments with the required value.
- Close the recursive method.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
PROGRAM SIMULATION. Understand the given JAVA program and write the output.
b. public class ChangeIt { public void doIt( int[] z ) { z[0] = 0; } } public class TestIt { public static void main ( String[] args ) { int[] myArray = {1, 2, 3, 4, 5} ; ChangeIt.doIt(myArray ); for (int j=0; j<myArray.length; j++ ) System.out.print( myArray[j] + " " ) ; } }
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 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
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 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_forwardimport 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_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_forward
- What 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_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_forwardpublic class SumOfDiagonals { public static void main(String[] args) { String[][] s1 = {{"2", "3", "4"}, {"5", "6", "7"}, {"8", "9", "10"}}; String[][] s2 = {{"1", "2", "3"}, {"5", "6", "7"}, {"9", "10", "11"}, {"13", "14", "15"}}; String[][] s3 = {{"1", "2", "3", "4"}, {"5", "6", "7", "8"}, {"9", "10", "11", "12"}, {"13", "14", "15", "16"}}; try { sumOfDiagonals(s1); sumOfDiagonals(s2); sumOfDiagonals(s3); } catch(NumberFormatException ex) { System.out.println("Not a valid integer"); } catch(IllegalArgumentException ex) { System.out.println("Array not a square"); } } public static void sumOfDiagonals(String[][] x) { //TODO Complete this method as required in the…arrow_forward
- 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_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_forwardpublic class LabProgram { public static void main(String args[]) { Course course = new Course(); String first; // first name String last; // last name double gpa; // grade point average first = "Henry"; last = "Cabot"; gpa = 3.5; course.addStudent(new Student(first, last, gpa)); // Add 1st student first = "Brenda"; last = "Stern"; gpa = 2.0; course.addStudent(new Student(first, last, gpa)); // Add 2nd student first = "Jane"; last = "Flynn"; gpa = 3.9; course.addStudent(new Student(first, last, gpa)); // Add 3rd student first = "Lynda"; last = "Robison"; gpa = 3.2; course.addStudent(new Student(first, last, gpa)); // Add 4th student course.printRoster(); } } // Class representing a student public class Student { private String first; // first name private String last; // last name private double gpa; // grade point average…arrow_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_forwardJAva Implement a class Robot that simulates a robot wandering on an infinite plane. The robot is locatedat a point with integer coordinates and faces north, south, east, or west. Supply methods:public void turnLeft()public void turnRight()public void move()public Point getLocation()public String getDirection()The turnLeft and turnRight methods change the direction but not the location. The move method movesthe robot by one unit in the direction it is facing. The getDirection method returns a string “N”, “S”,“E”, “W”. For the new object, the initial location and facing should be specified. For the initial facing, 0means north, 1 means east, 2 means south, and 3 means west.A tester class, RobotTester, has been provided as follows to help you how to implement the Robot class.Therefore, implement the Robot class such that the following RobotTester class can be executed withoutany changes.import java.awt.Point;/**A class to test the Robot class.*/public class RobotTester{/**Tests the…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_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