Java Reference
In-Depth Information
cell (i.e., flip from 1 to 0 or from 0 to 1) and write a program to find which cell was
flipped. Your program should prompt the user to enter a 6-by-6 array with 0s and
1s and find the first row
r
and first column
c
where the even number of the 1s prop-
erty is violated (i.e., the number of 1s is not even). The flipped cell is at (
r
,
c
).
*7.24
(
Check Sudoku solution
) Listing 7.4 checks whether a solution is valid by check-
ing whether every number is valid in the board. Rewrite the program by checking
whether every row, every column, and every small box has the numbers 1 to 9.
*7.25
(
Markov matrix
) An matrix is called a
positive Markov matrix
if each ele-
ment is positive and the sum of the elements in each column is 1. Write the fol-
lowing method to check whether a matrix is a Markov matrix.
n
*
n
public static boolean
isMarkovMatrix(
double
[][] m)
Write a test program that prompts the user to enter a matrix of double values
and tests whether it is a Markov matrix. Here are sample runs:
3
*
3
Enter a 3-by-3 matrix row by row:
0.15 0.875 0.375
0.55 0.005 0.225
0.30 0.12 0.4
It is a Markov matrix
Enter a 3-by-3 matrix row by row:
0.95 -0.875 0.375
0.65 0.005 0.225
0.30 0.22 -0.4
It is not a Markov matrix
*7.26
(
Row sorting
) Implement the following method to sort the rows in a two-
dimensional array. A new array is returned and the original array is intact.
public static double
[][] sortRows(
double
[][] m)
Write a test program that prompts the user to enter a matrix of double val-
ues and displays a new row-sorted matrix. Here is a sample run:
3
*
3
Enter a 3-by-3 matrix row by row:
0.15 0.875 0.375
0.55 0.005 0.225
0.30 0.12 0.4
The row-sorted array is
0.15 0.375 0.875
0.005 0.225 0.55
0.12 0.30 0.4
*7.27
(
Column sorting
) Implement the following method to sort the columns in a two-
dimensional array. A new array is returned and the original array is intact.
public static double
[][] sortColumns(
double
[][] m)
