1. Write pseudocode to initialize an integer array of size 5 and populate it with user input.
Pseudocode:
DECLARE array[5]
FOR i FROM 0 TO 4
INPUT "Enter a number: ", array[i]
END FOR
```
Java Code:
public class ArrayInput {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int[] array = new int[5];
for (int i = 0; i < 5; i++) {
System.out.print("Enter a number: ");
array[i] = scanner.nextInt();
scanner.close();
```
2. Write pseudocode to find the sum of all elements in an integer array.
Pseudocode:
DECLARE array[5]
DECLARE sum = 0
FOR i FROM 0 TO 4
sum ← sum + array[i]
END FOR
OUTPUT "Sum: ", sum
```
Java Code:
public class ArraySum {
public static void main(String[] args) {
int[] array = {1, 2, 3, 4, 5};
int sum = 0;
for (int i = 0; i < array.length; i++) {
sum += array[i];
System.out.println("Sum: " + sum);
}
```
3. Write pseudocode to check if a given number is present in an integer array.
Pseudocode:
DECLARE array[5]
DECLARE target
DECLARE found = FALSE
INPUT "Enter a number to find: ", target
FOR i FROM 0 TO 4
IF array[i] = target THEN
found ← TRUE
EXIT FOR
END IF
END FOR
IF found THEN
OUTPUT target, " is present in the array."
ELSE
OUTPUT target, " is not present in the array."
END IF
```
Java Code:
import java.util.Scanner;
public class FindNumber {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int[] array = {1, 2, 3, 4, 5};
System.out.print("Enter a number to find: ");
int target = scanner.nextInt();
boolean found = false;
for (int i = 0; i < array.length; i++) {
if (array[i] == target) {
found = true;
break;
if (found) {
System.out.println(target + " is present in the array.");
} else {
System.out.println(target + " is not present in the array.");
}
scanner.close();
```
4. Write pseudocode to find the maximum value in a floating-point array.
Pseudocode:
```
DECLARE floatArray[5]
DECLARE max = floatArray[0]
FOR i FROM 1 TO 4
IF floatArray[i] > max THEN
max ← floatArray[i]
END IF
END FOR
OUTPUT "Maximum value: ", max
```
Java Code:
public class MaxFloat {
public static void main(String[] args) {
float[] floatArray = {1.2f, 3.5f, 2.8f, 4.1f, 2.0f};
float max = floatArray[0];
for (int i = 1; i < floatArray.length; i++) {
if (floatArray[i] > max) {
max = floatArray[i];
System.out.println("Maximum value: " + max);
```
5. Write pseudocode to count the number of even elements in an integer array.
Pseudocode:
DECLARE intArray[5]
DECLARE count = 0
FOR i FROM 0 TO 4
IF intArray[i] MOD 2 = 0 THEN
count ← count + 1
END IF
END FOR
OUTPUT "Number of even elements: ", count
```
Java Code:
public class CountEven {
public static void main(String[] args) {
int[] intArray = {2, 7, 4, 9, 6};
int count = 0;
for (int i = 0; i < intArray.length; i++) {
if (intArray[i] % 2 == 0) {
count++;
System.out.println("Number of even elements: " + count);
```
6. Write pseudocode to find the average of elements in a floating-point array.
Pseudocode:
```
DECLARE floatArray[5]
DECLARE sum = 0
DECLARE average
FOR i FROM 0 TO 4
sum ← sum + floatArray[i]
END FOR
average ← sum / 5
OUTPUT "Average: ", average
```
Java Code:
public class ArrayAverage {
public static void main(String[] args) {
float[] floatArray = {1.2f, 3.5f, 2.8f, 4.1f, 2.0f};
float sum = 0;
float average;
for (int i = 0; i < floatArray.length; i++) {
sum += floatArray[i];
}
average = sum / floatArray.length;
System.out.println("Average: " + average);
```
7.Write pseudocode to find the factorial of a given number.
Pseudocode:
DECLARE number
DECLARE factorial = 1
INPUT "Enter a number: ", number
FOR i FROM 1 TO number
factorial ← factorial * i
END FOR
OUTPUT "Factorial: ", factorial
```
Java Code:
public class Factorial {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
int factorial = 1;
for (int i = 1; i <= number; i++) {
factorial *= i;
System.out.println("Factorial: " + factorial);
```
8. Write pseudocode to check if a given string is a palindrome.
Pseudocode:
DECLARE inputString
DECLARE isPalindrome = TRUE
DECLARE length = LENGTH(inputString)
FOR i FROM 0 TO length / 2
IF inputString[i] ≠ inputString[length - 1 - i] THEN
isPalindrome ← FALSE
EXIT FOR
END IF
END FOR
IF isPalindrome THEN
OUTPUT inputString, " is a palindrome."
ELSE
OUTPUT inputString, " is not a palindrome."
END IF
```
Java Code:
public class PalindromeCheck {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String inputString = scanner.nextLine();
boolean isPalindrome = true;
int length = inputString.length();
for (int i = 0; i < length / 2; i++) {
if (inputString.charAt(i) != inputString.charAt(length - 1 - i)) {
isPalindrome = false;
break;
if (isPalindrome) {
System.out.println(inputString + " is a palindrome.");
} else {
System.out.println(inputString + " is not a palindrome.");
```
9. Write pseudocode to remove duplicate elements from an integer array.
Pseudocode:
DECLARE intArray[10]
DECLARE uniqueArray[]
DECLARE index = 0
FOR i FROM 0 TO 9
IF NOT intArray[i] IN uniqueArray THEN
uniqueArray[index] ← intArray[i]
index ← index + 1
END IF
END FOR
OUTPUT "Unique elements: ", uniqueArray
```
Java Code:
import java.util.Arrays;
public class RemoveDuplicates {
public static void main(String[] args) {
int[] intArray = {1, 2, 3, 2, 4, 5, 6, 7, 7, 8};
int[] uniqueArray = new int[10];
int index = 0;
for (int i = 0; i < 10; i++) {
if (!contains(uniqueArray, intArray[i])) {
uniqueArray[index] = intArray[i];
index++;
System.out.println("Unique elements: " + Arrays.toString(uniqueArray));
private static boolean contains(int[] array, int target) {
for (int value : array) {
if (value == target) {
return true;
return false;
```
10. Write pseudocode to find the common elements between two integer arrays.
Pseudocode:
```
DECLARE array1[5]
DECLARE array2[5]
DECLARE commonArray[]
DECLARE index = 0
FOR i FROM 0 TO 4
FOR j FROM 0 TO 4
IF array1[i] = array2[j] THEN
commonArray[index] ← array1[i]
index ← index + 1
END IF
END FOR
END FOR
OUTPUT "Common elements: ", commonArray
```
Java Code:
import java.util.Arrays;
public class CommonElements {
public static void main(String[] args) {
int[] array1 = {1, 2, 3, 4, 5};
int[] array2 = {3, 4, 5, 6, 7};
int[] commonArray = new int[5];
int index = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (array1[i] == array2[j]) {
commonArray[index] = array1[i];
index++;
System.out.println("Common elements: " + Arrays.toString(commonArray));
```
11. Write pseudocode to calculate the average of three numbers.
Pseudocode:
```
DECLARE num1, num2, num3
DECLARE average
INPUT "Enter first number: ", num1
INPUT "Enter second number: ", num2
INPUT "Enter third number: ", num3
average ← (num1 + num2 + num3) / 3
OUTPUT "Average: ", average
```
Java Code:
public class AverageCalculation {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter first number: ");
double num1 = scanner.nextDouble();
System.out.print("Enter second number: ");
double num2 = scanner.nextDouble();
System.out.print("Enter third number: ");
double num3 = scanner.nextDouble();
double average = (num1 + num2 + num3) / 3;
System.out.println("Average: " + average);
```
12. Write pseudocode to check if a number is positive, negative, or zero.
Pseudocode:
DECLARE number
INPUT "Enter a number: ", number
IF number > 0 THEN
OUTPUT number, " is positive."
ELSE IF number < 0 THEN
OUTPUT number, " is negative."
ELSE
OUTPUT number, " is zero."
END IF
```
Java Code:
public class PositiveNegativeZero {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
if (number > 0) {
System.out.println(number + " is positive.");
} else if (number < 0) {
System.out.println(number + " is negative.");
} else {
System.out.println(number + " is zero.");
```
13. Write pseudocode to find the square of a given number.
Pseudocode:
DECLARE number
DECLARE square
INPUT "Enter a number: ", number
square ← number * number
OUTPUT "Square: ", square
```
Java Code:
public class SquareCalculation {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
double number = scanner.nextDouble();
double square = number * number;
System.out.println("Square: " + square);
}
```
14. Write pseudocode to determine if a year is a leap year.
Pseudocode:
DECLARE year
INPUT "Enter a year: ", year
IF (year MOD 4 = 0 AND year MOD 100 ≠ 0) OR (year MOD 400 = 0) THEN
OUTPUT year, " is a leap year."
ELSE
OUTPUT year, " is not a leap year."
END IF
```
Java Code:
public class LeapYearCheck {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a year: ");
int year = scanner.nextInt();
if ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0)) {
System.out.println(year + " is a leap year.");
} else {
System.out.println(year + " is not a leap year.");
```
15. Write pseudocode to calculate the area of a rectangle.
Pseudocode:
DECLARE length, width
DECLARE area
INPUT "Enter length: ", length
INPUT "Enter width: ", width
area ← length * width
OUTPUT "Area: ", area
```
Java Code:
public class RectangleArea {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter length: ");
double length = scanner.nextDouble();
System.out.print("Enter width: ");
double width = scanner.nextDouble();
double area = length * width;
System.out.println("Area: " + area);
```
16. Write pseudocode to check if a given character is a vowel.
Pseudocode:
DECLARE character
INPUT "Enter a character: ", character
IF character IS ONE OF 'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U' THEN
OUTPUT character, " is a vowel."
ELSE
OUTPUT character, " is not a vowel."
END IF
```
Java Code:
public class VowelCheck {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a character: ");
char character = scanner.next().charAt(0);
if ("aeiouAEIOU".indexOf(character) != -1) {
System.out.println(character
+ " is a vowel.");
} else {
System.out.println(character + " is not a vowel.");
```
17. Write pseudocode to find the maximum of two numbers.
Pseudocode:
DECLARE num1, num2
DECLARE max
INPUT "Enter first number: ", num1
INPUT "Enter second number: ", num2
IF num1 > num2 THEN
max ← num1
ELSE
max ← num2
END IF
OUTPUT "Maximum: ", max
```
Java Code:
public class MaxOfTwo {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter first number: ");
double num1 = scanner.nextDouble();
System.out.print("Enter second number: ");
double num2 = scanner.nextDouble();
double max = (num1 > num2) ? num1 : num2;
System.out.println("Maximum: " + max);
```
18. Write pseudocode to determine if a given number is even or odd.
Pseudocode:
DECLARE number
INPUT "Enter a number: ", number
IF number MOD 2 = 0 THEN
OUTPUT number, " is even."
ELSE
OUTPUT number, " is odd."
END IF
```
Java Code:
public class EvenOddCheck {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
if (number % 2 == 0) {
System.out.println(number + " is even.");
} else {
System.out.println(number + " is odd.");
```
19. Write pseudocode to find the minimum of three numbers.
Pseudocode:
DECLARE num1, num2, num3
DECLARE min
INPUT "Enter first number: ", num1
INPUT "Enter second number: ", num2
INPUT "Enter third number: ", num3
min ← num1
IF num2 < min THEN
min ← num2
END IF
IF num3 < min THEN
min ← num3
END IF
OUTPUT "Minimum: ", min
```
Java Code:
public class MinOfThree {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter first number: ");
double num1 = scanner.nextDouble();
System.out.print("Enter second number: ");
double num2 = scanner.nextDouble();
System.out.print("Enter third number: ");
double num3 = scanner.nextDouble();
double min = num1;
if (num2 < min) {
min = num2;
if (num3 < min) {
min = num3;
System.out.println("Minimum: " + min);
```
20. Write pseudocode to check if a number is a prime number.
Pseudocode:
DECLARE number
DECLARE isPrime = TRUE
INPUT "Enter a number: ", number
IF number ≤ 1 THEN
isPrime ← FALSE
ELSE
FOR i FROM 2 TO SQRT(number)
IF number MOD i = 0 THEN
isPrime ← FALSE
EXIT FOR
END IF
END FOR
END IF
IF isPrime THEN
OUTPUT number, " is a prime number."
ELSE
OUTPUT number, " is not a prime number."
END IF
```
Java Code:
public class PrimeCheck {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
boolean isPrime = true;
if (number <= 1) {
isPrime = false;
} else {
for (int i = 2; i <= Math.sqrt(number); i++) {
if (number % i == 0) {
isPrime = false;
break;
if (isPrime) {
System.out.println(number + " is a prime number.");
} else {
System.out.println(number + " is not a prime number.");
```
