[Question 2] ISC 2016 Computer Practical Paper Solved – Sorting Non-Boundary Matrix Elements

-

Question 2:

Write a program to declare a square matrix A[][] of order (M x M) where ‘M’ 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 non-boundary elements in ascending order using any standard sorting technique and rearrange them in the matrix.
(b) Calculate the sum of both the diagonals.
(c) Display the original matrix, rearranged matrix and only the diagonal elements of the rearranged matrix with their sum.
Example 1
INPUT :M = 4
9   2   1   5  
8   13  8   4  
15  6   3   11 
7   12  23  8  
OUTPUT:
ORIGINAL MATRIX
9   2   1   5  
8   13  8   4  
15  6   3   11 
7   12  23  8  
REARRANGED MATRIX
9   2   1   5  
8   3   6   4  
15  8   13  11 
7   12  23  8  
DIAGONAL ELEMENTS
9           5  
    3   6      
    8   13     
7           8      

SUM OF THE DIAGONAL ELEMENTS = 59


SOURCE CODE


import java.io.*;
import java.util.*;
class ISC2016_SortNonBoundary
{
    public static void main(String args[])
    {
        int A[][],B[];
        Scanner sc=new Scanner(System.in);
        System.out.print("Enter value of M = ");
        int M=sc.nextInt();
        if(M<4 && M>10)
        {
            System.out.println("Invalid");
        }
        else
        {
            A=new int[M][M];
            int N=(int)Math.pow((M-2),2);
            B=new int[N];
            //Loop for entering data
            for(int i=0;i<M;i++)
            {
                for(int j=0;j<M;j++)
                {
                    System.out.print("Enter a number :");
                    A[i][j]=sc.nextInt();
                }
            }
            //Loop to find b[]'s element
            int k=0;
            for(int i=0;i<M;i++)
            {
                for(int j=0;j<M;j++)
                {
                    if(i!=0 && j!=0 &&i!=(M-1) && j!= (M-1))
                    {
                        B[k]=A[i][j];k++;
                    }
                }
            }
            //Loop to sort B[]
            for(int i=0;i<N-1;i++)
            {
                for(int j=0;j<N-i-1;j++)
                {
                    if(B[j]>B[j+1])
                    {
                        int k2=B[j];
                        B[j]=B[j+1];
                        B[j+1]=k2;
                    }
                }
            }
            //Loop to print original data
            System.out.println("ORIGINAL MATRIX");
            for(int i=0;i<M;i++)
            {
                for(int j=0;j<M;j++)
                {
                    System.out.print(A[i][j]+"\t");
                }
                System.out.println();
            }        
            //LOOP TO REARRANGED MATRIXS
            int arr[][]=new int[M][M];
            int z=0;
            for(int i=0;i<M;i++)            
            {
                for(int j=0;j<M;j++)
                {  
                    if(i!=0 && j!=0 && i!=(M-1)&& j!= (M-1))
                    {
                        arr[i][j]=B[z];
                        z++;
                    }
                    else
                        arr[i][j]=A[i][j];
                }
            }            
            System.out.println("REARRANGED ELEMENT");
            for(int i=0;i<M;i++)         
            {
                for(int j=0;j<M;j++)
                {  
                    System.out.print(arr[i][j]+"\t");                    
                }
                System.out.println();
            }
            //Loop to form diagonal element            
            String ar[][]=new String[M][M];            
            int k3=0;
            for(int i=0;i<M;i++)            
            {
                for(int j=0;j<M;j++)
                {  
                    if(i!=0 && j!=0 && i!=(M-1)&& j!= (M-1))
                    {
                        ar[i][j]=String.valueOf(B[k3]);
                        k3++;
                    }
                    else
                        ar[i][j]=" ";
                }
            }

            ar[0][0]=String.valueOf(A[0][0]);
            ar[0][M-1]=String.valueOf(A[0][M-1]);
            ar[M-1][0]=String.valueOf(A[M-1][0]);
            ar[M-1][M-1]=String.valueOf(A[M-1][M-1]);
            System.out.println("DIAGONAL ELEMENT");
            for(int i=0;i<M;i++)         
            {
                for(int j=0;j<M;j++)
                {  
                    System.out.print(ar[i][j]+"\t");                    
                }
                System.out.println();
            }

            //To find the sum of diagonal            
            int a=M-1,b=0,sum=0;;
            for(int i=0;i<M;i++)
            {
                for(int j=0;j<M;j++)
                {
                    if(i==j)
                    {
                        sum=sum+Integer.valueOf(A[i][j]);
                    }
                    if(i==b && j==a)
                    {
                        sum=sum+Integer.valueOf(A[i][j]);
                        a--;b++;
                    }
                }
            }
            System.out.println("Sum="+sum);
        }
    }
}


OUTPUT





If you have any question then leave a comment below I will do my best to answer that question.

Comments

  1. vedant's recipes11 January 2022 at 10:27

    algorithm plz

    ReplyDelete
  2. Katyayini5 February 2022 at 21:57

    This comment has been removed by the author.

    ReplyDelete
  3. Unknown8 February 2022 at 08:08

    Thank u for this program

    ReplyDelete
    Replies
    1. Puneet Uttam13 February 2022 at 02:06

      Hey this is Puneet here author of this blog. if you want any help regarding any of the question then you can just mail me.
      This is my email id " puneet.uttam.99@gamil.com "

      Delete

Post a Comment

Popular posts from this blog

[Question 3] ISC 2017 Computer Practical Paper Solved – Caesar Cipher.

-
Image
Question 3: Caesar Cipher  is an encryption technique which is implemented as ROT13 (‘rotate by 13 places’). It is a simple letter substitution cipher that replaces a letter with the letter 13 places after it in the alphabets, with the other characters remaining unchanged. Write a program to accept a plain text of length L, where L must be greater than 3 and less than 100. Encrypt the text if valid as per the Caesar Cipher. Test your program with the sample data and some random data: Example 1 INPUT :  Hello! How are you? OUTPUT :  The cipher text is: Uryyb? Ubj ner lbh? Example 2 INPUT :  Encryption helps to secure data. OUTPUT :  The cipher text is: Rapelcgvba urycf gb frpher qngn. Example 3 INPUT :  You OUTPUT :  INVALID LENGTH SOURCE CODE    import java.io.*; import java.util.*; public class ISC2017_CaesarCipher {     public static void main(String args[])     { ...
Read more

Pattern of your own name.

-
Image
Pattern program of your own name. This is a pattern program, in this program you just have to enter your name and it will give you output in a particular manner. I have created this program when I was in class 10th for my Computer Application project. NOTE:  If you are copying my code then its a advise to you to copy it after downloading it to avoid any kind of compilation error its link is available at the bottom of source code. SOURCE CODE import java.io.*; public class Patter_of_your_Own_Name { public static void main(String args[])throws IOException { int time=1; BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); do { System.out.print("\n\t\t\tPLEASE,ENTER YOUR GOOD NAME IN CAPITAL LETTER           :"); String str=br.readLine(); int flag=0;
Read more

Designing Patterns - Print 'Z'.

-
Image
SOURCE CODE import java.io.*; import java.util.*; public class Z {     public static void main(String args[])     {         Scanner sc=new Scanner (System.in);         System.out.print("Enter a odd number >=5 :");         int n=sc.nextInt();         int a=n/2+1;         System.out.println("\n");         if(n>=5&& n%2!=0 )                     {             for(int i=1;i<=n;i++)             {                 for(int j=n;j>0;j-...
Read more