A class “Grid” Program plan: In a file “Grid.java”, Create a package. Import necessary default packages. Create a class “Grid”, Declare two dimensional array. Define the constructor to assign the grid values. Define a method “add()”, Check whether the row is greater than or equal to “0” and less than the grid length and column is greater than or equal to “0” and is less than the length of the current row, If it is true, add the description to the location of a grid. Define a method “getDescription()”, Check whether the row is greater than or equal to “0” and less than the grid length and column is greater than or equal to “0” and is less than the length of the current row, If it is true, return the description at the location in a grid. Return null value. Define the method “getDescribedLocations()”, Create “ArrayList”. Create loop to iterate over row in a grid, Check whether the grid location contain description, If it is true, add the location to the list. Return the list. Create an inner class “Location”, Declare the necessary variables. Define the constructor to set the initial row and column. Define the method “getRow()” to return the row. Define the method “getColumn()” to return the column. In a file “GridTest.java”, create a package and then a class “GridTest”, Define the method “main()”, Create object for “Grid” class. Add the description into the grid. Print the description for the location (0, 1). Print the expected description. Print the description for the location (1, 2). Print the expected description. Print the description for the location (2, 1). Print the expected description. Create loop to iterate over grid location that contain description, Print the grid location. Print new line. Print the expected grid location.

Question

Want to see the full answer?

Answer 1

Question

Chapter 10, Problem 14PE

Program Plan Intro

A class “Grid”

Program plan:

In a file “Grid.java”,

Create a package.

Import necessary default packages.

Create a class “Grid”,

Declare two dimensional array.

Define the constructor to assign the grid values.

Define a method “add()”,

Check whether the row is greater than or equal to “0” and less than the grid length and column is greater than or equal to “0” and is less than the length of the current row,

If it is true, add the description to the location of a grid.

Define a method “getDescription()”,

Check whether the row is greater than or equal to “0” and less than the grid length and column is greater than or equal to “0” and is less than the length of the current row,

If it is true, return the description at the location in a grid.

Return null value.

Define the method “getDescribedLocations()”,

Create “ArrayList”.

Create loop to iterate over row in a grid,

Check whether the grid location contain description,

If it is true, add the location to the list.

Return the list.

Create an inner class “Location”,

Declare the necessary variables.

Define the constructor to set the initial row and column.

Define the method “getRow()” to return the row.

Define the method “getColumn()” to return the column.

In a file “GridTest.java”, create a package and then a class “GridTest”,

Define the method “main()”,

Create object for “Grid” class.

Add the description into the grid.

Print the description for the location (0, 1).

Print the expected description.

Print the description for the location (1, 2).

Print the expected description.

Print the description for the location (2, 1).

Print the expected description.

Create loop to iterate over grid location that contain description,

Print the grid location.

Print new line.

Print the expected grid location.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

.NET Interactive Solving Sudoku using Grover's Algorithm We will now solve a simple problem using Grover's algorithm, for which we do not necessarily know the solution beforehand. Our problem is a 2x2 binary sudoku, which in our case has two simple rules: •No column may contain the same value twice •No row may contain the same value twice If we assign each square in our sudoku to a variable like so: 1 V V₁ V3 V2 we want our circuit to output a solution to this sudoku. Note that, while this approach of using Grover's algorithm to solve this problem is not practical (you can probably find the solution in your head!), the purpose of this example is to demonstrate the conversion of classical decision problems into oracles for Grover's algorithm. Turning the Problem into a Circuit We want to create an oracle that will help us solve this problem, and we will start by creating a circuit that identifies a correct solution, we simply need to create a classical function on a quantum circuit that…

Answer two JAVA OOP problems.