JAVA ASSIGNIMENT 1

UNIT-3
1. Program for sorting a given list of names in ascending order.
INPUT:
import java.util.Arrays;
import java.util.Scanner;

public class NameSorter {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of names: ");
int n = scanner.nextInt();
scanner.nextLine();
String[] names = new String[n];
System.out.println("Enter the names:");
for (int i = 0; i < n; i++) {
names[i] = scanner.nextLine();
}
Arrays.sort(names);
System.out.println("\nSorted Names in Ascending Order:");
for (String name : names) {
System.out.println(name);
}
scanner.close();
}
}
OUTPUT:

G. Dharani Prakash 2023003560

 JAVA ASSIGNIMENT 1

2. Program to multiply two given matrices?

INPUT:
import java.util.Scanner;

public class MatrixMultiplication {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter rows and columns for first matrix: ");
int rows1 = scanner.nextInt();
int cols1 = scanner.nextInt();
System.out.print("Enter rows and columns for second matrix: ");
int rows2 = scanner.nextInt();
int cols2 = scanner.nextInt();
if (cols1 != rows2) {
System.out.println("Matrix multiplication is not possible! Columns of first matrix must
equal rows of second matrix.");
return;

G. Dharani Prakash 2023003560

 JAVA ASSIGNIMENT 1
}
int[][] matrix1 = new int[rows1][cols1];
System.out.println("Enter elements of first matrix:");
for (int i = 0; i < rows1; i++) {
for (int j = 0; j < cols1; j++) {
matrix1[i][j] = scanner.nextInt();
}
}
int[][] matrix2 = new int[rows2][cols2];
System.out.println("Enter elements of second matrix:");
for (int i = 0; i < rows2; i++) {
for (int j = 0; j < cols2; j++) {
matrix2[i][j] = scanner.nextInt();
}
}
int[][] result = new int[rows1][cols2];
for (int i = 0; i < rows1; i++) {
for (int j = 0; j < cols2; j++) {
for (int k = 0; k < cols1; k++) {
result[i][j] += matrix1[i][k] * matrix2[k][j];
}
}
}
System.out.println("\nProduct of the matrices:");
for (int i = 0; i < rows1; i++) {
for (int j = 0; j < cols2; j++) {
System.out.print(result[i][j] + " ");
}
System.out.println();

G. Dharani Prakash 2023003560

 JAVA ASSIGNIMENT 1
}
scanner.close();
}
}
OUTPUT:

3. Program to find Maximum and minimum value in an array of size “M”, passed as
argument.
INPUT:
import java.util.Scanner;

public class MinMaxFinder {

public static void main(String[] args) {
if (args.length < 1) {
System.out.println("Usage: java MinMaxFinder <size_of_array>");
return;
}
int M = Integer.parseInt(args[0]);
if (M <= 2) {
System.out.println("Array size must be greater than 0.");
return;
}
Scanner scanner = new Scanner(System.in);
int[] arr = new int[M];
System.out.println("Enter " + M + " elements:");

G. Dharani Prakash 2023003560

 JAVA ASSIGNIMENT 1
for (int i = 0; i < M; i++) {
arr[i] = scanner.nextInt();
}
int min = arr[0], max = arr[0];
for (int i = 1; i < M; i++) {
if (arr[i] < min) {
min = arr[i];
}
if (arr[i] > max) {
max = arr[i];
}
}
System.out.println("Minimum value: " + min);
System.out.println("Maximum value: " + max);
scanner.close();
}
}
OUTPUT:

4. Program to read and print an array of size N rows with variable column size .(Hint:
Irregular array).
INPUT:
import java.util.Scanner;

public class Irregulararray {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of rows (N): ");
int N = scanner.nextInt();
int[][] arr = new int[N][];
for (int i = 0; i < N; i++) {
System.out.print("Enter number of columns for row " + (i + 1) + ": ");
int columns = scanner.nextInt();
arr[i] = new int[columns];

G. Dharani Prakash 2023003560

 JAVA ASSIGNIMENT 1
System.out.println("Enter " + columns + " elements for row " + (i + 1) + ": ");
for (int j = 0; j < columns; j++) {
arr[i][j] = scanner.nextInt();
}
}
System.out.println("\nThe Jagged Array:");
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
scanner.close();
}
}
OUTPUT:

5. Program that copies contents of one array to another using length member.
INPUT:
import java.util.Scanner;

public class CopyArray {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the size of the array: ");
int size = scanner.nextInt();

G. Dharani Prakash 2023003560

 JAVA ASSIGNIMENT 1
int[] originalArray = new int[size];
System.out.println("Enter " + size + " elements:");
for (int i = 0; i < size; i++) {
originalArray[i] = scanner.nextInt();
}
int[] copiedArray = new int[originalArray.length];
for (int i = 0; i < originalArray.length; i++) {
copiedArray[i] = originalArray[i];
}
System.out.println("\nCopied Array:");
for (int num : copiedArray) {
System.out.print(num + " ");
}
scanner.close();
}
}
OUTPUT:

6. Program to find element from an sorted array using binary search (java.util.package)
INPUT:
import java.util.Arrays;
import java.util.Scanner;

public class BinarySearchExa {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the size of the sorted array: ");
int size = scanner.nextInt();
int[] arr = new int[size];
System.out.println("Enter " + size + " sorted elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
System.out.print("Enter the element to search: ");

G. Dharani Prakash 2023003560

 JAVA ASSIGNIMENT 1
int key = scanner.nextInt();
int index = Arrays.binarySearch(arr, key);
if (index >= 0) {
System.out.println("Element " + key + " found at index: " + index);
} else {
System.out.println("Element " + key + " not found in the array.");
}
scanner.close();
}
}
OUTPUT:

7. Program to delete duplicate elements from an array of size 5.

INPUT:
import java.util.Arrays;
import java.util.Scanner;

public class RemoveDuplicates {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int size = 5;
int[] arr = new int[size];
System.out.println("Enter 5 elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();

G. Dharani Prakash 2023003560

 JAVA ASSIGNIMENT 1
}
Arrays.sort(arr);
int[] temp = new int[size];
int j = 0;
for (int i = 0; i < size - 1; i++) {
if (arr[i] != arr[i + 1]) {
temp[j++] = arr[i];
}
}
temp[j++] = arr[size - 1];
System.out.println("\nArray after removing duplicates:");
for (int i = 0; i < j; i++) {
System.out.print(temp[i] + " ");
}
scanner.close();
}
}
OUTPUT:

G. Dharani Prakash 2023003560