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. 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. Check the condition, Execute for the value in the location “y-1, x+1”. 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. Check the condition, Execute for the value in the location “y+1, x+1”. Check the condition, Execute for the value in the location “y, x-1”, Increment the count. Check the condition, Execute for the value in the location “y, x+1”, Increment the count. 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. 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()”. Print the message. Call the method “displayBoard()”.

Question

Want to see the full answer?

Answer 1

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.

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.

Check the condition,

Execute for the value in the location “y-1, x+1”.

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.

Check the condition,

Execute for the value in the location “y+1, x+1”.

Check the condition,

Execute for the value in the location “y, x-1”,

Increment the count.

Check the condition,

Execute for the value in the location “y, x+1”,

Increment the count.

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.

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()”.

Print the message.

Call the method “displayBoard()”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are “Everyone else” should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions

⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t₁ and to in the first place: t₁ to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right…

Show the correct stereochemistry when needed!! mechanism: mechanism: Show the correct stereochemistry when needed!! Br NaOPh diethyl ether substitution