PROGRAM 1 :- LetterSeq

import [Link];

class LetterSeq

public static void main(String args[])

Scanner in = new Scanner([Link]);

[Link]("Enter string: ");

String s = [Link]();

String str = [Link]();

int count = 0;

int len = [Link]();

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

if ([Link](i) == [Link](i + 1))

count++;

[Link]("Double Letter Sequence Count = " + count);

}
 PROGRAM 2 :- Q3

import [Link];

class Q3

public static void main(String args[])

int a[]=new int[10], i,ln=0,lnp=0,sn=0,snp=0;

Scanner sc=new Scanner([Link]);

[Link]("Enter 10 numbers");

for(i=0; i<10; i++)

a[i]=[Link]();

for(i=0; i<10; i++)

if(i==0)

ln=a[i];

sn=a[i];

lnp=i;

snp=i;

else if(a[i]>ln)

ln=a[i];

lnp=i;

else if(a[i]<sn)
 {

sn=a[i];

snp=i;

a[lnp]=sn;

a[snp]=ln;

[Link]("\nArray after interchanging largest with the smallest");

for(i=0; i<10; i++)

[Link](a[i]+" ");

}
 PROGRAM 3 :- Q8

import [Link];

public class Q8

public static void main(String args[])

int a[]=new int[10], i,t;

Scanner sc=new Scanner([Link]);

[Link]("Enter 10 numbers");

for(i=0; i<10; i++)

a[i]=[Link]();

for(i=0; i<10; i=i+2)

t=a[i];

a[i]=a[i+1];

a[i+1]=t;

[Link]("\nModified array after interchanging the consecutive numbers");

for(i=0; i<10; i++)

[Link](a[i]+" ");

}
 PROGRAM 4 :- StdCodes

import [Link];

public class StdCodes

