Unique Java Programs for Exam Preparation
1. Reverse a Number
Reverse the digits of a given number.
import [Link];
public class ReverseNumber {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
int reversed = 0;
while (num != 0) {
int digit = num % 10;
reversed = reversed * 10 + digit;
num /= 10;
}
[Link]("Reversed Number: " + reversed);
[Link]();
}
}
2. Find the Second Largest Element in an Array
Determine the second largest element in a single-dimensional array.
import [Link];
import [Link];
public class SecondLargest {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the size of the array: ");
int size = [Link]();
int[] arr = new int[size];
[Link]("Enter " + size + " elements:");
for (int i = 0; i < size; i++) {
arr[i] = [Link]();
}
[Link](arr);
int secondLargest = arr[[Link] - 2];
[Link]("Second Largest Element: " + secondLargest);
[Link]();
}
}
3. Check if a Number is Palindrome
Determine whether a given number is a palindrome.
import [Link];
public class PalindromeNumber {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
int original = num, reversed = 0;
while (num != 0) {
int digit = num % 10;
reversed = reversed * 10 + digit;
num /= 10;
}
if (original == reversed) {
[Link]("The number is a Palindrome.");
} else {
[Link]("The number is not a Palindrome.");
}
[Link]();
}
}
4. Count Frequency of Each Element in an Array
Count how many times each element appears in a single-dimensional array.
import [Link];
public class FrequencyCount {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the size of the array: ");
int size = [Link]();
int[] arr = new int[size];
int[] freq = new int[size];
[Link]("Enter " + size + " elements:");
for (int i = 0; i < size; i++) {
arr[i] = [Link]();
freq[i] = -1;
}
for (int i = 0; i < size; i++) {
int count = 1;
for (int j = i + 1; j < size; j++) {
if (arr[i] == arr[j]) {
count++;
freq[j] = 0;
}
}
if (freq[i] != 0) {
freq[i] = count;
}
}
[Link]("Element | Frequency");
for (int i = 0; i < size; i++) {
if (freq[i] != 0) {
[Link](" " + arr[i] + " | " + freq[i]);
}
}
[Link]();
}
}
5. Sum of Digits of a Number
Calculate the sum of digits of a given number.
import [Link];
public class SumOfDigits {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
int sum = 0;
while (num != 0) {
sum += num % 10;
num /= 10;
}
[Link]("Sum of Digits: " + sum);
[Link]();
}
}
6. Check if Array is Sorted
Determine whether a single-dimensional array is sorted in ascending order.
import [Link];
public class ArraySortedCheck {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the size of the array: ");
int size = [Link]();
int[] arr = new int[size];
[Link]("Enter " + size + " elements:");
for (int i = 0; i < size; i++) {
arr[i] = [Link]();
}
boolean isSorted = true;
for (int i = 0; i < size - 1; i++) {
if (arr[i] > arr[i + 1]) {
isSorted = false;
break;
}
}
if (isSorted) {
[Link]("The array is sorted.");
} else {
[Link]("The array is not sorted.");
}
[Link]();
}
}
Check if a String is a Panagram
import [Link];
public class PangramCheck {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter a string: ");
String str = [Link]().toLowerCase();
boolean[] alphabet = new boolean[26];
int index;
for (int i = 0; i < [Link](); i++) {
if ([Link](i) >= 'a' && [Link](i) <= 'z') {
index = [Link](i) - 'a';
alphabet[index] = true;
boolean isPangram = true;
for (boolean b : alphabet) {
if (!b) {
isPangram = false;
break;
}
if (isPangram) {
[Link]("The string is a Pangram.");
} else {
[Link]("The string is not a Pangram.");
[Link]();
2. Find the Missing Number in an Array
Description:
Given an array of n-1 integers in the range 1 to n, find the missing number.
Code:
java
CopyEdit
import [Link];
public class MissingNumber {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the size of the array (n): ");
int n = [Link]();
int[] arr = new int[n - 1];
int total = n * (n + 1) / 2;
[Link]("Enter " + (n - 1) + " elements:");
for (int i = 0; i < [Link]; i++) {
arr[i] = [Link]();
total -= arr[i];
[Link]("The missing number is: " + total);
[Link]();
3. Check if Two Strings are Anagrams
Description:
Determine whether two given strings are anagrams of each other.
Code:
java
CopyEdit
import [Link];
import [Link];
public class AnagramCheck {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the first string: ");
String str1 = [Link]();
[Link]("Enter the second string: ");
String str2 = [Link]();
if ([Link]() != [Link]()) {
[Link]("The strings are not Anagrams.");
return;
char[] arr1 = [Link]();
char[] arr2 = [Link]();
[Link](arr1);
[Link](arr2);
if ([Link](arr1, arr2)) {
[Link]("The strings are Anagrams.");
} else {
[Link]("The strings are not Anagrams.");
[Link]();
4. Rotate an Array by K Positions
Description:
Shift elements in an array to the right by K positions.
Code:
java
CopyEdit
import [Link];
public class RotateArray {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the size of the array: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter " + n + " elements:");
for (int i = 0; i < n; i++) {
arr[i] = [Link]();
[Link]("Enter the value of K: ");
int k = [Link]();
k %= n;
[Link]("Array after rotation:");
for (int i = n - k; i < n; i++) {
[Link](arr[i] + " ");
for (int i = 0; i < n - k; i++) {
[Link](arr[i] + " ");
[Link]();
}
5. Print All Subarrays of an Array
Description:
Print all possible subarrays of a given array.
Code:
java
CopyEdit
import [Link];
public class Subarrays {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the size of the array: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter " + n + " elements:");
for (int i = 0; i < n; i++) {
arr[i] = [Link]();
[Link]("All subarrays:");
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
for (int k = i; k <= j; k++) {
[Link](arr[k] + " ");
[Link]();
[Link]();