Skip to main content

ShiftRows 2025 ISC Practical

 Write a program to declare a matrix A[][] of order (M × N) where ‘M’ is the number of rows and ‘N’ is the number of columns such that both M and N must be greater than 2 and less than 10. Allow the user to input integers into this matrix. Display appropriate error message for an invalid input.
Perform the following tasks on the matrix:
(a) Display the input matrix.
(b) Shift each row one step upwards so the first row becomes the last row, 2nd row will be the 1st row and so on.
(c) Display the rotated matrix along with the highest element and its location in the matrix.

Test your program for the following data and some random data:
Example 1
INPUT:
M = 3
N = 4
Enter elements in the matrix:

100

90

87

76

200

500

167

998

77

567

89

254

OUTPUT:
FORMED MATRIX AFTER ROTATING:

200

500

167

998

77

567

89

254

100

90

87

76

Highest element: 998 (Row: 0 and Column: 3)
Example 2
INPUT:
M = 4
N = 3
Enter elements in the matrix:

54

120

187

78

55

289

134

67

89

63

341

122

OUTPUT:
FORMED MATRIX AFTER ROTATING:

78

55

289

134

67

89

63

341

122

54

120

187

Highest element: 341 (Row: 2 and Column: 1)
Example 3
INPUT:
M = 2
N = 3
OUTPUT: SIZE IS OUT OF RANGE. INVALID ENTRY.

Program:

import java.util.Scanner;
class ShiftRows{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        System.out.print("M = ");
        int m = sc.nextInt();
        System.out.print("N = ");
        int n = sc.nextInt();
        if(m < 3 || m > 9 || n < 3 || n > 9){
            System.out.println("SIZE IS OUT OF RANGE. INVALID ENTRY.");
            return;
        }
        int mat[][] = new int[m][n];
        int r = 0;
        int c = 0;
        System.out.println("ENTER ELEMENTS IN THE MATRIX:");
        for(int i = 0; i < m; i++){
            for(int j = 0; j < n; j++){
                mat[i][j] = sc.nextInt();
            }
        }
        System.out.println("ORIGINAL MATRIX:");
        display(mat);
        int a[] = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = mat[0][i];
        for(int i = 1; i < m; i++){
            for(int j = 0; j < n; j++){
                mat[i - 1][j] = mat[i][j];
            }
        }
        for(int i = 0; i < n; i++)
            mat[m - 1][i] = a[i];
        System.out.println("FORMED MATRIX AFTER ROTATING:");
        display(mat);
        for(int i = 0; i < m; i++){
            for(int j = 0; j < n; j++){
                if(mat[i][j] > mat[r][c]){
                    r = i;
                    c = j;
                }
            }
        }
        System.out.print("HIGHEST ELEMENT: " + mat[r][c]);
        System.out.println(" (Row: " + r + " and Column: " + c + ")");
        sc.close();
    }
    public static void display(int mat[][]){
        for(int i = 0; i < mat.length; i++){
            for(int j = 0; j < mat[0].length; j++){
                System.out.print(mat[i][j] + "\t");
            }
            System.out.println();
        }
    }
}

Labels

Labels:

Popular posts from this blog

Panagram ISC 2025 Specimen Practical Paper

import java.util.*; class panagram //ISC 2025 Practical Question {     //str for storing the sentence     String str;     panagram()     {         str="";     }     void accept()     {         Scanner sc=new Scanner(System.in);         System.out.println("Enter a sentence:");         str=sc.nextLine();     }     void panagramcheck()     {         int letters[]=new int[26];          StringTokenizer st=new StringTokenizer(str);         while(st.hasMoreTokens())         {             String w = st.nextToken().toUpperCase();             for(int i=65;i<=90;i++)             {                 for(int j=...
Read more

Program in Java: ISC Program CellPhone Keystrokes

import java.util.Scanner; public class Keypad {     public static void main(String args[])     {         //Array to hold keystrokes for each letter         int keys[] = new int[26];         //intialise         keys['A'-'A']=1; //A         keys['B'-'A']=2; //B         keys['C'-'A']=3; //C         keys['D'-'A']=1; //D         keys['E'-'A']=2; //E         keys['F'-'A']=3; //F         keys['G'-'A']=1; //G         keys['H'-'A']=2; //H         keys['I'-'A']=3; //I         keys['J'-'A']=1; //J         keys['K'-'A']=2; //K         keys['L'-'A']=3; //L         keys['M'-'A']=1; //M         keys['N'-'A']=2; //N       ...
Read more

ISC Program: Predict day of the week from date

Algorithm : 1)Take the last two digits of the year. 2)Divide by 4, discarding any fraction. 3)Add the day of the month. 4)Add the month's key value: JFM AMJ JAS OND 144 025 036 146 5)Subtract 1 for January or February of a leap year. 6)For a Gregorian date, add 0 for 1900's, 6 for 2000's, 4 for 1700's, 2 for 1800's; for other years, add or subtract multiples of 400. 7)For a Julian date, add 1 for 1700's, and 1 for every additional century you go back. 8)Add the last two digits of the year. 9)Divide by 7 and take the remainder. Example : Let's take a date: 26/03/2027 Last two digit of the year = 27 Divide by 4 discard fraction = 27/4 = 6.75 = 6 Add day = 6 + 26 = 32 Month key = 4 + 32 = 36 Add year code = 36 + 6 = 42 Now add two digits of the first year = 42 + 27 = 69 Now get the remainder after dividing by 7 = 69%7=6 So 1 is Sunday so 6 is Friday So 27/03/2027 Program : import java.util.Scanner; public class daydate {     public static void main(String[] arg...
Read more