PRIME ADAM

import java.util.*;
class prime_adam
{
int reverse(int num)
{
int rev=0;
while (num!=0)
{
int d=num%10;
rev=rev*10+d;
num/=10;
}
return rev;
}

boolean isAdam(int num)

{
int sq= num*num;
int revNum= reverse(num);
int sqrev= revNum*revNum;
int revsqrev=reverse(sqrev);
return revsqrev == sq;
}

boolean isPrime(int num)

{
int c=0;
for(int i=1; i<=num;i++)
{
if(num%i==0)
c++;
}
return c==2;
}

public void disp()

{
Scanner xx = new Scanner(System.in);
System.out.println("Enter the value of m");
int m= xx.nextInt();
System.out.println("Enter the value of n");
int n = xx.nextInt();

int count=0;
if(m>=n)
{
System.out.println("INVALID INPUT");
System.exit(0);
}

System.out.println("THE PRIME ADAM INTEGERS ARE ");

for(int i=m; i<=n; i++)
{
boolean adam = isAdam(i);
if(adam)
{
boolean prime = isPrime(i);
if(prime)
{
System.out.println(i+" ");
count++;
 }
}
}

if (count==0)
System.out.println("NIL");

System.out.println("FREQUENCY OF PRIME ADAM INTEGERS IS "+count);

}

ARRANGE WORD
import java.util.*;
class arrangeword
{
int c;
public void disp(String s)
{
int i=0; String temp=" ";
StringTokenizer st= new StringTokenizer(s,"?,.! ");
c=st.countTokens();
String a[]= new String[c];
while(st.hasMoreTokens())
{
a[i]=st.nextToken();
i++;
}
for( i=0;i<c;i++)
{
for(int j=0;j<c-1-i;j++)
{
if(a[j].length()>a[j+1].length())
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
if(a[j].length()==a[j+1].length())
{
if(a[j].compareTo(a[j+1])>0)
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
for(i=0;i<c;i++)
{
System.out.print(a[i]+" ");
}
}
}
CIRCULAR PRIME
import java.util.Scanner;
public class CircularPrime
{
public static boolean isPrime(int num) {
int c = 0;
 for (int i = 1; i <= num; i++) {
if (num % i == 0) {
c++;
}
}

return c == 2;
}

public static int getDigitCount(int num) {

int c = 0;

while (num != 0) {
c++;
num /= 10;
}

return c;
}

public static void main(String args[]) {

Scanner in = new Scanner(System.in);
System.out.print("ENTER INTEGER TO CHECK (N): ");
int n = in.nextInt();

if (n <= 0) {
System.out.println("INVALID INPUT");
return;
}

boolean isCircularPrime = true;

if (isPrime(n)) {
System.out.println(n);
int digitCount = getDigitCount(n);
int divisor = (int)(Math.pow(10, digitCount - 1));
int n2 = n;
for (int i = 1; i < digitCount; i++) {
int t1 = n2 / divisor;
int t2 = n2 % divisor;
n2 = t2 * 10 + t1;
System.out.println(n2);
if (!isPrime(n2)) {
isCircularPrime = false;
break;
}
}
}
else {
isCircularPrime = false;
}

if (isCircularPrime) {
System.out.println(n + " IS A CIRCULAR PRIME.");
}
else {
System.out.println(n + " IS NOT A CIRCULAR PRIME.");
}

}
}
MATRIX SORTING

import java.util.Scanner;
public class MatrixSort
{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.print("ENTER MATRIX SIZE (M): ");
int m = in.nextInt();

if (m <= 3 || m >= 10) {

System.out.println("THE MATRIX SIZE IS OUT OF RANGE.");
return;
}

int a[][] = new int[m][m];

System.out.println("ENTER ELEMENTS OF MATRIX");

for (int i = 0; i < m; i++) {
System.out.println("ENTER ROW " + (i+1) + ":");
for (int j = 0; j < m; j++) {
a[i][j] = in.nextInt();
/* * Only positive integers * should be enetered */
if (a[i][j] < 0) {
System.out.println("INVALID INPUT");
return;
}
}
}

System.out.println("ORIGINAL MATRIX");
printMatrix(a, m);

sortNonBoundaryMatrix(a, m);
System.out.println("REARRANGED MATRIX");
printMatrix(a, m);

computePrintDiagonalSum(a, m);
}

public static void sortNonBoundaryMatrix(int a[][], int m) {

int b[] = new int[(m - 2) * (m - 2)];
int k = 0;
for (int i = 1; i < m - 1; i++) {
for (int j = 1; j < m - 1; j++) {
b[k++] = a[i][j];
}
}

for (int i = 0; i < k - 1; i++) {

for (int j = 0; j < k - i - 1; j++) {
if (b[j] > b[j + 1]) {
int t = b[j];
b[j] = b[j+1];
b[j+1] = t;
}
}
}

k = 0;
for (int i = 1; i < m - 1; i++) {
for (int j = 1; j < m - 1; j++) {
 a[i][j] = b[k++];
}
}
}

public static void computePrintDiagonalSum(int a[][], int m) {

int sum = 0;
System.out.println("DIAGONAL ELEMENTS");
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (i == j || i + j == m - 1) {
sum += a[i][j];
System.out.print(a[i][j] + "\t");
}
else {
System.out.print("\t");
}
}
System.out.println();
}
System.out.println("SUM OF THE DIAGONAL ELEMENTS = " + sum);
}

public static void printMatrix(int a[][], int m) {

for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
System.out.print(a[i][j] + "\t");
}
System.out.println();
}
}
}
ANAMIKA SUSAN
import java.util.*;
public class VowelWord
{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.println("ENTER THE SENTENCE:");
String ipStr = in.nextLine().trim().toUpperCase();
int len = ipStr.length();

char lastChar = ipStr.charAt(len - 1);

if (lastChar != '.'
&& lastChar != '?'
&& lastChar != '!') {
System.out.println("INVALID INPUT");
return;
}

String str = ipStr.substring(0, len - 1);

StringTokenizer st = new StringTokenizer(str);

StringBuffer sbVowel = new StringBuffer();
StringBuffer sb = new StringBuffer();
int c = 0;

while (st.hasMoreTokens()) {
String word = st.nextToken();
int wordLen = word.length();
if (isVowel(word.charAt(0))
&& isVowel(word.charAt(wordLen - 1))) {
 c++;
sbVowel.append(word);
sbVowel.append(" ");
}
else {
sb.append(word);
sb.append(" ");
}
}

String newStr = sbVowel.toString() + sb.toString();

System.out.println("NUMBER OF WORDS BEGINNING AND ENDING WITH A VOWEL = " + c);

System.out.println(newStr);
}

