Scribd
Upload
2 views10 pages

20 Java Array Programs With Questions

The document provides 20 Java array programs that utilize the Scanner class for input. Each program includes a solution skeleton that prompts the user for the size of the array and its elements, followed by a placeholder for implementing specific logic for various tasks such as printing elements, finding sums, and searching. The tasks cover a range of operations including sorting, merging, and searching within arrays.

Uploaded by

susantasur14
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views10 pages

20 Java Array Programs With Questions

The document provides 20 Java array programs that utilize the Scanner class for input. Each program includes a solution skeleton that prompts the user for the size of the array and its elements, followed by a placeholder for implementing specific logic for various tasks such as printing elements, finding sums, and searching. The tasks cover a range of operations including sorting, merging, and searching within arrays.

Uploaded by

susantasur14
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

20 Java Array Programs Using Scanner Class

Common input code:


Scanner sc = new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();

Q1. Print all elements of an array.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q2. Find the sum of array elements.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q3. Find the average of array elements.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q4. Find the largest element.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();
// Read array using Scanner
// Implement the required logic here.

}
}

Q5. Find the smallest element.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q6. Count even and odd elements.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.
}
}

Q7. Search an element using Linear Search.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q8. Print the array in reverse order.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q9. Copy one array into another.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q10. Find the second largest element.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}
Q11. Count positive, negative and zero elements.
Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q12. Print duplicate elements.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}
Q13. Sort the array in ascending order.
Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q14. Sort the array in descending order.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}
Q15. Merge two arrays.
Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q16. Find the frequency of a given element.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}
Q17. Print all prime numbers in the array.
Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q18. Find common elements of two arrays.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}
Q19. Perform Binary Search on a sorted array.
Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

Q20. Rotate the array left by one position.


Solution Skeleton:
import [Link];

public class Program{


public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++)
arr[i]=[Link]();

// Read array using Scanner


// Implement the required logic here.

}
}

You might also like