STRING HANDLING

import java.util.*;

public class Pg289_1

public static void main()

Scanner in=new Scanner(System.in);

String x;

int i,cnt1=0,cnt2=0;

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

x=in.nextLine();

for(i=0;i<x.length();i++)

if(Character.isWhitespace(x.charAt(i)))

cnt1++;

else

cnt2++;

System.out.println("No. of words : "+ ++cnt1);

System.out.println("No. of Letters : "+ cnt2);

import java.util.*;

public class Pg289_2

public static void main()

1
 Scanner in=new Scanner(System.in);

String x,y="";

char z;

int i;

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

x=in.nextLine().toLowerCase();

for(i=0;i<x.length();i++)

z=x.charAt(i);

if(z!='a'&&z!='e'&&z!='i'&&z!='o'&&z!='u')

y=y+z;

System.out.println("Word without vowel : "+y);

import java.util.*;

public class Pg290_3

public static void main()

Scanner in=new Scanner(System.in);

String x,y="";

char z;

int i;

System.out.print("Enter your full name : ");

x=in.nextLine().toUpperCase();

2
 z=x.charAt(0);

y=y+z;

for(i=1;i<x.length();i++)

z=x.charAt(i);

if(Character.isWhitespace(z))

y=y+" "+x.charAt(i+1);

System.out.println("Initial : "+y);

import java.util.*;

public class Pg290_4

public static void main()

Scanner in=new Scanner(System.in);

String x,y="";

char z;

int i,pos;

System.out.print("Enter your full name : ");

x=in.nextLine().toUpperCase();

pos=x.lastIndexOf(" ");

y=x.substring(pos+1);

y=y+" "+x.substring(0,pos);

3
 System.out.println("Name : "+y);

import java.util.*;

public class Pg290_5

public static void main()

Scanner in=new Scanner(System.in);

String x,y="",z="";

char c;

int i,pos,len=0,max=0;

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

x=in.nextLine().toUpperCase();

x=x+" ";

for(i=0;i<x.length();i++)

c=x.charAt(i);

if (c!= ' ')

y=y+c;

else

len=y.length();

System.out.println("Length :"+len+"\tWord : "+y);

if (len>max)

max=len;

4
 z=y;

y="";

System.out.println("\nLongest Word : "+z+"\tLength :"+max);

import java.util.*;

public class Pg290_6

public static void main()

Scanner in=new Scanner(System.in);

String x;

char z;

int i;

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

x=in.next();

for(i=0;i<x.length();i++)

z=x.charAt(i);

System.out.println("ASCII of "+z+" = "+(int)z);

5
import java.util.*;

public class Pg290_7

public static void main()

Scanner in=new Scanner(System.in);

String x,y="";

char z;

int i;

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

x=in.nextLine().toUpperCase();

for(i=0;i<x.length();i++)

z=x.charAt(i);

if(z=='A'||z=='E'||z=='I'||z=='O'||z=='U')

y=y+"*";

else

y=y+z;

System.out.println("Output : "+y);

import java.util.*;

public class Pg290_8

public static void main()

6
 Scanner in=new Scanner(System.in);

String x,y="";

char z;

int i;

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

x=in.nextLine();

z=x.charAt(0);

y=y+z;

for(i=1;i<x.length();i++)

z=x.charAt(i);

if(Character.isWhitespace(z))

y=y+x.charAt(i+1);

System.out.println("SHORT FORM : "+y);

import java.util.*;

public class Pg290_9

public static void main()

Scanner in=new Scanner(System.in);

String x,x1="",y="";

char z,c;

int i,j,pos;

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

7
 x=in.nextLine()+" ";

for(i=0;i<x.length();i++)

c=x.charAt(i);

if(c!=' ')

x1=x1+c;

else

y="";

for(j=x1.length()-1;j>=0;j--)

z=x1.charAt(j);

y=y+z;

if(x1.equalsIgnoreCase(y))

System.out.println(x1+" is a Palindrome");

x1="";

import java.util.*;

public class Pg290_10

public static void main()

Scanner in=new Scanner(System.in);

String x,y;

int i,pos;

8
 System.out.print("Enter a sentence : ");

x=" "+in.nextLine();

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

