Computer Science 12
Computer Science 12
*;
while (!isPrime(num)) {
num++;
a[i][j] = num;
num++;
System.out.println("Prime numbers:");
System.out.print(a[i][j] + "\t\t");
System.out.println();
return true;
}
import java.util.*;
int r = sc.nextInt();
int c = sc.nextInt();
int a = 0, b = 1;
fib[i][j] = a;
int s = a + b;
a = b;
b = s;
System.out.println("Fibonacci series:");
System.out.print(fib[i][j] + "\t\t");
System.out.println();
}
import java.util.*;
}
import java.util.*;
a[i][j] = sc.nextInt();
colSum=0;diagSum1=0;diagSum2=0;sum=0;rowSum=0;
if(diagSum1 != sum||diagSum2 !=
sum||rowSum!=sum||colSum!=sum){System.out.println("The given matrix is not a magic
square");System.exit(0);}
}
import java.util.*;
char ch = word.charAt(i);
if (result.indexOf(ch) == -1) {
result += ch;
}
import java.util.*;
a[i][j] = sc.nextInt();
flag = false;
break;
flag = false;
break;
if (!flag) break;
}
import java.util.*;
int n = sc.nextInt();
if (s.indexOf(Integer.toString(i)) == -1||n<100) {
}
import java.util.*;
int n = sc.nextInt();
arr[i]=temp%10;
temp=temp/10;
while(sum<n){
sum=0;
sum+=arr[i-j];
arr[i]=sum;
i++;
}
import java.util.*;
int r = sc.nextInt();
int c = sc.nextInt();
a[i][j] = sc.nextInt();
t[j][i] = a[i][j];
System.out.print(t[i][j]+" ");
System.out.println();
}
import java.util.Scanner;
int s = sc.nextInt();
a[i][j] = sc.nextInt();
if (a[i][j] != 0) {
isUpperTriangular = false;
break;
if (!isUpperTriangular) break;
}
import java.util.*;
System.out.println("WORDS\t\t\tFREQUENCY");
if (wrd[i] == null) {
continue;
int c = 1;
if (wrd[i].equalsIgnoreCase(wrd[j])) {
c++;
wrd[j] = null;
}
import java.util.*;
System.out.println("Enter rows and columns for the first and second matrix: ");
if (n1 != m2) {
return;
a[i][j] = sc.nextInt();
b[i][j] = sc.nextInt();
System.out.println("Product: ");
{ System.out.print(c[i][j]+ "\t");}
System.out.println();}
}
import java.util.*;
reversedWord += words[j].charAt(i);
System.out.println(result.trim());
}
import java.util.*;
System.out.print("OUTPUT: ");
int c=0;
String wrd=words[i];
while (l < r) {
if (wrd.charAt(l) != wrd.charAt(r)) {
isPalindrome = false;break;
l++;
r--;
c++;
if (isPalindrome) {
System.out.print(wrd+" ");
}
import java.util.*;
if (wrd[i].compareToIgnoreCase(wrd[j]) > 0) {
wrd[i] = wrd[j];
wrd[j] = temp;
}
import java.util.*;
if (num <= 0) {
System.out.println("INVALID INPUT");System.exit(0);
int n=num+1;
while (n % 2 == 0) {
n /= 2;