Big Java, Binder Ready Version: Early Objects
6th Edition
ISBN: 9781119056447
Author: Cay S. Horstmann
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Question
Chapter 7, Problem 10PP
Program Plan Intro
Game of life
Program plan:
- Import necessary package.
- Create a class “PlayLifeg”,
- Define the method “displayBoard”,
- Initialize the row and column.
- Execute loop till number of rows,
- Execute loop till number of columns,
- Execute for the value in the board location,
-
- Print “X”.
- Otherwise, print “O”.
- Print new line.
- Execute loop till number of columns,
- Define the method “advanceBoard()”,
- Initialize the row and column.
- Declare 2D array.
- Execute loop till number of rows,
- Execute loop till number of columns,
- Initialize the count variable to count surrounding cells.
- Check the condition,
-
- Execute for the value in the location “y-1, x”,
- Increment the count.
- Check the condition,
- Execute for the value in the location “y-1, x-1”,
- Increment the count.
- Execute for the value in the location “y-1, x-1”,
- Check the condition,
- Execute for the value in the location “y-1, x+1”.
- Check the condition,
- Increment the count.
- Execute for the value in the location “y-1, x”,
- Check the condition,
-
- Execute for the value in the location “y+1, x”,
- Increment the count.
- Check the condition,
- Execute for the value in the location “y+1, x-1”,
- Increment the count.
- Execute for the value in the location “y+1, x-1”,
- Check the condition,
- Execute for the value in the location “y+1, x+1”.
- Check the condition,
- Increment the count.
- Execute for the value in the location “y+1, x”,
- Check the condition,
-
- Execute for the value in the location “y, x-1”,
- Increment the count.
- Execute for the value in the location “y, x-1”,
- Check the condition,
-
- Execute for the value in the location “y, x+1”,
- Increment the count.
- Execute for the value in the location “y, x+1”,
- Assign the value to the next board location.
- Execute the condition for the value in “y,x”,
-
- Check the condition for cell death from overcrowding,
- Set the Boolean value as false.
- Check the condition for cell death from loneliness,
- Set the Boolean value as false.
- Otherwise,
- Check the condition for cell birth,
- Set the Boolean value to true.
- Check the condition for cell birth,
- Check the condition for cell death from loneliness,
- Set the Boolean value as false.
- Check the condition for cell death from overcrowding,
- Execute loop till number of columns,
- Return the array.
- Define the Boolean method “main()”,
- Create “Scanner” object.
- Prompt the user a board row and column.
- Get the row and column from the user.
- Declare 2D array.
- Prompt the user to enter the input to fill the board.
- Execute loop till number of rows,
- Execute loop till number of columns,
- Check whether the input is “1”,
-
- Set the Boolean value to true.
- Otherwise,
-
- Set the value to false.
- Create object “PlayLifeg”.
- Call the method “displayBoard()”.
- Prompt the user a number of iterations.
- Get the number of iterations from the user.
- Create a loop till number of iterations,
- Assign the value returned from “advanceBoard()”.
- Check the condition,
-
- Print the string.
- Call the method “displayBoard()”.
- Execute loop till number of columns,
- Print the message.
- Call the method “displayBoard()”.
- Define the method “displayBoard”,
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionChapter 7 Solutions
Big Java, Binder Ready Version: Early Objects
Ch. 7.1 -
Declare an array of integers containing the first...Ch. 7.1 -
Assume the array primes has been initialized as...Ch. 7.1 -
Assume the array primes has been initialized as...Ch. 7.1 - Prob. 4SCCh. 7.1 - Prob. 5SCCh. 7.1 -
Declare an array containing two strings, "Yes",...Ch. 7.1 -
Can you produce the output on page 308 without...Ch. 7.1 - Prob. 8SCCh. 7.2 - Prob. 9SCCh. 7.2 - Prob. 10SC
Ch. 7.2 - Prob. 11SCCh. 7.2 - Prob. 12SCCh. 7.3 - Prob. 13SCCh. 7.3 - Prob. 14SCCh. 7.3 - Prob. 15SCCh. 7.3 - Prob. 16SCCh. 7.3 - Prob. 17SCCh. 7.3 - Prob. 18SCCh. 7.3 - Prob. 19SCCh. 7.4 - Prob. 20SCCh. 7.4 - Prob. 21SCCh. 7.4 - Prob. 22SCCh. 7.4 - Prob. 23SCCh. 7.4 - Prob. 24SCCh. 7.5 - Prob. 25SCCh. 7.5 - Prob. 26SCCh. 7.5 - Prob. 27SCCh. 7.5 - Prob. 28SCCh. 7.5 - Prob. 29SCCh. 7.6 - Prob. 30SCCh. 7.6 - Prob. 31SCCh. 7.6 - Prob. 32SCCh. 7.6 - Prob. 33SCCh. 7.6 - Prob. 34SCCh. 7.7 - Declare an array list of integers called primes...Ch. 7.7 - Prob. 36SCCh. 7.7 - Prob. 37SCCh. 7.7 - Prob. 38SCCh. 7.7 - Prob. 39SCCh. 7.7 - Prob. 40SCCh. 7.7 - Prob. 41SCCh. 7.8 - Prob. 42SCCh. 7.8 - Prob. 43SCCh. 7.8 - Prob. 44SCCh. 7 - Prob. 1RECh. 7 - Prob. 2RECh. 7 - Write a program that contains a bounds error. Run...Ch. 7 - Write a loop that reads ten numbers and a second...Ch. 7 - Prob. 5RECh. 7 - Consider the following array:
int[] a = { 1, 2, 3,...Ch. 7 - Consider the following array:
int[] a = { 1, 2, 3,...Ch. 7 - Prob. 8RECh. 7 - Write Java code for a loop that simultaneously...Ch. 7 - What is wrong with each of the following code...Ch. 7 - Write enhanced for loops for the following...Ch. 7 - Rewrite the following loops without using the...Ch. 7 - Rewrite the following loops using the enhanced for...Ch. 7 - What is wrong with each of the following code...Ch. 7 - For the operations on partially filled arrays...Ch. 7 - Trace the flow of the loop in Section 7.3.4 with...Ch. 7 - Prob. 17RECh. 7 - Prob. 18RECh. 7 - Trace the algorithm for removing an element...Ch. 7 - Give pseudocode for an algorithm that rotates the...Ch. 7 - Prob. 21RECh. 7 - Suppose values is a sorted array of integers. Give...Ch. 7 - A run is a sequence of adjacent repeated values....Ch. 7 - What is wrong with the following method that aims...Ch. 7 - You are given two arrays denoting x- and...Ch. 7 - Solve the quiz score problem described in Section...Ch. 7 - Prob. 27RECh. 7 - Develop an algorithm for finding the most...Ch. 7 - Write Java statements for performing the following...Ch. 7 - Prob. 30RECh. 7 - Section 7.7.7 shows that you must be careful about...Ch. 7 - True or false?
All elements of an array are of the...Ch. 7 - How do you perform the following tasks with array...Ch. 7 - Prob. 34RECh. 7 - Prob. 35RECh. 7 - Prob. 36RECh. 7 - Write a program that initializes an array with ten...Ch. 7 - Modify the LargestInArray.java program in Section...Ch. 7 - Write a method sumWithoutSmallest that computes...Ch. 7 - Add a method removeMin to the Student class of...Ch. 7 - Prob. 5PECh. 7 - Write a method that reverses the sequence of...Ch. 7 - Write a program that produces ten random...Ch. 7 - Write a method that implements the algorithm...Ch. 7 - Prob. 9PECh. 7 - Prob. 10PECh. 7 - Consider the following class:
public class...Ch. 7 - Add a method
public boolean sameValues(Sequence...Ch. 7 - Add a method
public boolean sameValues(Sequence...Ch. 7 - Prob. 14PECh. 7 - Prob. 15PECh. 7 - Add a method to the Table class below that...Ch. 7 - Given the Table class of Exercise E7.16, add a...Ch. 7 - Prob. 18PECh. 7 - Prob. 19PECh. 7 - Prob. 20PECh. 7 - Improve the program of Exercise E7.17 by adding...Ch. 7 - Consider the following class:
public class...Ch. 7 - Prob. 23PECh. 7 - Prob. 24PECh. 7 - Prob. 1PPCh. 7 - Prob. 2PPCh. 7 - Prob. 3PPCh. 7 - Prob. 4PPCh. 7 - Prob. 5PPCh. 7 - Prob. 6PPCh. 7 - Prob. 7PPCh. 7 - Prob. 8PPCh. 7 - Prob. 9PPCh. 7 - Prob. 10PPCh. 7 - A pet shop wants to give a discount to its clients...Ch. 7 - Prob. 12PPCh. 7 - Prob. 13PPCh. 7 - Prob. 14PPCh. 7 - Prob. 15PPCh. 7 - Prob. 16PPCh. 7 - Prob. 17PPCh. 7 - Prob. 18PPCh. 7 - Prob. 19PPCh. 7 - Prob. 20PPCh. 7 - Prob. 21PPCh. 7 - Prob. 22PPCh. 7 - Prob. 23PPCh. 7 - Prob. 24PPCh. 7 - Prob. 25PP
Knowledge Booster
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