for(i=x.length()-1;i>=0;)

pos=x.lastIndexOf(" ",i);

y=x.substring(pos,i+1);

i=pos-1;

System.out.print(y);

import java.util.*;

public class Pg290_11

public static void main()

Scanner in=new Scanner(System.in);

String x,y="",max_word="";

char z,c;

int i,j,pos,max=0,cnt;

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

x=in.nextLine().toUpperCase()+" ";

for(i=0;i<x.length();i++)

c=x.charAt(i);

9
 if(c!=' ')

y=y+c;

else

cnt=0;

for(j=0;j<y.length();j++)

z=y.charAt(j);

if(z=='A'||z=='E'||z=='I'||z=='O'||z=='U')

cnt++;

if(cnt>max)

max=cnt;

max_word=y;

y="";

System.out.println("The word with maximum no. of vowels : "+max_word);

import java.util.*;

public class Pg290_12

public static void main()

String x="Blue bottle is in Blue bag lying on Blue carpet ",y="",z="";

10
 char c;

int i,j;

for(i=0;i<x.length();i++)

c=x.charAt(i);

if(c!=' ')

z=z+c;

else

if(z.equalsIgnoreCase("BLUE"))

y=y+"Red ";

else

y=y+z+" ";

z="";

System.out.println("Given Sentence : "+x);

System.out.println("After Replace : "+y);

import java.util.*;

public class Pg290_13

public static void main()

Scanner in=new Scanner(System.in);

String x,y="";

char z;

11
 int i;

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

x=in.next().toLowerCase();

for(i=0;i<x.length();i++)

z=x.charAt(i);

if(z=='a'||z=='e'||z=='i'||z=='o'||z=='u')

x=x.replace(z,(char)(1+z));

System.out.println("Output : "+x);

import java.util.*;

public class Pg291_14

public static void main()

Scanner in=new Scanner(System.in);

String x,y="";

char z,c;

int i;

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

x=in.nextLine().toUpperCase();

for(i=0;i<x.length();i++)

12
 z=x.charAt(i);

if(z!='A'&&z!='E'&&z!='I'&&z!='O'&&z!='U')

c=(char)(z-1);

if(c=='A'||c=='E'||c=='I'||c=='O'||c=='U')

y=y+(char)(z+1);

else

y=y+c;

else y=y+z;

System.out.println("Output : "+y);

import java.util.*;

public class Pg291_15

public static void main()

Scanner in=new Scanner(System.in);

String x,y="";

int i,n1,n2,r,s;

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

x=in.next().toUpperCase();

System.out.println("X = "+x);

for(i=0;i<x.length();i++)

13
 y=y+(int)(x.charAt(i)-64);

System.out.println("Converted to No. : "+y);

n1=Integer.parseInt(y);

n2=n1;

while(n1>9)

s=0;

while(n1>0)

r=n1%10;

s=s+r*r;

n1=n1/10;

n1=s;

System.out.println("N1 = "+n1);

if(n1==1)

System.out.println("Given word is a Happy Word");

else

System.out.println("Given word is not a Happy Word");

import java.util.*;

public class Pg291_16

public static void main()

