- Class 12 Java Program
- ISC Java Programs - Home
- Year 2025 Theory Programs
- Pernicious Number Program
- Check Matrix Column Sum Program
- Flipgram (Heterogram) Program
- Circular Queue Program
- Flight Passenger Inheritance Program
- Year 2025 Practical Programs
- 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
- Year 2025 Specimen Theory Programs
- 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
- Year 2024 Programs
- 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
- Year 2023 Programs
- 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
- Year 2023 Specimen Theory Programs
- Pronic Number in Java using Recursion
- Year 2022 Programs
- Unique Word Program
- No Repeated Alphabets Program
- Calculate Series Program
- Reverse Number using Recursion Program
- Item Taxable Inheritance Program
- Stack Data Structure Program
- Year 2021 Programs
- Evil Number Program
- Merge Two Arrays Program
- Remove Repeated Alphabets Program
- Rack Stack Data Structure Program
- Stock Sales Inheritance Program
- Year 2020 Theory Programs
- Date and Month Program
- Binary Search using Recursion Program
- Mix Two Words Program
- Circular Queue Program
- Data Interface Program
- Year 2020 Practical Programs
- Prime Adam Number Program
- Octal to Decimal Conversion Program
- Arrange Words Length-wise Program
- Year 2019 Theory Programs
- 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
- Year 2019 Practical Programs
- Generate Date Program
- Array Format Program
- Generate Palindrome Words
- Year 2018 Theory Programs
- Perfect Number Program on Recursion
- Checking for Equal Matrices
- Words Beginning with Capital Letter
- Number Series Inheritance Program
- Register Stack Program
- Year 2018 Practical Programs
- Goldbach Number Program
- Sorting Two-Dimensional Matrix Program
- Vertical Banner Program
- Year 2017 Theory Programs
- Palindrome using Recursion Program
- Adder Program
- Swap Sort Program
- Product Sales Inheritance Program
- Queue Program on Array
- Year 2017 Practical Programs
- Cartons Program
- Quiz Program
- Caesar Cipher Program
- Year 2016 Theory Programs
- Disarium Number Recursive Program
- Shift Matrix Shuffle Program
- ConsChange Program
- Bank Account Inheritance Program
- Bookshelf Stack Program
- Year 2016 Practical Programs
- Circular Prime Program
- Sort Non-boundary Matrix Elements Program
- Words Beginning and Ending with Vowels Program
- Year 2015 Theory Programs
- Admission Recursive Binary Search Program
- Merger Class Concatenation Program
- String Frequency Program
- WordPile Stack Program
- Plane Circle Inheritance Program
- Year 2015 Practical Programs
- Smallest Integer Program
- Rotate Matrix 90 Degrees Program
- Vowels and Consonants Per Word Program
- Year 2014 Theory Programs
- Merging Sorted Arrays Program
- Series Sum Program
- Fibonacci Strings Program
- Stock Purchase Inheritance Program
- Array to Stack Program
- Year 2014 Practical Programs
- Composite Magic Program
- Symmetric Matrix Program
- Deleting Word from String Program
- Year 2013 Theory Programs
- Emirp Number Program
- Exchange Alphabets Program
- Matrix Difference Program
- Perimeter Area Inheritance Program
- Dequeue Queue Program
- Year 2013 Practical Programs
- ISBN Code Program
- Mirror Image Matrix Program
- Palindrome Words Program
- Year 2012 Theory Programs
- Combine Array Program
- Vowel Word Program
- Happy Number Program
- Link Queue Program
- Detail Bill Inheritance Program
- Year 2012 Practical Programs
- Prime Palindrome Program
- Arrange Words Alphabetically Program
- Sort Matrix Elements Program
- Year 2011 Theory Programs
- Frequency of “And” and “An” Program
- Decimal to Octal Conversion Program
- Pseudo Arithmetic Sequence Program
- Record Rank Inheritance Program
- Stack Program Storing Names
- Year 2011 Practical Programs
- Number to Words Conversion Program
- Year 2009 Theory Programs
- Magic Number Program
- Year 2008 Theory Programs
- Special Number Program
- Year 2007 Theory Programs
- Triangular Number Program
Java Programs - Solved 2018 Theory Paper ISC Computer Science
![]() Share with a Friend |
Solved 2018 Theory Paper ISC Computer Science
Class 12 - ISC Computer Science Solved Theory Papers
Checking for Equal Matrices - ISC 2018 Theory
Two matrices are said to be equal if they have the same dimension and their corresponding elements are equal.
For example, the two matrices A and B given below are equal:
Matrix A:
| 1 | 2 | 3 |
| 2 | 4 | 5 |
| 3 | 5 | 6 |
Class name: Perfect
Data members/instance variables:
num: to store the number
Methods/Member functions:
Perfect(int n): parameterized constructor to initialize the data member num = n.
int sumOfFactors(int i): returns the sum of the factors of the number (num), excluding itself, using recursive technique.
void check(): checks whether the given number is perfect by invoking the function sumOfFactors(int) and displays the result with an appropriate message.
Matrix B:
| 1 | 2 | 3 |
| 2 | 4 | 5 |
| 3 | 5 | 6 |
Design a class EqMat to check if two matrices are equal or not. Assume that the two matrices have the same dimension.
Some of the members of the class are given below:
Class name: EqMat
Data members/instance variables:
a[][]: to store integer elements.
m: to store the number of rows.
n: to store the number of columns.
Member functions/methods:
EqMat(int m, int n): parameterised constructor to initialise the data members m and n.
void readArray(): to enter elements in the array.
int check(EqMat p, EqMat q): checks if the parameterised objects p and q are equal and returns 1 if true, otherwise returns 0.
void print(): displays the array elements.
Define the class EqMat giving details of the constructor, void readArray(), int check(EqMat, EqMat) and void print(). Define the main() function to create objects and call the functions accordingly to enable the task.
Program:
import java.io.*; class EqMat{ private int a[][]; private int m; private int n; public EqMat(int m, int n){ this.m = m; this.n = n; a = new int[m][n]; } public void readArray()throws IOException{ InputStreamReader in = new InputStreamReader(System.in); BufferedReader br = new BufferedReader(in); for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++) a[i][j] = Integer.parseInt(br.readLine()); } } public int check(EqMat p, EqMat q){ int status = 1; outer: for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++){ if(p.a[i][j] != q.a[i][j]){ status = 0; break outer; } } } return status; } public void print(){ for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++) System.out.print(a[i][j] + "\t"); System.out.println(); } } public static void main(String args[]) throws IOException{ InputStreamReader in = new InputStreamReader(System.in); BufferedReader br = new BufferedReader(in); System.out.print("Number of rows: "); int rows = Integer.parseInt(br.readLine()); System.out.print("Number of columns: "); int columns = Integer.parseInt(br.readLine()); EqMat obj1 = new EqMat(rows, columns); EqMat obj2 = new EqMat(rows, columns); System.out.println("Enter first matrix elements:"); obj1.readArray(); System.out.println("Enter second matrix elements:"); obj2.readArray(); System.out.println("First Matrix:"); obj1.print(); System.out.println("Second Matrix:"); obj2.print(); EqMat temp = new EqMat(rows, columns); if(temp.check(obj1, obj2) == 1) System.out.println("Matrices are equal."); else System.out.println("Matrices are unequal."); } }
Output
OUTPUT 1: Number of rows: 3 Number of columns: 3 Enter first matrix elements: 1 2 3 4 5 6 7 8 9 Enter second matrix elements: 1 2 3 4 5 6 7 8 9 First Matrix: 1 2 3 4 5 6 7 8 9 Second Matrix: 1 2 3 4 5 6 7 8 9 Matrices are equal. OUTPUT 2: Number of rows: 3 Number of columns: 3 Enter first matrix elements: 1 2 3 4 5 6 7 8 9 Enter second matrix elements: 11 22 33 44 55 66 77 88 99 First Matrix: 1 2 3 4 5 6 7 8 9 Second Matrix: 11 22 33 44 55 66 77 88 99 Matrices are unequal.
