- Java Programs - Advanced
- Java Programs - Home
- Pernicious Number Program
- Check Matrix Column Sum Program
- Flipgram (Heterogram) Program
- Circular Queue Program
- Flight Passenger Inheritance Program
- 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
- 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
- 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
- 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
- Pronic Number in Java using Recursion
- Unique Word Program
- No Repeated Alphabets Program
- Calculate Series Program
- Reverse Number using Recursion Program
- Item Taxable Inheritance Program
- Stack Data Structure Program
- Evil Number Program
- Merge Two Arrays Program
- Remove Repeated Alphabets Program
- Rack Stack Data Structure Program
- Stock Sales Inheritance Program
- Date and Month Program
- Binary Search using Recursion Program
- Mix Two Words Program
- Circular Queue Program
- Data Interface Program
- Prime Adam Number Program
- Octal to Decimal Conversion Program
- Arrange Words Length-wise Program
- 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
- Generate Date Program
- Array Format Program
- Generate Palindrome Words
- Perfect Number Program on Recursion
- Checking for Equal Matrices
- Words Beginning with Capital Letter
- Number Series Inheritance Program
- Register Stack Program
- Goldbach Number Program
- Sorting Two-Dimensional Matrix Program
- Vertical Banner Program
- Palindrome using Recursion Program
- Adder Program
- Swap Sort Program
- Product Sales Inheritance Program
- Queue Program on Array
- Cartons Program
- Quiz Program
- Caesar Cipher Program
- Disarium Number Recursive Program
- Shift Matrix Shuffle Program
- ConsChange Program
- Bank Account Inheritance Program
- Bookshelf Stack Program
- Circular Prime Program
- Sort Non-boundary Matrix Elements Program
- Words Beginning and Ending with Vowels Program
- Admission Recursive Binary Search Program
- Merger Class Concatenation Program
- String Frequency Program
- WordPile Stack Program
- Plane Circle Inheritance Program
- Smallest Integer Program
- Rotate Matrix 90 Degrees Program
- Vowels and Consonants Per Word Program
- Merging Sorted Arrays Program
- Series Sum Program
- Fibonacci Strings Program
- Stock Purchase Inheritance Program
- Array to Stack Program
- Composite Magic Program
- Symmetric Matrix Program
- Deleting Word from String Program
- Emirp Number Program
- Exchange Alphabets Program
- Matrix Difference Program
- Perimeter Area Inheritance Program
- Dequeue Queue Program
- ISBN Code Program
- Mirror Image Matrix Program
- Palindrome Words Program
- Combine Array Program
- Vowel Word Program
- Happy Number Program
- Link Queue Program
- Detail Bill Inheritance Program
- Prime Palindrome Program
- Arrange Words Alphabetically Program
- Sort Matrix Elements Program
- Frequency of “And” and “An” Program
- Decimal to Octal Conversion Program
- Pseudo Arithmetic Sequence Program
- Record Rank Inheritance Program
- Stack Program Storing Names
- Number to Words Conversion Program
- Magic Number Program
- Special Number Program
- Triangular Number Program
Java Programs - Advanced
![]() Share with a Friend |
Mix Array Program - Java Program
A class Mixarray contains an array of integer elements along with its capacity (more than or equal to 3). Using the following description, form a new array of integers which will contain only the first 3 elements of the two different arrays one after another.
Example:
Array1: {78, 90, 100, 45, 67}
Array2: {10, 67, 200, 90}
Resultant Array: {78, 90, 100, 10, 67, 200}
The details of the members of the class are given below:
Class name: Mixarray
Data members/instance variables:
arr[]: integer array
cap: integer to store the capacity of the array
Member functions/methods:
Mixarray(int mm): to initialize the capacity of the array cap = mm
void input(): to accept the elements of the array
Mixarray mix(Mixarray P, Mixarray Q): returns the resultant array having the first 3 elements of the array of objects P and Q
void display(): to display the array with an appropriate message.
Specify the class Mixarray giving details of the constructor(int), void input(), Mixarray mix(Mixarray, Mixarray) and void display(). Define a main() function to create objects and call the functions accordingly to enable the task.
import java.util.Scanner; class Mixarray{ int arr[]; int cap; public Mixarray(int mm){ cap = mm; arr = new int [cap]; } public void input(){ Scanner in = new Scanner(System.in); for(int i = 0; i < cap; i++) arr[i] = Integer.parseInt(in.nextLine()); } public static Mixarray mix(Mixarray P, Mixarray Q){ Mixarray obj = new Mixarray(6); int index = 0; for(int i = 0; i < 3; i++) obj.arr[index++] = P.arr[i]; for(int i = 0; i < 3; i++) obj.arr[index++] = Q.arr[i]; return obj; } public void display(){ for(int i = 0; i < cap; i++) System.out.print(arr[i] + " "); System.out.println(); } public static void main(String[] args){ Scanner in = new Scanner(System.in); System.out.print("Capacity of array1: "); int c1 = Integer.parseInt(in.nextLine()); if(c1 < 3){ System.out.println("Size must be at least 3!"); return; } Mixarray obj1 = new Mixarray(c1); System.out.println("Enter array1 elements:"); obj1.input(); System.out.print("Capacity of array2: "); int c2 = Integer.parseInt(in.nextLine()); if(c2 < 3){ System.out.println("Size must be at least 3!"); return; } Mixarray obj2 = new Mixarray(c2); System.out.println("Enter array2 elements:"); obj2.input(); Mixarray obj3 = mix(obj1, obj2); System.out.print("Array1: "); obj1.display(); System.out.print("Array2: "); obj2.display(); System.out.print("Resultant Array: "); obj3.display(); } }
Output
OUTPUT : Capacity of array1: 5 Enter array1 elements: 78 90 100 45 67 Capacity of array2: 4 Enter array2 elements: 10 67 200 90 Array1: 78 90 100 45 67 Array2: 10 67 200 90 Resultant Array: 78 90 100 10 67 200