14
 {

Scanner in=new Scanner(System.in);

String x;

char i;

int j,cnt;

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

x=in.nextLine().toUpperCase();

System.out.println("===================");

System.out.println("Character Frequency");

System.out.println("===================");

for(i='A';i<='Z';i++)

cnt=0;

for(j=0;j<x.length();j++)

if(i==x.charAt(j))

cnt++;

if(cnt>0)

System.out.println(" "+i+" "+cnt);

import java.util.*;

public class Pg291_17

public static void main()

Scanner in=new Scanner(System.in);

15
 String x;

int i,cnt=0;

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

x=in.nextLine().toUpperCase()+" ";

for(i=0;i<x.length()-1;i++)

if(x.charAt(i)==x.charAt(i+1))

cnt++;

i++;

System.out.println("No. of double letter sequences : "+cnt);

import java.util.*;

public class Pg291_18

public static void main()

Scanner in=new Scanner(System.in);

String x,y="";

int i,j;

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

x=in.next();

16
 for(i=x.length()-1;i>=0;i--)

y=y+x.charAt(i);

System.out.println("Reversed String : "+y);

if(x.charAt(0)==x.charAt(x.length()-1))

if(x.equalsIgnoreCase(y))

System.out.println("Given word is a Palindrome & Special word");

else

System.out.println("Given word is not a Palindrome but a Special word");

else System.out.println("Given word is neither a Palindrome nor a Special word");

import java.util.*;

public class Pg291_19

public static void main()

Scanner in=new Scanner(System.in);

String x,y="";

char c;

int i,j,cnt=0;

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

x=in.nextLine().toUpperCase()+" ";

for(i=0;i<x.length();i++)

17
 c=x.charAt(i);

if(c!=' ')

y=y+c;

else

for(j=0;j<y.length()-1;j++)

if((1+y.charAt(j))==y.charAt(j+1))

System.out.println(y);

cnt++;

y="";

System.out.println("No. of words containing consecutive letters : "+cnt);

import java.util.*;

public class Pg292_20

public static void main()

Scanner in=new Scanner(System.in);

String x;

int i,j;

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

x=in.next().toUpperCase();

18
 System.out.println("\n\nPattern 1");

for(i=x.length()-1;i>=0;i--)

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

System.out.print(x.charAt(j)+" ");

System.out.println();

System.out.println("\n\nPattern 2");

for(i=x.length()-1;i>=0;i--)

for(j=x.length()-1;j>=i;j--)

System.out.print(x.charAt(i)+" ");

System.out.println();

System.out.println("\n\nPattern 3");

for(i=x.length()-1;i>=0;i--)

for(j=x.length()-1-i;j<x.length();j++)

System.out.print(x.charAt(j)+" ");

System.out.println();

public class Pg292_21

public static void main()

19
char x,y;

int i,j;

System.out.println("\n\nPattern 1");

y='A';

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

x=y;

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

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

y++;

System.out.println();

System.out.println("\n\nPattern 2");

x='A';

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

for(j=1;j<=i;j++)

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

System.out.println();

System.out.println("\n\nPattern 3");

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

x='A';

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

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

x='A';

for(j=2;j<=i;j++)

20
 System.out.print(x++ +" ");

System.out.println();

import java.util.*;

public class Pg292_22

public static void main()

Scanner in=new Scanner(System.in);

char x='*';

int i,j,ch,n;

System.out.println("1. Triangle");

System.out.println("2. Inverted Triangle");

System.out.println("Enter your choice : ");

ch=in.nextInt();

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

n=in.nextInt();

switch(ch)

case 1:

System.out.println("\n\nPattern 1");

for(i=1;i<=n;i++)

for(j=2;j<=i;j++)

System.out.print(" ");

21
 for(j=i;j<=n;j++)

System.out.print(x);

System.out.println();

break;

case 2:

System.out.println("\n\nPattern 2");

for(i=1;i<=n;i++)

x='A';

for(j=i;j<=n;j++)

System.out.print(x++);

System.out.println();

break;

default: System.out.println("Invalid Choice");

import java.util.*;

public class Pg292_23

public static void main()

Scanner in=new Scanner(System.in);

String x="BLUEJ";

int i,j,ch;

System.out.println("1. Triangle");

System.out.println("2. Inverted Triangle");

22
 System.out.println("Enter your choice : ");

ch=in.nextInt();

switch(ch)

case 1:

System.out.println("\n\nPattern 1");

for(i=0;i<x.length();i++)

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

System.out.print(x.charAt(i)+" ");

System.out.println();

break;

case 2:

System.out.println("\n\nPattern 2");

for(i=0;i<x.length();i++)

for(j=0;j<x.length()-i;j++)

System.out.print(x.charAt(j)+" ");

System.out.println();

break;

default: System.out.println("Invalid Choice");

23
import java.util.*;

public class Pg292_24

public static void main()

Scanner in=new Scanner(System.in);

String x="ICSE";

int i,j,ch,n=1;

System.out.println("1. Floyd's Triangle");

System.out.println("2. Triangle");

System.out.println("Enter your choice : ");

ch=in.nextInt();

switch(ch)

case 1:

System.out.println("\n\nPattern 1");

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

for(j=1;j<=i;j++)

System.out.print(n++);

System.out.println();

break;

case 2:

System.out.println("\n\nPattern 2");

for(i=0;i<x.length();i++)

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

System.out.print(x.charAt(j)+" ");

24
 System.out.println();

break;

default: System.out.println("Invalid Choice");

public class Pg293_25

public static void main()

String
country[]={"Brazil","China","England","France","Germany","India","Iraq","Jamaica","UK","USA"};

String capital[]={"Brasilia","Beijing","London","Paris","Berlin","New
Delhi","Badhdad","Kingston","London","Washington D.C."};

char c;

int i;

System.out.println("\n\n Country Names that starts with vowel");

System.out.println(" ------------------------------------");

System.out.println("\n Country Names Capital");

for(i=0;i<country.length;i++)

c=country[i].toUpperCase().charAt(0);

if(c=='A'||c=='E'||c=='I'||c=='O'||c=='U')

System.out.println("\t"+country[i]+"\t\t\t"+capital[i]);

25
import java.util.*;

public class Pg293_26

public static void main()

Scanner in=new Scanner(System.in);

int i,j,n=10,min_p;

char x;

String min_v,t;

String a[]={"A2","A3","A1","D4","A5","F7","A6","B10","A9","A8"};

String
b[]={"9898000002","9898000003","9898000001","9898000004","9898000005","9898000007","989
8000006","9898000010","9898000009","9898000008"};

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

x=in.next().charAt(0);

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

min_v=a[i];

min_p=i;

for(j=i+1;j<n;j++)

if(a[j].compareTo(min_v)<0)

min_v=a[j];

min_p=j;

t=a[i];

a[i]=min_v;

a[min_p]=t;

26
 t=b[i];

b[i]=b[min_p];

b[min_p]=t;

System.out.println("Output");

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

if(a[i].charAt(0)==x)

System.out.println(a[i]+"\t"+b[i]);

import java.util.*;

public class Pg293_27

public static void main()

Scanner in=new Scanner(System.in);

int i,j,n;

String t;

String a[]=new String[20];

String b[]=new String[20];

System.out.print("Enter n : ");

n=in.nextInt();

System.out.print("Enter the Array values : ");

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

a[i]=in.next().toUpperCase();

b[i]=a[i];

27
 }

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

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

if(a[j+1].compareTo(a[j])<0)

t=a[j];

a[j]=a[j+1];

a[j+1]=t;

System.out.println("Input Sorted Array");

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

System.out.println(b[i]+"\t "+a[i]);

import java.util.*;

public class Pg293_28

public static void main()

Scanner in=new Scanner(System.in);

int i,n=10;

String a[]=new String[n];

char x,y;

28
 System.out.println("Enter city names");

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

a[i]=in.next().toUpperCase();

System.out.println("Output");

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

x=a[i].charAt(0);

y=a[i].charAt(a[i].length()-1);

if(x!='A'&&x!='E'&&x!='I'&&x!='O'&&x!='U')

if(y=='A'||y=='E'||y=='I'||y=='O'||y=='U')

System.out.println(a[i]);

import java.util.*;

public class Pg293_29

public static void main()

Scanner in=new Scanner(System.in);

int i,j,n=5;

String x[]=new String[n];

String y;

System.out.print("Enter words");

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

29
 x[i]=in.next().toUpperCase();

System.out.println("\n\nPalindrome Words\n");

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

y="";

for(j=x[i].length()-1;j>=0;j--)

y=y+x[i].charAt(j);

if(x[i].equalsIgnoreCase(y))

System.out.println(x[i]);

import java.util.*;

public class Pg292_30

public static void main()

Scanner in=new Scanner(System.in);

int i,j,n=3;

String a[]=new String[n];

String b[]=new String[n];

String x,y="",z="";

boolean flag=false;

System.out.print("Enter cities and STD");

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

30
 a[i]=in.next();

b[i]=in.next();

System.out.print("Enter city name to search : ");

x=in.next();

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

if(a[i].equalsIgnoreCase(x))

flag=true;

y=a[i];

z=b[i];

break;

if(flag)

System.out.println("Search Successful");

System.out.println(y+" "+z);

else System.out.println("Search unsuccessful, no such city in the list");

31