public static boolean isVowel(char ch) {

ch = Character.toUpperCase(ch);
boolean ret = false;
if (ch == 'A'
|| ch == 'E'
|| ch == 'I'
|| ch == 'O'
|| ch == 'U')
ret = true;

return ret;
}
}

QUIZ
import java.util.Scanner;
public class QuizCompetition
{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.print("Enter the Number of Participants (N): ");
int n = in.nextInt();

if (n <= 3 || n >= 11) {

System.out.println("INPUT SIZE OUT OF RANGE.");
return;
}

char answers[][] = new char[n][5];

char key[] = new char[5];

System.out.println("Enter answers of participants");

for (int i = 0; i < n; i++) {
System.out.println("Participant " + (i+1));
for (int j = 0; j < 5; j++) {
answers[i][j] = in.next().charAt(0);
}
}

System.out.println("Enter Answer Key:");

for (int i = 0; i < 5; i++) {
key[i] = in.next().charAt(0);
}

int hScore = 0;
 int score[] = new int[n];

System.out.println("Scores:");
for (int i = 0; i < n; i++) {
for (int j = 0; j < 5; j++) {
if (answers[i][j] == key[j]) {
score[i]++;
}
}

if (score[i] > hScore) {

hScore = score[i];
}

System.out.println("Participant " + (i+1) + " = " + score[i]);

}

System.out.println("Highest Score:");
for (int i = 0; i < n; i++) {
if (score[i] == hScore) {
System.out.println("Participant " + (i+1));
}
}
}
}
CAESAR CIPHER
import java.util.Scanner;
public class CaesarCipher
{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.println("Enter plain text:");
String str = in.nextLine();
int len = str.length();

if (len <= 3 || len >= 100) {

System.out.println("INVALID LENGTH");
return;
}

StringBuffer sb = new StringBuffer();

for (int i = 0; i < len; i++) {
char ch = str.charAt(i);
if ((ch >= 'A' && ch <= 'M') || (ch >= 'a' && ch <= 'm')) {
sb.append((char)(ch + 13));
}
else if ((ch >= 'N' && ch <= 'Z') || (ch >= 'n' && ch <= 'z')) {
sb.append((char)(ch - 13));
}
else {
sb.append(ch);
}
}

String cipher = sb.toString();

System.out.println("The cipher text is:");
System.out.println(cipher);
}
}

BANNER
import java.util.Scanner;
else {
System.out.print(teams[j].charAt(i) + "\t");
}
}
System.out.println();
}
}
public class Banner
{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.print("ENTER THE VALUE OF N: ");
int n = in.nextInt();
in.nextLine();

if (n <= 2 || n >= 9) {
System.out.println("INVALID INPUT");
return;
}

String teams[] = new String[n];

int highLen = 0;

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

System.out.print("Team " + (i+1) + ": ");
teams[i] = in.nextLine();
if (teams[i].length() > highLen) {
highLen = teams[i].length();
}
}

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

for (int j = 0; j < n; j++) {
int len = teams[j].length();
if (i >= len) {
System.out.print(" \t");
}