
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Question
Chapter 6, Problem 9PP
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 solution
Students have asked these similar questions
I want to solve 13.2 using matlab please help
a) Show a possible trace of the OSPF algorithm for computing the routing table in Router 2 forthis network.b) Show the messages used by RIP to compute routing tables.
using r language to answer question 4 Question 4: Obtain a 95% standard normal bootstrap confidence interval, a 95% basic bootstrap confidence interval, and a percentile confidence interval for the ρb12 in Question 3.
Chapter 6 Solutions
Big Java Late Objects
Ch. 6.1 - Prob. 1SCCh. 6.1 - Prob. 2SCCh. 6.1 - Prob. 3SCCh. 6.1 - Prob. 4SCCh. 6.1 - Prob. 5SCCh. 6.1 - Prob. 6SCCh. 6.1 - Prob. 7SCCh. 6.2 - Prob. 8SCCh. 6.2 - Prob. 9SCCh. 6.2 - Prob. 10SC
Ch. 6.2 - Prob. 11SCCh. 6.3 - Prob. 12SCCh. 6.3 - Prob. 13SCCh. 6.3 - Prob. 14SCCh. 6.3 - Prob. 15SCCh. 6.3 - Prob. 16SCCh. 6.3 - Prob. 17SCCh. 6.3 - Prob. 18SCCh. 6.4 - Prob. 19SCCh. 6.4 - Prob. 20SCCh. 6.4 - Prob. 21SCCh. 6.4 - Prob. 22SCCh. 6.4 - Prob. 23SCCh. 6.5 - Prob. 24SCCh. 6.5 - Prob. 25SCCh. 6.5 - Prob. 26SCCh. 6.5 - Prob. 27SCCh. 6.5 - Prob. 28SCCh. 6.6 - Prob. 29SCCh. 6.6 - Prob. 30SCCh. 6.6 - Prob. 31SCCh. 6.6 - Prob. 32SCCh. 6.6 - Prob. 33SCCh. 6.7 - Prob. 34SCCh. 6.7 - Prob. 35SCCh. 6.7 - Prob. 36SCCh. 6.7 - Prob. 37SCCh. 6.7 - Prob. 38SCCh. 6.8 - Prob. 39SCCh. 6.8 - Prob. 40SCCh. 6.8 - Prob. 41SCCh. 6.8 - Prob. 42SCCh. 6.8 - Prob. 43SCCh. 6.8 - Prob. 44SCCh. 6.8 - Prob. 45SCCh. 6 - Prob. 1RECh. 6 - Prob. 2RECh. 6 - Prob. 3RECh. 6 - Prob. 4RECh. 6 - Prob. 5RECh. 6 - Prob. 6RECh. 6 - Prob. 7RECh. 6 - Prob. 8RECh. 6 - Prob. 9RECh. 6 - Prob. 10RECh. 6 - Prob. 11RECh. 6 - Prob. 12RECh. 6 - Prob. 13RECh. 6 - Prob. 14RECh. 6 - Prob. 15RECh. 6 - Prob. 16RECh. 6 - Prob. 17RECh. 6 - Prob. 18RECh. 6 - Prob. 19RECh. 6 - Prob. 20RECh. 6 - Prob. 21RECh. 6 - Prob. 22RECh. 6 - Prob. 23RECh. 6 - Prob. 24RECh. 6 - Prob. 25RECh. 6 - Prob. 26RECh. 6 - Prob. 27RECh. 6 - Prob. 28RECh. 6 - Prob. 29RECh. 6 - Prob. 30RECh. 6 - Prob. 31RECh. 6 - Prob. 32RECh. 6 - Prob. 33RECh. 6 - Prob. 34RECh. 6 - Prob. 1PECh. 6 - Prob. 3PECh. 6 - Prob. 4PECh. 6 - Prob. 5PECh. 6 - Prob. 6PECh. 6 - Prob. 7PECh. 6 - Prob. 8PECh. 6 - Prob. 9PECh. 6 - Prob. 10PECh. 6 - Prob. 11PECh. 6 - Prob. 12PECh. 6 - Prob. 13PECh. 6 - Prob. 15PECh. 6 - Prob. 16PECh. 6 - Prob. 17PECh. 6 - Prob. 18PECh. 6 - Prob. 19PECh. 6 - Prob. 20PECh. 6 - Prob. 21PECh. 6 - Prob. 23PECh. 6 - Prob. 24PECh. 6 - Prob. 25PECh. 6 - Prob. 26PECh. 6 - Prob. 27PECh. 6 - Prob. 28PECh. 6 - Prob. 29PECh. 6 - Prob. 1PPCh. 6 - Prob. 2PPCh. 6 - Prob. 3PPCh. 6 - Prob. 4PPCh. 6 - Prob. 5PPCh. 6 - Prob. 6PPCh. 6 - Prob. 7PPCh. 6 - Prob. 8PPCh. 6 - Prob. 9PPCh. 6 - Prob. 10PPCh. 6 - Prob. 11PPCh. 6 - Prob. 12PPCh. 6 - Prob. 13PPCh. 6 - Prob. 14PPCh. 6 - Prob. 15PPCh. 6 - Prob. 16PPCh. 6 - Prob. 17PPCh. 6 - Prob. 18PPCh. 6 - Prob. 19PP
Knowledge Booster
Similar questions
- using r language Obtain a bootstrap t confidence interval estimate for the correlation statistic in Example 8.2 (law data in bootstrap).arrow_forwardusing r language Compute a jackknife estimate of the bias and the standard error of the correlation statistic in Example 8.2.arrow_forwardusing r languagearrow_forward
- using r languagearrow_forwardThe assignment here is to write an app using a database named CIT321 with a collection named students; we will provide a CSV file of the data. You need to use Vue.js to display 2 pages. You should know that this assignment is similar, all too similar in fact, to the cars4sale2 example in the lecture notes for Vue.js 2. You should study that program first. If you figure out cars4sale2, then program 6 will be extremely straightforward. It is not my intent do drop a ton of new material here in the last few days of class. The database contains 51 documents. The first rows of the CSV file look like this: sid last_name 1 Astaire first_name Humphrey CIT major hrs_attempted gpa_points 10 34 2 Bacall Katharine EET 40 128 3 Bergman Bette EET 42 97 4 Bogart Cary CIT 11 33 5 Brando James WEB 59 183 6 Cagney Marlon CIT 13 40 GPA is calculated as gpa_points divided by hrs_attempted. GPA points would have been arrived at by adding 4 points for each credit hour of A, 3 points for each credit hour of…arrow_forwardI need help to solve the following case, thank youarrow_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