public static void main(String args[]) {

final int SIZE = 10;

Scanner in = new Scanner([Link]);

String cities[] = new String[SIZE];

String stdCodes[] = new String[SIZE];

[Link]("Enter " + SIZE +

" cities and their STD codes:");

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

[Link]("Enter City Name: ");

cities[i] = [Link]();

[Link]("Enter its STD Code: ");

stdCodes[i] = [Link]();

[Link]("Enter name of city to search: ");

String city = [Link]();

int idx;

for (idx = 0; idx < SIZE; idx++) {

if ([Link](cities[idx]) == 0) {

break;

if (idx < SIZE) {

[Link]("City: " + cities[idx]);

[Link]("STD Code: " + stdCodes[idx]);

else {

[Link]("Search Unsuccessful");

}
 PROGRAM 5 :- P6

import [Link];

class P6

public static void main(String args[]) {

Scanner in = new Scanner([Link]);

int P[] = new int[6];

int Q[] = new int[4];

int R[] = new int[10];

int i = 0;

[Link]("Enter 6 elements of array P:");

for (i = 0; i < [Link]; i++) {

P[i] = [Link]();

[Link]("Enter 4 elements of array Q:");

for (i = 0; i < [Link]; i++) {

Q[i] = [Link]();

i = 0;

while(i < [Link]) {

R[i] = P[i];

i++;

int j = 0;
 while(j < [Link]) {

R[i++] = Q[j++];

[Link]("Elements of Array R:");

for (i = 0; i < [Link]; i++) {

[Link](R[i] + " ");

}
 PROGRAM 6 :- P7

import [Link].*;

class P7

public static void main(String args[])

Scanner sc = new Scanner([Link]);

int a[][] = new int[5][5];

int i,j,max=0,min=0;

[Link]("enter 25 numbers:");

for(i=0;i<5;i++)

for(j=0;j<5;j++)

a[i][j]=[Link]();

for(i=0;i<5;i++)

for(j=0;j<5;j++)

if(i==0 && j==0)

max=min=a[i][j];

if(a[i][j]>max)

max=a[i][j];

if(a[i][j]<min)

min=a[i][j];

}
 [Link]("Largest number: "+max);

[Link]("Smallest number: "+min);

}
 PROGRAM 7 :- diagonaldisplay

import [Link].*;

class diagonaldisplay

public static void main(String args[])

Scanner sc = new Scanner([Link]);

int n[][] = new int[5][5];

int i,j,s;

[Link]("Enter numbers in array:");

for(i=0;i<5;i++)

for(j=0;j<5;j++)

n[i][j]=[Link]();

[Link]("Elements of array:");

for(i=0;i<5;i++)

for(j=0;j<5;j++)

[Link](n[i][j]+"\t");

[Link]();

int ld1 = n[0][0], sd1 = n[0][0];

int ld2 = n[0][0], sd2 = n[0][4];

for(i=0;i<5;i++)

for(j=0;j<5;j++)
 {

if(i==j)

if(n[i][j]>ld1)

ld1=n[i][j];

if(n[i][j]<sd1)

sd1=n[i][j];

if(i+j==4)

if(n[i][j]>ld2)

ld2=n[i][j];

if(n[i][j]<sd2)

sd2=n[i][j];

[Link]("Largest number of diagonal 1 : "+ld1);

[Link]("Smallest number of diagonal 1 : "+sd1);

[Link]("Largest number of diagonal 2 : "+ld2);

[Link]("Smallest number of diagonal 2 : "+sd2);

}
 PROGRAM 8 :- SelectionSort

import [Link];

class SelectionSort

public static void main(String args[]) {

Scanner in = new Scanner([Link]);

double weightArr[] = new double[10];

[Link]("Enter weights of 10 people: ");

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

weightArr[i] = [Link]();

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

int idx = i;

for (int j = i + 1; j < 10; j++) {

if (weightArr[j] > weightArr[idx])

idx = j;

double t = weightArr[i];

weightArr[i] = weightArr[idx];

weightArr[idx] = t;

[Link]("Sorted Weights Array:");

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

[Link](weightArr[i] + " ");

}
 PROGRAM 9 :- BubbleSortDsc
import [Link];

class BubbleSortDsc

public static void main(String args[]) {

Scanner in = new Scanner([Link]);

int n = 10;

int arr[] = new int[n];

[Link]("Enter the elements of the array:");

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

arr[i] = [Link]();

//Bubble Sort

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

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

if (arr[j] < arr[j + 1]) {

int t = arr[j];

arr[j] = arr[j+1];

arr[j+1] = t;

[Link]("Sorted Array:");

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

[Link](arr[i] + " ");

}
 PROGRAM 10 :- Rearrange

import [Link].*;

import [Link].*;

class Rearrange

private String wrd;

private String newwrd;

public Rearrange()

wrd =new String();

newwrd = new String();

public void readword() throws IOException

Scanner sc=new Scanner([Link]);

[Link]("Enter the words: ");

wrd=[Link]();

public void freq_vow_con()

wrd=[Link]();

int v=0;

int c=0;

for(int i=0;i<[Link]();i++)

char ch=[Link](i);

if ( [Link](ch))

switch (ch)

case 'A':
 case 'E':

case 'I':

case 'O':

case 'U':

v++;

break;

default:

c++;

[Link]("Frequency of vowels: "+v);

[Link]("Frequency of consonants: "+c);

public void arrange()

String v=new String();

String c=new String();

wrd = [Link]();

for(int i=0;i<[Link]();i++)

char ch=[Link](i);

if ( [Link](ch))

switch (ch)

case 'A':

case 'E':

case 'I':

case 'O':

case 'U':
 v+=ch;

break;

default:

c+=ch;

newwrd=v+c;

public void display()

[Link]("Original word: "+wrd);

[Link]("Rearranged word: "+newwrd);

public static void main(String []args) throws IOException

Rearrange obj=new Rearrange();

[Link]();

obj.freq_vow_con();

[Link]();

[Link]();

}
 PROGRAM 11 :- ArmNum

import [Link].*;

import [Link].*;

class ArmNum

static int n;

static int l;

public ArmNum(int num)

n=num;

l=0;

for(int i=n;i!=0;i/=10)

l++;

public int sumPow(int i)

if(i<10)

return (int)[Link](i,1);

return (int)[Link](i%10,1)+ sumPow(i/10);

public void isArmstrong()

if(n==sumPow(n))

[Link](n+"is an Armstrong Number");

else

[Link](n+"is not an Armstrong Number");

public static void main(String []args)throws IOException

Scanner sc=new Scanner([Link]);

[Link]("N=");
 int num=[Link]();

ArmNum obj=new ArmNum(num);

[Link]();

}
 PROGRAM 12 :- Perfect

import [Link].*;

import [Link].*;

class Perfect

private int num;

private int f;

public Perfect(int num)

[Link]=num;

f=1;

public int sumOfFactors(int i)

if(i==f)

return 0;

else if(i%f==0)

return f++ + sumOfFactors(i);

else

f++;

return sumOfFactors(i);

public void check()

if (num==sumOfFactors(num))
 {

[Link](num+"is a perfect number");

else

[Link](num+"Not a perfect number");

public static void main (String []args) throws IOException

Scanner sc=new Scanner ([Link]);

[Link]("Enter the number:");

int n=[Link]();

Perfect obj= new Perfect(n);

[Link]();

}
 PROGRAM 13 :- Palin

import [Link].*;

import [Link].*;

class Palin

int num;

int revnum;

Palin()

num=0;

revnum=0;

void accept() throws IOException

Scanner sc=new Scanner ([Link]);

[Link]("Enter the number:");

String a=[Link]();

num=[Link](a);

int reverse(int y)

int len=(y+"").length();

if(len==1)

return y;

else

return (((y%10)*(int)[Link](10,len-1))+reverse(y/10));

}
 void check()

revnum=reverse(num);

if(num==revnum)

[Link]("/n Number is palindrome");

else

[Link]("/n Number is not palindrome");

public static void main (String args[]) throws IOException

Palin p=new Palin();

[Link]();

[Link]();

}
 PROGRAM 14 :- SwapSort
import [Link].*;

import [Link].*;

class SwapSort

String wrd;

int len;

String swapwrd;

String sortwrd;

SwapSort()

wrd="";

len=0;

swapwrd="";

sortwrd="";

void readword() throws IOException

Scanner sc=new Scanner ([Link]);

[Link]("Enter word: ");

wrd=[Link]();

void swapwrd()

String w=wrd;

swapwrd=[Link]([Link]()-1)+[Link](1,[Link]()-1)+[Link](0);

void sortwrd()

String w=wrd;

char[] charArray=[Link]();

int length=[Link];

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

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

if(charArray[j]<charArray[i])

char temp=charArray[i];

charArray[i]=charArray[j];

charArray[j]=temp;

for(char c:charArray)

sortwrd=sortwrd+c;

void display()

[Link]("Original word: "+wrd);

[Link]("Swapped word: "+swapwrd);

[Link]("Sorted Array: "+sortwrd);

public static void main(String []args) throws IOException

SwapSort obj=new SwapSort();

[Link]();

[Link]();

[Link]();

[Link]();

}
 PROGRAM 15 :- Disarium

import [Link].*;

import [Link].*;

class Disarium

public static void main (String []args)

Scanner sc=new Scanner([Link]);

[Link]("Enter a number: ");

int n=[Link]();

int copy=n,d=0,sum=0;

String s=[Link](n);

int len=[Link]();

while(copy>0)

d=copy%10;

sum=sum+(int)[Link](d,len);

len--;

copy=copy/10;

if (sum==n)

[Link]("Is a disarium number");

else

[Link]("Is not a disarium number");