Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
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.
- Using “for” loops and “if” condition, check the value of “m[][]” is less than “0”.
- Define the main method.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Assignment (Math application):
Write a program that prompts the user to enter a 3 x 3 matrix of double values and tests
whether it is a positive Markov matrix.
E An nxn matrix is a positive Markov matrix if the following is true:
o lf each of the elements is positive
o The sum of the elements in each column is 1
Sample Program running
Enter a 3 x 3 matrix by row
0.15 0.875 0.375
0.55 0.005 0.225
0.30 0.12 0.4
The sum of the columns
1.0 1.0 1.0
It is a Markov matrix
Enter a 3x 3 matrix by row
-0.2 0.875 0.375
0.75 0.005 0.225
0.45 0.12 0.4
The sum of the columns
1.0 1.0 1.0
It is not a Markov matrix
Please note the following requirements:
Dinclude a comment before each method explaining what the methods will do
E 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 doubles
2. Prompts the user for values as shown in the sample run
3. Stores the…
An n x n matrix is called a positive Markov matrix if eachelement is positive and the sum of the elements in each column is 1. Write thefollowing method to check whether a matrix is a Markov matrix:public static boolean isMarkovMatrix(double[][] m)
Write a test program that prompts the user to enter a 3 x 3 matrix of doublevalues and tests whether it is a Markov matrix. Here are sample runs:
Enter a 3−by−3 matrix row by row:0.15 0.875 0.375 ↵Enter0.55 0.005 0.225 ↵Enter0.30 0.12 0.4 ↵EnterIt is a Markov matrix
Enter a 3−by−3 matrix row by row:0.95 −0.875 0.375 ↵Enter0.65 0.005 0.225 ↵Enter0.30 0.22 −0.4 ↵EnterIt is not a Markov matrix
4x1+4x2+6x3+9x4=03x1+3x5=26x2+5x4+7x5=-46x1+8x4+2x5=54x5+7x2+6x3+8x1=-10Represent the set of equations in a matrix equation, Ax=b, where A is a square matrix and x and b are column vectors. Write the line of code to define matrix A for this problem matlab/octave language
Chapter 8 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 8.2 - Declare an array reference variable for a...Ch. 8.2 - Prob. 8.2.2CPCh. 8.2 - What is the output of the following code? int[] []...Ch. 8.2 - Which of the following statements are valid? int...Ch. 8.3 - Show the output of the following code: int[][]...Ch. 8.3 - Show the output of the following code: int[][]...Ch. 8.4 - Show the output of the following code: public...Ch. 8.5 - Prob. 8.5.1CPCh. 8.6 - What happens if the input has only one point?Ch. 8.7 - What happens if the code in line 51 in Listing 8.4...
Ch. 8.8 - Declare an array variable for a three-dimensional...Ch. 8.8 - Assume char[][][] x =new char[12][5][2], how many...Ch. 8.8 - Show the output of the following code: int[][][]...Ch. 8 - (Sum elements column by column) Write a method...Ch. 8 - (Sum the major diagonal in a matrix) Write a...Ch. 8 - (Sort students on grades) Rewrite Listing 8.2,...Ch. 8 - (Compute the weekly hours for each employee)...Ch. 8 - (Algebra: add two matrices) Write a method to add...Ch. 8 - (Algebra: multiply two matrices) Write a method to...Ch. 8 - (Points nearest to each other) Listing 8.3 gives a...Ch. 8 - (All closest pairs of points) Revise Listing 8.3,...Ch. 8 - Prob. 8.9PECh. 8 - (Largest row and column) Write a program that...Ch. 8 - (Game: nine heads and tails) Nine coins are placed...Ch. 8 - (Financial application: compute tax) Rewrite...Ch. 8 - (Locate the largest element) Write the following...Ch. 8 - (Explore matrix) Write a program that prompts the...Ch. 8 - (Geometry: same line ?) Programming Exercise 6.39...Ch. 8 - (Sort two-dimensional array) Write a method to...Ch. 8 - (Financial tsunami) Banks lend money to each...Ch. 8 - (Shuffle rows) Write a method that shuffles the...Ch. 8 - (Pattern recognition: four consecutive equal...Ch. 8 - Prob. 8.20PECh. 8 - (Central city) Given a set of cities, the central...Ch. 8 - (Even number of 1s) Write a program that generates...Ch. 8 - (Game: find the flipped cell) Suppose you are...Ch. 8 - (Check Sudoku solution) Listing 8.4 checks whether...Ch. 8 - Prob. 8.25PECh. 8 - (Row sorting) Implement the following method to...Ch. 8 - (Column sorting) Implement the following method to...Ch. 8 - (Strictly identical arrays) The two-dimensional...Ch. 8 - (Identical arrays) The two-dimensional arrays m1...Ch. 8 - (Algebra: solve linear equations) Write a method...Ch. 8 - (Geometry: intersecting point) Write a method that...Ch. 8 - (Geometry: area of a triangle) Write a method that...Ch. 8 - (Geometry: polygon subareas) A convex four-vertex...Ch. 8 - (Geometry: rightmost lowest point) In...Ch. 8 - (Largest block) Given a square matrix with the...Ch. 8 - (Latin square) A Latin square is an n-by-n array...Ch. 8 - (Guess the capitals) Write a program that...
Knowledge Booster
Similar questions
- CodeW For fun X C Solved https://codeworkou... 臺亂 CodeWorkout X272: Recursion Programming Exercise: Is Reverse For function isReverse, write the two missing base case conditions. Given two strings, this function returns true if the two strings are identical, but are in reverse order. Otherwise it returns false. For example, if the inputs are "tac" and "cat", then the function should return true. Examples: isReverse("tac", "cat") -> true Your Answer: 1 public boolean isReverse(String s1, String s2) { 2. if > 3. 4. else if > return true; return false; 5. 6. else { String s1first = String s2last return s1first.equals (s2last) && 51. substring(0, 1); s2, substring(s2.length() 1); 7. 8. 6. isReverse(s1.substring(1), s2.substring(0, s2.length() 1)); { 12} 1:11AM 50°F Clear 12/4/2021arrow_forwardNeed help in python. Problem: 2D random walk. A two dimensional random walk simulates the behavior of a particle moving in a grid of points. At each step, the random walker moves north, south, east, or west with probability 1/4, independently of previous moves. Compose a program that takes a command-line argument n and estimates how long it will take a random walker to hit the boundary of a 2n+1-by-2n+1 square centered at the starting point. //Given codeImport stdioImport randomImport sysn = int(sys.argv[1])//write code herestdio.write('The walker took ')stdio.write(c)stdio.writeln(' steps')arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. Ridbit begins with an integer n. In one action, he can perform one of the accompanying tasks: partition n by one of its appropriate divisors, or take away 1 from n in case n is more prominent than 1. An appropriate divisor is a divisor of a number, barring itself. For instance, 1, 2, 4, 5, and 10 are appropriate divisors of 20, however 20 itself isn't. What is the base number of moves Ridbit is needed to make to decrease n to 1? Input The principal line contains a solitary integer t (1≤t≤1000) — the number of experiments. The main line of each experiment contains a solitary integer n (1≤n≤109). Output For each experiment, output the base number of moves needed to lessen n to 1.arrow_forward
- Let A = {a, b, c} and B = {u, v}. Write a. A × B b. B × Aarrow_forwardQ6/ A: Write a program that reads three issues and arranges them in a differential order? B: Write Chain-Generating Program: 0,1,1,2,3,5,8,13,21,34,55,89,144,233,.. The user determines the chain length? Q7: A: Proof that the next matrix is vertical: 1 2 2 -1 4 10 -1 B: Write a program that provides the user with the possibility to draw one of the following functions as chosen: Sin, cos, log, exp, tan, 1/x, 1/log(x), 1/x Q8: A: what is data? What is a data network? What is a converged. B: Describe network- supported technologies that impact how people learn „work,and play. Q9: A: Compare and contrast the layers of the OSI model with the TCP/IP protocol stack.arrow_forwardComplete the following methodsarrow_forward
- // 9. Is It Prime? function isPrime(n) { if (n < 2 || n % 1 != 0) { return false; } for (let i if (n % i } return true; 2; i < n; ++i) { 0) return false; == }arrow_forward- Write a program (C language .C or Python .py) to implement JohnsonTrotter algorithm and count the number of times of comparison or swap (operations) made (example, you can use n= 4) Algorithm Johnson Trotter 1: Input: A positive integer n 2: Output: All permutations of {1,2,3,...,n} 3: 4: Initialize the first permutation with 1,2,..., 5: while The last permutation has a mobile element do Find its largest mobile element k 6: 7: 8: Swap k with element that the arrow of k points to Reverse the direction of all elements larger than k Add the new permutation to the list 9: Show Transcribed Text - Why this JohnsonTrotter algorithm more efficiency than program do normal generating permutations?arrow_forwardBelow are a number of statements about linear and binary search. A. Linear search systematically searches from beginning to end. B. Linear search as well as binary search works on both sorted and unsorted data sets. C. For linear search, T (n) = O (n) applies in the worst case. D. For linear search, T (n) = 0 (n) applies in the worst case, if the quantity is unsorted. E. For binary search, T (n) = O (log n) applies in the worst case. Indicate which of these is correct. a,b,d,e true a,b,c,d true a,c,d,e true a,e truearrow_forward
- NOTE: WRITE IN C# Write a distributed probability random number generator using one of the probability sampling methods (like rejection sampling). Explain the codes and the sampling implementation in detail. Example: İnputs : (3, 0.4) (5, 0.5) Output: Generated random number is 3, it has %40 probability Generated random number is 5, it has %50 probability NOTE: WRITE IN C# NOTE: MAKE A GENERIC SOLUTION THAT APPLIES FOR ANY GIVEN NUMBER AND PROBABILITY. NOT JUST BASED ON THIS EXAMPLE !!!arrow_forwardTask 4: The first problem that you solve recursively is to implement enoughGate() to check if the dogMaze has at least two gates (one for the entrance and one for the exit). This problem must be solved recursively, however there is no limitation on what type of recursion (i.e., direct or indirect recursion) you use . As a reminder, a direct recursion refers to the function that calls itself to solve the given problem. However, by indirect recursion, more than one function involves in solving the problem. It is possible that a non-recursive function solves a small part of the problem and then calls the recursive function to finish the job. /** * This method returns true if the number of * gates in dogMaze >= 2. * @return it returns true, if enough gate exists (at least 2), otherwise false. */ publicboolean enoughGate (){ // insert your code here. Change the return value to fit your purpose. return true; }arrow_forward(b) The Fibonacci numbers for n 0, 1,...are defined as follows. fib (0)-0 fib (1) 1: fib (n) fib (n- 1) + fib (n - 2): Consider the following piece of code that calculates the Fibonacci numbers. int fib ( int n){ if (n is 0) return 0 else if (n is 1) return 1 else return fib (n- 1)+ fib (n- 2) What is the worst-case complexity of the above code?arrow_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