12 ISC IMPORTANT PROGRAMS
12 ISC IMPORTANT PROGRAMS
*;
class matrix
{
void f()
{
int ar[][]=new int [4][4];
int x = ar.length;
Scanner sc = new Scanner(System.in);
int i,j,se=0,so=0;
System.out.println("enter elements into matrix");
for(i=0;i<4;i++)
{
for (j=0;j<4;j++)
ar[i][j]=sc.nextInt();
}
System.out.print("original matrix");
for(i=0;i<4;i++)
{
for(j=0;j<4;j++)
{
System.out.printf("%5d",ar[i][j]);
if(ar[i][j]%2==0)
se=se+ar[i][j];
else
so=so+ar[i][j];
System.out.println();
}
System.out.println("sum of even"+se);
System.out.println("sum of odd"+so);
}
}
import java.util.*;
class kkk
{
void f()
{
int ar[][]=new int[4][4];
Scanner sc= new Scanner(System.in);
int i,j,big=0;
System.out.println("enter elements into matrix");
for (i=0;i<4;i++)
{
for(j=0;j<4;j++)
ar[i][j]=sc.nextInt();
}
for(i=0;i<4;i++)
{
for(j=0;j<4;j++)
{
big=Math.max(big,ar[i][j]);
}
}
System.out.println("largest"+big);
}
}
void main()
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter the number of elements: ");
int n = sc.nextInt();
int[] arr = new int[n];
System.out.println("Enter the elements: ");
for (int i = 0; i < n; i++)
{
arr[i] = sc.nextInt();
}
insertionSort(arr);
System.out.println("Rearranged (sorted) array in
ascending order:");
for (int i = 0; i < n; i++)
{
System.out.print(arr[i] + " “)
}
}
}
import java.util.Scanner;
class PrimeTriplet
{
boolean isPrime(int num)
{
if (num <= 1) return false;
for (int i = 2; i * i <= num; i++)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
void main()
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter a number to find prime
triplets: ");
int limit = sc.nextInt();
System.out.println("Prime triplets up to " + limit
+ ":");
for (int i = 2; i <= limit - 4; i++) {
if (isPrime(i) && isPrime(i + 2) && isPrime(i + 4))
{
System.out.println("(" + i + ", " + (i + 2) + ", "
+ (i + 4) + ")");
}
}
}
import java.util.Scanner;
class ArmstrongNumber
{
int armstrongSum(int number, int power)
{
if (number == 0)
{
return 0;
}
int digit = number % 10;
return (int) Math.pow(digit, power) +
armstrongSum(number / 10, power);
}
boolean isArmstrong(int number)
{
int originalNumber = number;
int digitsCount = (int) Math.log10(number) + 1;
int sum = armstrongSum(number, digitsCount);
return sum == originalNumber;
}
void main()
{
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
if (isArmstrong(number))
{
System.out.println(number + " is an Armstrong
number.");
}
else
{
System.out.println(number + " is not an
Armstrong number.");
}
}
}
import java.util.Scanner;
class MatrixExample
{
void main()
{
int[][] matrix = new int[4][4];
Scanner sc = new Scanner(System.in);
System.out.println("Enter the elements for a 4x4
matrix:");
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++)
{
System.out.print("Enter element at [" + i + "]["
+ j + "]: ");
matrix[i][j] = sc.nextInt();
}
}
int rows = matrix.length;
int columns = matrix[0].length;
System.out.println("\nMatrix entered:");
for (int i = 0; i < rows; i++) {
for (int j = 0; j < columns; j++)
{
System.out.print(matrix[i][j] + " ");
}
System.out.println();
}
System.out.println("\nNumber of rows: " + rows);
System.out.println("Number of columns: " +
columns);
}}
import java.util.*;
class ReverseArray
{
void main ()
{
Scanner Sc= new Scanner (System.in);
int n=Sc.nextInt();
int ar[]=new int [n];
System.out.println("Enter 'n' numbers");
for(int i=0;i<n;i++)
{
ar[i]=Sc.nextInt();
}
System.out.println("");
System.out.println("Reversed Array");
//Reverse
for(int i=n-1;i>=0;i--)
{
System.out.print(ar[i]+" ");
}
System.out.println("");
}
}