Assignment 10 Matrix JAVA

Download:	http://solutionzip.com/downloads/assignment-10-matrix-java/

CSCI 2311, Spring 2013 Programming Assignment 10
The program is due Tuesday, April 30 by midnight.
Overview of Assignment
Begin this assignment by first creating a new Java Project called Assignment 10. This assignment has two parts. The first part is used to understand multidimensional arrays, and the second part is used to understand recursion and error checking which we will go over Thursday, April 18.
Don’t forget you still need javadocs for all your methods and classes.
Part 1
I provide the class with the main method for you called MatrixMain. This is the class I will use to test your Matrix class and you should NOT change it, except for testing purposes.
Remember from one of your previous assignments that a matrix is a grid, with each location in the grid containing some information. For our purposes, we will assume these values are integers. For example, we can have the following matrix:
8 9 4
5 1 0
This is a 2 x 3 matrix, meaning it has 2 rows and 3 columns. Two-dimensional arrays are a great way to represent a matrix. If we wanted to create a two dimensional array for the matrix shown above, we could do the following:
int[][] someArray = { {8, 9, 4},
{5, 1, 0} };
If we wanted to access the value at a given position, we can use its row and column to return the value. For example, someArray[1][1] represents the value 1 since it is in row 1, column 1 and someArray[0][2] represents the value 4 since it is in row 0 and column 2.
In the special case of using a two-dimensional array to represent a matrix, the number of rows in the two-dimensional array shown above would be someArray.length, and the number of columns would be someArray[0].length, since all rows have the same number of columns in a matrix.
I provide the template for the Matrix class. Use it!
Matrix
- matrix: int[ ][ ]
+ Matrix( int[ ][ ] m )
+ rows(): int
+ columns(): int
+ getValue( int row, int column ): int
+ setValue( int value, int row, int column ): void
+ transpose(): Matrix
+ display(): void
+ equals( Matrix m ): boolean
- areSameSize( Matrix m ): boolean
+ randomMatrix( int rows, int columns ): static Matrix
- matrix: int[ ][ ]
A two-dimensional integer array used to store the values of the matrix.
+ Matrix( int[ ][ ] m )
Matrix constructor. First, use the matrix instance variable to create a new array with the same row and columns as the parameter array m. Next, create a loop to copy all of the values in the m array, into the matrix array. You SHOULD NOT simply set matrix = m.
+ rows(): int
Returns the number of rows for the matrix. Remember that rows represent how many arrays are in the two-dimensional array.
+ columns(): int
Returns the number of columns for the matrix. Remember that columns represent how many array elements are in a particular array of the two-dimensional array (which in this case, all columns will be the same size; i.e., not ragged)
+ getValue( int row, int column ): int
Returns the integer value at the specified row and column in the matrix array.
+ setValue( int value, int row, int column ): void
Sets the integer value at the specified row and column in the matrix array equal to the parameter value.
+ transpose(): Matrix
Returns a new instance of Matrix with its matrix value transposed. The new instance of Matrix MUST have its own two-dimensional array, meaning you will need to create a new two-dimensional array and copy the values in matrix into the correct locations in this new array.
To transpose a matrix, we switch the rows to the columns and the columns to the rows. Consider the following 3 x 2 matrix:
1 3
2 4
0 6
If we transpose it, we are left with the following 2 x 3 matrix:
1 2 0
3 4 6
+ display(): void
Displays to the console the rows and columns of the matrix.
+ equals( Matrix m ): boolean
Returns true if the parameter Matrix m has the exact same elements as the invoking Matrix; otherwise, it returns false. This method should start by invoking the helper method areSameSize() size, since two matrices of different sizes cannot be equal.
- areSameSize( Matrix m ): boolean
Returns true if the parameter Matrix m and the invoking Matrix have the same number of rows and columns; otherwise, returns false.
+ randomMatrix( int rows, int columns ): static Matrix
Returns a new instance of Matrix with a brand new two-dimensional array, with the rows and columns specified from the parameters. Each value in the array is a randomly generated integer from 0 to 9. Remember you can use the nextInt() method of the Random class to do this; i.e., nextInt(10) returns a value from 0 to 9 inclusively.
Tips
In the main method, you will notice I first get the user input as a String, and then try to convert the String to an integer. You must, do this same thing when you introduce error checking or you may get unexpected results. Make sure you only get user input using the nextLine() method as I am currently doing.
Example Output (User input in bold)
Constant matrix (2 x 3):
1 2 3
4 5 6
How many rows should the random matrix have: 3
How many columns should the random matrix have: 5
Random matrix (3 x 5):
9 0 2 7 2
5 6 3 6 9
1 6 0 2 6
Getting each value:
[0, 0] = 9 [0, 1] = 0 [0, 2] = 2 [0, 3] = 7 [0, 4] = 2
[1, 0] = 5 [1, 1] = 6 [1, 2] = 3 [1, 3] = 6 [1, 4] = 9
[2, 0] = 1 [2, 1] = 6 [2, 2] = 0 [2, 3] = 2 [2, 4] = 6
Transpose of matrix (5 x 3):
9 5 1
0 6 6
2 3 0
7 6 2
2 9 6
Incremented transpose values:
[0, 0] = 10 [0, 1] = 6 [0, 2] = 2
[1, 0] = 1 [1, 1] = 7 [1, 2] = 7
[2, 0] = 3 [2, 1] = 4 [2, 2] = 1
[3, 0] = 8 [3, 1] = 7 [3, 2] = 3
[4, 0] = 3 [4, 1] = 10 [4, 2] = 7
Equality of matrices:
- Constant equals Constant: true
- Constant equals Random: false
- Random equals Transpose: false
- Random equals Random: true
Part 2
I provide the template for the Recursion class. Use it!
Recursion
+ main( String[] args ): static void
+ rangeSummationI( int start, int end ): static int
+ rangeSummationR( int start, int end): static int
+ hanoiMoves( int n, int start, int end, int extra ): static void
+ main( String[] args ): static void
Main method. This method should be left unchanged except the code between the comments // error check start and // error check end. When the user inputs a number of disks, you need to make sure you catch any errors (such as if the user typed in a non-integer character) and also validate that they entered an integer greater than 0. You should continue to loop asking for input until a valid response is given. No input given for the number of disks should crash or terminate your program. You do NOT need to error check the starting range or ending range.
+ rangeSummationI( int start, int end ): static int
Iteratively finds the summation of the values in the range from start to end. If the value of start is greater than or equal to end, this method simply returns the value of start.
+ rangeSummationR( int start, int end): static int
Recursively finds the summation of the values in the range from start to end. If the value of start is greater than or equal to end, this method simply returns the value of start. To recursively solve this problem, add the value of start to the value returned from invoking this method with the range start + 1 to end.
+ hanoiMoves( int n, int start, int end, int extra ): static void
Displays the solution to the Towers of Hanoi puzzle.
The puzzle has three posts and some number n of disks. Each disk has a hole in the middle, so that it can be put on a post, and the disks are of different sizes.
Initially, the disks are all stacked on the leftmost post, with larger disks closer to the bottom and smaller disks closer to the top. For example, if there are three disks, the puzzle starts out looking like this.
The object is to move all of the disks from the leftmost post to the rightmost post. So when the puzzle is solved, it looks like this.
But there are some rules that must be followed.
1. Only one disk can be moved at a time. The other disks must be on posts.
2. A disk can only be put down by placing it on one of the posts. For example, you can’t put a disk on the table beside the puzzle.
3. No disk can ever be put on top of a smaller disk. You can only put a disk on top of one that is larger than it.
It is convenient to refer to the posts by names, such as L, M and R, for left, middle and right. It is also convenient to number the disk from smallest to largest; from 1 to n.
To complete this method, follow these steps exactly:
If n <= 0, there is no need to do anything. If n > 0, then break the problem down into the following steps:
1. Recursively call the method to move n-1 disks from start to extra, using end for storage. That stores the top n-1 disks out of the way, on the extra post, exposing the n-th disk on the start post.
2. Write one console output line saying
Move disk from to .
3. Finally, recursively call the method again to move n-1 disks from extra to end, using start as storage. That moves those disks from storage to the end, where they are now on top of the n-th disk.
Example Output 1 (User input in bold)
What is our starting range: 1
What is our ending range: 5
Iterative range summation: 15
Recursive range summation: 15
How many disks should we use for Hanoi problem: 3
Solution:
Move disk 1 from L to R.
Move disk 2 from L to M.
Move disk 1 from R to M.
Move disk 3 from L to R.
Move disk 1 from M to L.
Move disk 2 from M to R.
Move disk 1 from L to R.
Example Output 2 (User input in bold)
What is our starting range: 17
What is our ending range: 5
Iterative range summation: 17
Recursive range summation: 17
How many disks should we use for Hanoi problem: -4
Invalid! Input must be greater than 0.
How many disks should we use for Hanoi problem: 7 dfgdfg dgdfgd
EXCEPTION: Invalid input.
How many disks should we use for Hanoi problem: sdfdfsdf
EXCEPTION: Invalid input.
How many disks should we use for Hanoi problem: 0
Invalid! Input must be greater than 0.
How many disks should we use for Hanoi problem: 4
Solution:
Move disk 1 from L to M.
Move disk 2 from L to R.
Move disk 1 from M to R.
Move disk 3 from L to M.
Move disk 1 from R to L.
Move disk 2 from R to M.
Move disk 1 from L to M.
Move disk 4 from L to R.
Move disk 1 from M to R.
Move disk 2 from M to L.
Move disk 1 from R to L.
Move disk 3 from M to R.
Move disk 1 from L to M.
Move disk 2 from L to R.
Move disk 1 from M to R.
Assignment Submission
Submit the following file(s) to me on blackboard:
Matrix.java
Recursion.java
All assignments will be submitted through blackboard. You are only allowed ONE submission so do not submit the assignment until you are completely done with it. However, you can upload the assignment and save a draft without submitting it. If you do this, don’t forget to submit it before the due date. Saving a draft and submitting it are not the same thing.
To submit the assignment, login to http://blackboard.ecu.edu. Navigate to our course and then to the “Assignments” folder. Click the link that says “Lab Assignment 10”. On this new page, scroll down to where it says “Attach File” and attach the java files for your program. You will need to browse to the location where you saved the file on your computer. If you aren’t sure where it is located, refer to assignment 1 on how to find out.
Download:	http://solutionzip.com/downloads/assignment-10-matrix-java/