0% found this document useful (0 votes)
61 views

Computer Science 12

The document contains Java code definitions for multiple classes that perform operations on arrays and matrices, including: 1) Checking if a number is prime and storing prime numbers in an array. 2) Generating and storing the Fibonacci series in an array. 3) Replacing a word in a sentence with a replacement word. 4) Checking if a matrix is a magic square.

Uploaded by

hailey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
61 views

Computer Science 12

The document contains Java code definitions for multiple classes that perform operations on arrays and matrices, including: 1) Checking if a number is prime and storing prime numbers in an array. 2) Generating and storing the Fibonacci series in an array. 3) Replacing a word in a sentence with a replacement word. 4) Checking if a matrix is a magic square.

Uploaded by

hailey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

import java.util.

*;

public class PrimeArray {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter the number of rows and columns: ");

int r = sc.nextInt(), c = sc.nextInt(), a[][] = new int[r][c],num = 2;

for (int i = 0; i < r; i++) {

for (int j = 0; j < c; j++) {

while (!isPrime(num)) {

num++;

a[i][j] = num;

num++;

System.out.println("Prime numbers:");

for (int i = 0; i < r; i++) {

for (int j = 0; j < c; j++) {

System.out.print(a[i][j] + "\t\t");

System.out.println();

public static boolean isPrime(int num) {

if (num <= 1) return false;

for (int i = 2; i <= Math.sqrt(num); i++) {

if (num % i == 0) return false;

return true;

}
import java.util.*;

public class FibArray {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter the number of rows and columns: ");

int r = sc.nextInt();

int c = sc.nextInt();

int fib[][] = new int[r][c];

int a = 0, b = 1;

for (int i = 0; i < r; i++) {

for (int j = 0; j < c; j++) {

fib[i][j] = a;

int s = a + b;

a = b;

b = s;

System.out.println("Fibonacci series:");

for (int i = 0; i < r; i++) {

for (int j = 0; j < c; j++) {

System.out.print(fib[i][j] + "\t\t");

System.out.println();

}
import java.util.*;

public class ReplaceWord {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence: ");

String sen = sc.nextLine();

System.out.println("Enter the word to be replaced: ");

String wrd = sc.next();

System.out.println("Enter the word to replace it with: ");

String word = sc.next();

String fin = sen.replace(wrd, word);

System.out.println("Final sentence: " + fin);

}
import java.util.*;

public class MagicSquare {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.print("Enter the size of the square matrix: ");

int n = sc.nextInt(),sum=0, a[][]=new int [n][n], rowSum=0, colSum=0, diagSum1=0, diagSum2=0;

System.out.println("Enter the elements of the square matrix: ");

for (int i = 0; i < n; i++)

for (int j = 0; j < n; j++)

a[i][j] = sc.nextInt();

for (int j = 0; j < n; j++)

colSum=0;diagSum1=0;diagSum2=0;sum=0;rowSum=0;

for (int i = 0; i < n; i++)

sum += a[0][i];colSum += a[i][j];diagSum1 += a[i][i];diagSum2 += a[i][n - 1 - i];rowSum +=


a[j][i];

if(diagSum1 != sum||diagSum2 !=
sum||rowSum!=sum||colSum!=sum){System.out.println("The given matrix is not a magic
square");System.exit(0);}

System.out.println("The given matrix is a magic square.");

}
import java.util.*;

public class RemoveDuplicates {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter a word: ");

String word = sc.next();

String result = "";

for (int i = 0; i < word.length(); i++) {

char ch = word.charAt(i);

if (result.indexOf(ch) == -1) {

result += ch;

System.out.println("Word after removing duplicate characters: " + result);

}
import java.util.*;

public class ScalarMatrix {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.print("Enter the size of the matrix: ");

int s = sc.nextInt(),a[][] = new int[s][s],diag=a[0][0];

System.out.println("Enter elements : ");

for (int i = 0; i < s; i++) {

for (int j = 0; j < s; j++) {

a[i][j] = sc.nextInt();

boolean flag = true;

for (int i = 0; i < s; i++) {

for (int j = 0; j < s; j++) {

if (i == j && a[i][j] != diag) {

flag = false;

break;

} else if (i != j && a[i][j] != 0) {

flag = false;

break;

if (!flag) break;

System.out.println((flag)?"The matrix is a scalar matrix.":"The matrix is not a scalar matrix.");

}
import java.util.*;

public class FascinatingNumber {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.print("Enter a number: ");

int n = sc.nextInt();

String s = Integer.toString(n * 1) + Integer.toString(n * 2) + Integer.toString(n * 3);

for (int i = 1; i <= 9; i++) {

if (s.indexOf(Integer.toString(i)) == -1||n<100) {

System.out.println(n + " is not a fascinating number.");System.exit(0);

System.out.println(n + " is a fascinating number.");

}
import java.util.*;

public class KeithNumber {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.print("Enter a number: ");

int n = sc.nextInt();

int temp = n;int len=Integer.toString(n).length();

int arr[]=new int[n];

for(int i=len-1; i>=0; i--){

arr[i]=temp%10;

temp=temp/10;

int sum=0, i=len;

while(sum<n){

sum=0;

for(int j=1; j<=len; j++){

sum+=arr[i-j];

arr[i]=sum;

i++;

System.out.println((sum==n)?"It is a Keith Number":"It is not a Keith Number");

}
import java.util.*;

public class Transpose {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter the number of rows and columns: ");

int r = sc.nextInt();

int c = sc.nextInt();

int a[][] = new int[r][c];

System.out.println("Enter the elements: ");

for (int i = 0; i < r; i++) {

for (int j = 0; j < c; j++) {

a[i][j] = sc.nextInt();

int t[][] = new int[c][r];

for (int i = 0; i < r; i++) {

for (int j = 0; j < c; j++) {

t[j][i] = a[i][j];

System.out.println("Transpose of the matrix:");

for (int i = 0; i < c; i++) {

for (int j = 0; j < r; j++) {

System.out.print(t[i][j]+" ");

System.out.println();

}
import java.util.Scanner;

public class UpperTriangular{

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.print("Enter the size of the matrix: ");

int s = sc.nextInt();

int a[][] = new int[s][s];

System.out.println("Enter the elements: ");

for (int i = 0; i < s; i++) {

for (int j = 0; j < s; j++) {

a[i][j] = sc.nextInt();

boolean isUpperTriangular = true;

for (int i = 1; i < s; i++) {

for (int j = 0; j < i; j++) {

if (a[i][j] != 0) {

isUpperTriangular = false;

break;

if (!isUpperTriangular) break;

System.out.println((isUpperTriangular)?"The matrix is an upper triangular matrix.":"The matrix


is not an upper triangular matrix.");

}
import java.util.*;

public class WordFrequency {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence: ");

String sen = sc.nextLine();

String[] wrd = sen.split(" ");

System.out.println("WORDS\t\t\tFREQUENCY");

for (int i = 0; i < wrd.length; i++) {

if (wrd[i] == null) {

continue;

int c = 1;

for (int j = i + 1; j < wrd.length; j++) {

if (wrd[i].equalsIgnoreCase(wrd[j])) {

c++;

wrd[j] = null;

System.out.println(wrd[i] + "\t\t\t" + c);

}
import java.util.*;

public class MatrixMultiplication {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter rows and columns for the first and second matrix: ");

int m1 = sc.nextInt(), n1 = sc.nextInt(), m2 = sc.nextInt(), n2 = sc.nextInt();

if (n1 != m2) {

System.out.println("The matrices cannot be multiplied.");

return;

int[][] a = new int[m1][n1], b = new int[m2][n2], c = new int[m1][n2];

System.out.println("Enter first matrix: ");

for (int i = 0; i < m1; i++)

for (int j = 0; j < n1; j++)

a[i][j] = sc.nextInt();

System.out.println("Enter second matrix: ");

for (int i = 0; i < m2; i++)

for (int j = 0; j < n2; j++)

b[i][j] = sc.nextInt();

for (int i = 0; i < m1; i++)

for (int j = 0; j < n2; j++)

for (int k = 0; k < n1; k++)

c[i][j] += a[i][k] * b[k][j];

System.out.println("Product: ");

for (int i = 0; i < m1; i++){

for (int j = 0; j < n2; j++)

{ System.out.print(c[i][j]+ "\t");}

System.out.println();}

}
import java.util.*;

public class ReverseWords {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence: ");

String sentence = sc.nextLine();

String words[] = sentence.split(" ");

String result = "";

for (int j=0;j<words.length;j++) {

String reversedWord = "";

for (int i = words[j].length() - 1; i >= 0; i--) {

reversedWord += words[j].charAt(i);

result += reversedWord + " ";

System.out.println(result.trim());

}
import java.util.*;

public class PalindromeWords {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence: ");

String sentence = sc.nextLine().toUpperCase();

String[] words = sentence.split(" ");

System.out.print("OUTPUT: ");

int c=0;

for (int i=0;i<words.length;i++) {

String wrd=words[i];

int l = 0,r = wrd.length() - 1;

boolean isPalindrome = true;

while (l < r) {

if (wrd.charAt(l) != wrd.charAt(r)) {

isPalindrome = false;break;

l++;

r--;

c++;

if (isPalindrome) {

System.out.print(wrd+" ");

System.out.print((c==0)?"There is no palindromic words.":"\nThe number of palindromic words:


"+(c-1));

}
import java.util.*;

public class AlphabeticalOrder {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence: ");

String sen = sc.nextLine();

String[] wrd = sen.split(" ");

for (int i = 0; i < wrd.length; i++) {

for (int j = i + 1; j < wrd.length; j++) {

if (wrd[i].compareToIgnoreCase(wrd[j]) > 0) {

String temp = wrd[i];

wrd[i] = wrd[j];

wrd[j] = temp;

for (int i = 0; i < wrd.length; i++) {

System.out.print(wrd[i] + " ");

}
import java.util.*;

public class MersenneNumber {

public static void main() {

Scanner sc = new Scanner(System.in);

System.out.print("Enter a number: ");

int num = sc.nextInt();

if (num <= 0) {

System.out.println("INVALID INPUT");System.exit(0);

int n=num+1;

while (n % 2 == 0) {

n /= 2;

System.out.println((n==1)?num+" is a mersenne number.":num+" is not a mersenne number.");

You might also like