- Java Programs - Advanced
- Java Programs - Home
- Pernicious Number Program
- Check Matrix Column Sum Program
- Flipgram (Heterogram) Program
- Circular Queue Program
- Flight Passenger Inheritance Program
- Goldbach Number Program
- Shift Matrix Rows Up Program
- Pangram String Program
- Later Date Program
- Symmetric Matrix Program
- Cell Phone Keypad Program
- Unique Digit Integer Program
- Max & Min Elements in Matrix Program
- Anagram Strings Program
- Mask String Program Specimen
- Mix Array Program Specimen
- LCM using Recursion Program Specimen
- Recycle Dequeue Program Specimen
- Library Compute Inheritance Program Specimen
- Linked List & Binary Tree Question Specimen
- Decimal to Hexadecimal Program
- Insertion Sort Program
- Lowest & Highest ASCII Value Program
- Card Game Stack Program
- Employee Salary Overtime Inheritance Program
- Binary Tree 2024 Questions
- Hamming Number Program
- Doubly Markov Matrix Program
- Snowball String Program
- Future Date Program
- Lucky Number Program
- Bar Graph of Vowels & Consonants Program
- Vampire Number Program
- Rotate Matrix by 270 Degree Anticlockwise Program
- Keyword Cipher Program
- Increasing, Decreasing & Bouncy Number Program
- Fill Matrix with Characters Program
- Decode Encoded Text Program
- Project Submission Date Program
- Sort Matrix Boundary Elements Program
- Insert Word in a Sentence Program
- Composite Magic Number Program
- Mirror Image of a Matrix Program
- Common Words in a Paragraph Program
- Dudeney Number Recursive Program
- Matrix Transpose Program
- Sort Words Alphabetically Program
- DeQueue Data Structure Program
- Demand Supply Inheritance Program
- Linked List & Binary Tree Question
- Pronic Number in Java using Recursion
- Unique Word Program
- No Repeated Alphabets Program
- Calculate Series Program
- Reverse Number using Recursion Program
- Item Taxable Inheritance Program
- Stack Data Structure Program
- Evil Number Program
- Merge Two Arrays Program
- Remove Repeated Alphabets Program
- Rack Stack Data Structure Program
- Stock Sales Inheritance Program
- Date and Month Program
- Binary Search using Recursion Program
- Mix Two Words Program
- Circular Queue Program
- Data Interface Program
- Prime Adam Number Program
- Octal to Decimal Conversion Program
- Arrange Words Length-wise Program
- Armstrong Number Program
- Reverse Matrix Elements Program
- Rearrange Vowels & Consonants Program
- Record & Highest Inheritance Program
- Diary Class Queue Program
- Linked List and Binary Tree Program
- Generate Date Program
- Array Format Program
- Generate Palindrome Words
- Perfect Number Program on Recursion
- Checking for Equal Matrices
- Words Beginning with Capital Letter
- Number Series Inheritance Program
- Register Stack Program
- Goldbach Number Program
- Sorting Two-Dimensional Matrix Program
- Vertical Banner Program
- Palindrome using Recursion Program
- Adder Program
- Swap Sort Program
- Product Sales Inheritance Program
- Queue Program on Array
- Cartons Program
- Quiz Program
- Caesar Cipher Program
- Disarium Number Recursive Program
- Shift Matrix Shuffle Program
- ConsChange Program
- Bank Account Inheritance Program
- Bookshelf Stack Program
- Circular Prime Program
- Sort Non-boundary Matrix Elements Program
- Words Beginning and Ending with Vowels Program
- Admission Recursive Binary Search Program
- Merger Class Concatenation Program
- String Frequency Program
- WordPile Stack Program
- Plane Circle Inheritance Program
- Smallest Integer Program
- Rotate Matrix 90 Degrees Program
- Vowels and Consonants Per Word Program
- Merging Sorted Arrays Program
- Series Sum Program
- Fibonacci Strings Program
- Stock Purchase Inheritance Program
- Array to Stack Program
- Composite Magic Program
- Symmetric Matrix Program
- Deleting Word from String Program
- Emirp Number Program
- Exchange Alphabets Program
- Matrix Difference Program
- Perimeter Area Inheritance Program
- Dequeue Queue Program
- ISBN Code Program
- Mirror Image Matrix Program
- Palindrome Words Program
- Combine Array Program
- Vowel Word Program
- Happy Number Program
- Link Queue Program
- Detail Bill Inheritance Program
- Prime Palindrome Program
- Arrange Words Alphabetically Program
- Sort Matrix Elements Program
- Frequency of “And” and “An” Program
- Decimal to Octal Conversion Program
- Pseudo Arithmetic Sequence Program
- Record Rank Inheritance Program
- Stack Program Storing Names
- Number to Words Conversion Program
- Magic Number Program
- Special Number Program
- Triangular Number Program
Java Programs - Advanced
![]() Share with a Friend |
Sort Matrix Boundary Elements Program - Java Program
Write a program to declare a square matrix M[][] of order (N × N) where ‘N’ must be greater than 3 and less than 10. Allow the user to input positive integers into this matrix. Perform the following tasks on the matrix:
(a) Sort the boundary elements in ascending order using any standard sorting technique and rearrange them in the matrix in clockwise manner.
(b) Calculate the product of the non-boundary elements.
(c) Display the original matrix, rearranged matrix and only the non-boundary elements of the rearranged matrix with their product.
Test your program for the following data and some random data:
Example 1
INPUT: N = 4
|
11 |
2 |
5 |
7 |
|
8 |
10 |
9 |
4 |
|
15 |
5 |
3 |
11 |
|
1 |
17 |
14 |
8 |
OUTPUT: ORIGINAL MATRIX
|
11 |
2 |
5 |
7 |
|
8 |
10 |
9 |
4 |
|
15 |
5 |
3 |
11 |
|
1 |
17 |
14 |
8 |
REARRANGED MATRIX
|
1 |
2 |
4 |
5 |
|
17 |
10 |
9 |
7 |
|
15 |
5 |
3 |
8 |
|
14 |
11 |
11 |
8 |
NON-BOUNDARY ELEMENTS
|
10 |
9 |
|
5 |
3 |
PRODUCT OF THE NON-BOUNDARY ELEMENTS = 1350
Example 2
INPUT: N = 5
|
7 |
4 |
1 |
9 |
5 |
|
8 |
2 |
6 |
10 |
19 |
|
13 |
1 |
3 |
5 |
1 |
|
10 |
0 |
5 |
12 |
16 |
|
1 |
8 |
17 |
6 |
8 |
OUTPUT: ORIGINAL MATRIX
|
7 |
4 |
1 |
9 |
5 |
|
8 |
2 |
6 |
10 |
19 |
|
13 |
1 |
3 |
5 |
1 |
|
10 |
0 |
5 |
12 |
16 |
|
1 |
8 |
17 |
6 |
8 |
REARRANGED MATRIX
|
1 |
1 |
1 |
4 |
5 |
|
19 |
2 |
6 |
10 |
6 |
|
17 |
1 |
3 |
5 |
7 |
|
16 |
0 |
5 |
12 |
8 |
|
13 |
10 |
9 |
8 |
8 |
NON-BOUNDARY ELEMENTS
|
2 |
6 |
10 |
|
1 |
3 |
5 |
|
0 |
5 |
12 |
PRODUCT OF THE NON-BOUNDARY ELEMENTS = 0
Example 3
INPUT: N = 2
OUTPUT: SIZE OUT OF RANGE
import java.util.Scanner; class MatrixBoundary{ public static void main(String[] args){ Scanner in = new Scanner(System.in); System.out.print("N = "); int n = Integer.parseInt(in.nextLine()); if(n < 4 || n > 9){ System.out.println("SIZE OUT OF RANGE"); return; } int m[][] = new int[n][n]; int b[] = new int[n * n - (n - 2) * (n - 2)]; int index = 0; int p = 1; System.out.println("ENTER MATRIX ELEMENTS:"); for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ m[i][j] = Integer.parseInt(in.nextLine()); if(i == 0 || j == 0 || i == n - 1 || j == n - 1) b[index++] = m[i][j]; else p *= m[i][j]; } } System.out.println("ORIGINAL MATRIX"); display(m); for(int i = 0; i < b.length; i++){ for(int j = 0; j < b.length - 1 - i; j++){ if(b[j] > b[j + 1]){ int temp = b[j]; b[j] = b[j + 1]; b[j + 1] = temp; } } } index = 0; for(int j = 0; j < n; j++) m[0][j] = b[index++]; for(int i = 1; i < n; i++) m[i][n - 1] = b[index++]; for(int j = n - 2; j >= 0; j--) m[n - 1][j] = b[index++]; for(int i = n - 2; i > 0; i--) m[i][0] = b[index++]; System.out.println("REARRANGED MATRIX"); display(m); System.out.println("NON-BOUNDARY ELEMENTS"); for(int i = 1; i < n - 1; i++){ for(int j = 1; j < n - 1; j++){ System.out.print(m[i][j] + "\t"); } System.out.println(); } System.out.println("PRODUCT OF THE NON-BOUNDARY ELEMENTS = " + p); } public static void display(int a[][]){ for(int i = 0; i < a.length; i++){ for(int j = 0; j < a.length; j++){ System.out.print(a[i][j] + "\t"); } System.out.println(); } } }
Output
OUTPUT 1:
N = 4
ENTER MATRIX ELEMENTS:
11
2
5
7
8
10
9
4
15
5
3
11
1
17
14
8
ORIGINAL MATRIX
11 2 5 7
8 10 9 4
15 5 3 11
1 17 14 8
REARRANGED MATRIX
1 2 4 5
17 10 9 7
15 5 3 8
14 11 11 8
NON-BOUNDARY ELEMENTS
10 9
5 3
PRODUCT OF THE NON-BOUNDARY ELEMENTS = 1350
OUTPUT 2:
N = 5
ENTER MATRIX ELEMENTS:
7
4
1
9
5
8
2
6
10
19
13
1
3
5
1
10
0
5
12
16
1
8
17
6
8
ORIGINAL MATRIX
7 4 1 9 5
8 2 6 10 19
13 1 3 5 1
10 0 5 12 16
1 8 17 6 8
REARRANGED MATRIX
1 1 1 4 5
19 2 6 10 6
17 1 3 5 7
16 0 5 12 8
13 10 9 8 8
NON-BOUNDARY ELEMENTS
2 6 10
1 3 5
0 5 12
PRODUCT OF THE NON-BOUNDARY ELEMENTS = 0
OUTPUT 3:
N = 2
SIZE OUT OF RANGE
