Skip to main content

ISC 2025 Theory Question: Colsum check

Design a class Colsum to check if the sum of elements in each corresponding column of two matrices is equal or not. Assume that the two matrices have the same dimensions.

Example:
INPUT:

2 3 1
7 5 6
1 4 2
MATRIX A
7 4 2
1 3 1
2 5 6
MATRIX B
OUTPUT: Sum of corresponding columns is equal.

The details of the members of the class are given below:

Class name: Colsum
Data members/instance variables:
mat[][]: to store the integer array elements
m: to store the number of rows
n: to store the number of columns
Member functions/methods:
Colsum(int mm, int nn): parameterized constructor to initialize the data members m = mm and n = nn
void readArray(): to accept the elements into the array
boolean check(Colsum A, Colsum B): to check if the sum of elements in each column of the objects A and B is equal and return true, otherwise return false
void print(): to display the array elements


Specify the class Colsum giving details of the constructor, void readArray(), boolean check(Colsum, Colsum), and void print(). Define the main() function to create objects and call the functions accordingly to enable the task.

Solution:

import java.util.Scanner;
class Colsum{
    int mat[][],m,n;
    Colsum(int mm,int nn){
        m = mm;
        n = nn;
    }

    void readArray(){
        System.out.println("Enter the values into the matrix:");
        Scanner sc=new Scanner(System.in);
        mat = new int[m][n];
        for(int r=0;r<m;r++) //rows
        {
            for(int c=0;c<n;c++) //columns
            {
                mat[r][c] = sc.nextInt();
            }
        }
    }

    boolean check(Colsum A,Colsum B){
        boolean flag=false;
        for(int i=0;i<m;i++)
        {
            int s1=0;
            int s2=0;
            for(int j=0;j<n;j++)
            {
                s1+=A.mat[j][i]; //column sum
                s2+=B.mat[j][i];
            }
            if(s1==s2){
                flag=true;
            }
            else{
                flag=false;
                break;
            }
        }
        return flag;
    }

    void print(){
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                System.out.print(mat[i][j]+" ");
            }
            System.out.println();
        }
    }

    public static void main(){
        Scanner sc=new Scanner(System.in);
        System.out.println("Enter the number of rows and columns:");
        int r = sc.nextInt();
        int c = sc.nextInt();
        Colsum A = new Colsum(r,c);
        A.readArray();
        Colsum B = new Colsum(r,c);
        B.readArray();
        System.out.println("The first array is:");
        A.print();
        System.out.println("The second array is:");
        B.print();
        if(A.check(A,B))
            System.out.println("Sum of the corresponding columns is equal");
        else
            System.out.println("Sum of the corresponding columns is not equal");
    }
}
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