- 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 2012 Theory Paper ISC Computer Science
![]() Share with a Friend |
Solved 2012 Theory Paper ISC Computer Science
Class 12 - ISC Computer Science Solved Theory Papers
Combine Array Program - ISC 2012 Theory
A class Combine contains an array of integers which combines two arrays into a single array including the duplicate elements if any, and sorts the combined array. Some of the members of the class are given below:
Class name: Combine
Data members/instance variables:
com[ ]: integer array
size: size of the array
Combine(int num): parameterized constructor to assign size = num.
void inputArray(): to accept the array elements.
void sort(): sorts the elements of combined array in ascending order using the selection sort technique.
void mix(Combine a, Combine b): combines the parameterized object arrays and stores the result in the current object array along with duplicate elements if any.
void display(): displays the array elements.
Specify the class Combine giving details of the constructor, void inputArray(). void sort(), void mix(Combine, Combine) and void display(). Also define the main() function to create an object and call the methods accordingly to enable the task.
import java.io.*; class Combine{ int com[]; int size; public Combine(int num){ size = num; com = new int[size]; } public void inputArray()throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); for(int i = 0; i < size; i++) com[i] = Integer.parseInt(br.readLine()); } public void sort(){ for(int i = 0; i < size; i++){ int small = com[i]; int pos = i; for(int j = i + 1; j < size; j++){ if(small > com[j]){ small = com[j]; pos = j; } } int temp = com[i]; com[i] = small; com[pos] = temp; } } public void mix(Combine a, Combine b){ int index = 0; for(int i = 0; i < a.size; i++) this.com[index++] = a.com[i]; for(int i = 0; i < b.size; i++) this.com[index++] = b.com[i]; } public void display(){ for(int i = 0; i < size; i++) System.out.print(com[i] + "\t"); System.out.println(); } public static void main(String args[])throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.print("First array size: "); int size1 = Integer.parseInt(br.readLine()); System.out.print("Second array size: "); int size2 = Integer.parseInt(br.readLine()); Combine obj1 = new Combine(size1); Combine obj2 = new Combine(size2); Combine obj3 = new Combine(size1 + size2); System.out.println("Enter first array elements:"); obj1.inputArray(); System.out.println("Enter second array elements:"); obj2.inputArray(); System.out.println("First array elements:"); obj1.display(); System.out.println("Second array elements:"); obj2.display(); obj3.mix(obj1, obj2); obj3.sort(); System.out.println("Combined array:"); obj3.display(); } }
Output
OUTPUT 1: First array size: 3 Second array size: 3 Enter first array elements: 6 3 8 Enter second array elements: 2 1 5 First array elements: 6 3 8 Second array elements: 2 1 5 Combined array: 1 2 3 5 6 8 OUTPUT 2: First array size: 4 Second array size: 3 Enter first array elements: 9 4 7 1 Enter second array elements: 5 6 8 First array elements: 9 4 7 1 Second array elements: 5 6 8 Combined array: 1 4 5 6 7 8 9 OUTPUT 3: First array size: 5 Second array size: 3 Enter first array elements: 66 33 88 11 55 Enter second array elements: 22 44 77 First array elements: 66 33 88 11 55 Second array elements: 22 44 77 Combined array: 11 22 33 44 55 66 77 88
