Markov matrix Program Plan: Include the package “java.util.Scanner” into program. Define the class named “Exercise08_25”. Define the main method. Define the scanner object “obj” to get input from user. Declare and initialize a final variable “N” in type of integer. Prompt the user and declare the two dimensional variable “arr” in type of “double”. Using “for” loops, get input values for array “arr[][]”. Call the method “isMarkovMatrix()” which pass the “arr” as argument in “if” condition. Print appropriate statement on screen. Define the “isMarkovMatrix()” Boolean method which pass two dimensional array “m[][]” as argument. Using “for” loops and “if” condition, check the value of “m[][]” is less than “0”. If the condition is true, return “false”. Using “for” loop, add column values of matrix and return “true” if the value of “tot” equal to “1”. Otherwise return “false” to calling function.

Question

Want to see the full answer?

Answer 1

Question

Chapter 8, Problem 8.25PE

Program Plan Intro

Markov matrix

Program Plan:

Include the package “java.util.Scanner” into program.

Define the class named “Exercise08_25”.

Define the main method.

Define the scanner object “obj” to get input from user.

Declare and initialize a final variable “N” in type of integer.

Prompt the user and declare the two dimensional variable “arr” in type of “double”.

Using “for” loops, get input values for array “arr[][]”.

Call the method “isMarkovMatrix()” which pass the “arr” as argument in “if” condition.

Print appropriate statement on screen.

Define the “isMarkovMatrix()” Boolean method which pass two dimensional array “m[][]” as argument.

Using “for” loops and “if” condition, check the value of “m[][]” is less than “0”.

If the condition is true, return “false”.

Using “for” loop, add column values of matrix and return “true” if the value of “tot” equal to “1”. Otherwise return “false” to calling function.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

(Data Structures and Algo C++ Weiss 4th ed - ch7.40): The following divide-and-conquer algorithm is proposed for finding the simultaneous maximum and minimum: If there is one item, it is the maximum and minimum, and if there are two items, then compare them, and in one comparison you can find the maximum and minimum. Otherwise, split the input into two halves, divided as evenly as possibly (if N is odd, one of the two halves will have one more element than the other). Recursively find the maximum and minimum of each half, and then in two additional comparisons produce the maximum and minimum for the entire problem. In C++, find a function which will take in a vector and solve the problem, producing a vector of two elements, the min and max.

Assignment (Math application):Write a program that prompts the user to enter a 3 x 3 matrix of double values and testswhether it is a positive Markov matrix. An n x n matrix is a positive Markov matrix if the following is true:o If each of the elements is positiveo The sum of the elements in each column is 1 Sample Program running Enter a 3 x 3 matrix by row0.15 0.875 0.3750.55 0.005 0.2250.30 0.12 0.4The sum of the columns1.0 1.0 1.0It is a Markov matrix Enter a 3 x 3 matrix by row-0.2 0.875 0.3750.75 0.005 0.2250.45 0.12 0.4The sum of the columns1.0 1.0 1.0It is not a Markov matrix Please note the following requirements: Include a comment before each method explaining what the methods will do  All methods called from the main methods There will be two methods which will be called from the main method:public static double [] [] createArray() 1. Creates a 3 by 3 two dimensional array of doubles2. Prompts the user for values as shown in the sample run3. Stores the numbers in the…

(Sum elements row by row) Write a method that returns the sum of all the elements in a specified row in a matrix using the following header: public static double sumRow(double[][] m, int rowIndex) Write a test program that reads a 3-by-4 matrix and displays the sum of each row. Here is a sample run: