0% found this document useful (0 votes)
7K views18 pages

10 ICSE APC Computer Applications Chapter 2 Library Classes UNSOLVED PROGRAMS SOLUTIONS

The document contains 19 Java programs that perform various string and character operations: 1. The first program counts the number of words and letters in a sentence. 2. The second program removes all vowels from an input string. 3. The third program displays the initials of words in a 3-word sentence. 4. The programs demonstrate various techniques like replacing substrings, finding the longest word, reversing strings, checking for palindromes, and counting characters.

Uploaded by

Rajat Bhatti
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)
7K views18 pages

10 ICSE APC Computer Applications Chapter 2 Library Classes UNSOLVED PROGRAMS SOLUTIONS

The document contains 19 Java programs that perform various string and character operations: 1. The first program counts the number of words and letters in a sentence. 2. The second program removes all vowels from an input string. 3. The third program displays the initials of words in a 3-word sentence. 4. The programs demonstrate various techniques like replacing substrings, finding the longest word, reversing strings, checking for palindromes, and counting characters.

Uploaded by

Rajat Bhatti
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/ 18

Program 1

import java.util.*;
public class WordsLettersCount
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=' '+sc.nextLine();
int COUNTS=0;
int len=s.length();
for(int i=0;i<len;i++)
if(s.charAt(i)==' ')
COUNTS++;
System.out.println("Number of words: "+COUNTS);
System.out.println("Number of letters: "+(len-COUNTS));
}
}

Program 2

import java.util.*;
public class RemovingVowels
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("Enter a sentence: ");
String s=sc.nextLine().toUpperCase();
char ch;
for(int i=0;i<s.length();i++)
{
ch=s.charAt(i);
if(ch=='A'||ch=='E'||ch=='I'||ch=='O'||ch=='U')
continue;
System.out.print(ch);
}
}
}

Program 3

import java.util.*;
public class DisplayInitials
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence containing 3 words: ");
String s=' '+sc.nextLine().toUpperCase();
int COUNTS=0, len=s.length();
for(int i=0;i<len;i++)
if(s.charAt(i)==' ')
COUNTS++;

if(COUNTS==3)
{
for(int i=0;i<s.length();i++)
if(s.charAt(i)==' ')
System.out.print(s.charAt(i+1)+" ");
}
else
System.out.print("The entered sentence must have only 3 words");
}
}

Program 4

import java.util.*;
public class DisplayName
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence containing 3 words: ");
String s=' '+sc.nextLine().toUpperCase();
int COUNTS=0;
for(int i=0;i<s.length();i++)
if(s.charAt(i)==' ')
COUNTS++;
if(COUNTS==3)
System.out.println(s.substring(s.lastIndexOf(' ')+1)+s.substring(0,s.lastIndexOf(' ')));
else
System.out.println("The entered sentence must have only 3 words");
}
}

Program 5

import java.util.*;
public class LongestWord
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=sc.nextLine()+' ',wd="",lw="";
int MAX=0;
for(int i=0;i<s.length();i++)
{
if(s.charAt(i)!=' ')
wd=wd+s.charAt(i);
else
{
if(wd.length()>MAX)
{
MAX=wd.length();
lw=wd;
}
wd="";
}
}
System.out.println("The longest word: "+lw);
System.out.println("The length of the word: "+MAX);
}
}

Program 6

import java.util.*;
public class AsciiCode
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a word: ");
String s=sc.next();
for(int i=0;i<s.length();i++)
System.out.println("ASCII of "+s.charAt(i)+" = "+ (int)s.charAt(i));
}
}

Program 7

import java.util.*;
public class ReplaceVowels
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=sc.nextLine().toUpperCase();
for(int i=0;i<s.length();i++)
if(s.charAt(i)=='A'||s.charAt(i)=='E'||s.charAt(i)=='I'||s.charAt(i)=='O'||s.charAt(i)=='U')
s=s.replace(s.charAt(i),'*');
System.out.print(s);
}
}

Program 8

import java.util.*;
public class Abbreviate
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=' '+sc.nextLine().toUpperCase();
for(int i=0;i<s.length();i++)
if(s.charAt(i)==' ')
System.out.print(s.charAt(i+1));
}
}

Program 9

import java.util.*;
public class Palindrome
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=sc.nextLine().toUpperCase()+' ',wd="",rev="";
for(int i=0;i<s.length();i++)
if(s.charAt(i)!=' ')
wd=wd+s.charAt(i);
else
{
for(int j=wd.length()-1;j>=0;j--)
rev=rev+wd.charAt(j);
if(wd.equals(rev))
System.out.println(wd);
wd="";
rev="";
}
}
}

Program 10

import java.util.*;
public class ReverseOrder
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=sc.nextLine()+' ',wd="",rev="";
for(int i=0;i<s.length();i++)
if(s.charAt(i)!=' ')
wd=wd+s.charAt(i);
else
{
rev=wd+' '+rev;
wd="";
}
System.out.println(rev);
}
}
Program 11

import java.util.*;
public class MaxVowelWord
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=sc.nextLine()+' ',wd="",rwd="";
int COUNTV=0,MAX=0;
for(int i=0;i<s.length();i++)
if(s.charAt(i)!=' ')
wd=wd+s.charAt(i);
else
{
for(int j=0;j<wd.length();j++)
if(wd.charAt(j)=='A'||wd.charAt(j)=='E'||wd.charAt(j)=='I'||wd.charAt(j)=='O'||wd.charAt(j)=='U')
COUNTV++;
if(COUNTV>MAX)
{
MAX=COUNTV;
rwd=wd;
}
COUNTV=0;
wd="";
}
System.out.println("The word with maximum number of vowels: "+rwd);
}
}

Program 12

public class ReplaceWord


{
public static void main(String args[])
{
String s="Blue bottle is in Blue bag lying on Blue carpet";
s=s.replace("Blue","Red");
System.out.println(s);
}
}

Program 13

import java.util.*;
public class VowelsNextLetter
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a word: ");
String s=sc.next().toLowerCase();
for(int i=0;i<s.length();i++)
if(s.charAt(i)=='a'||s.charAt(i)=='e'||s.charAt(i)=='i'||s.charAt(i)=='o'||s.charAt(i)=='u')
System.out.print((char)(s.charAt(i)+1));
else
System.out.print(s.charAt(i));
}
}

Program 14

import java.util.*;
class ReplaceString
{
public static void main(String args[])
{
String str1, str2="";
int i,p;
char ch,ch1;
Scanner in=new Scanner(System.in);
System.out.println("Enter a sentence");
str1=in.nextLine();
p=str1.length();
for(i=0;i<p;i++)
{
ch=str1.charAt(i);
ch1=(char)((int)ch-1);
if(ch=='a' || ch=='e' || ch=='i' || ch=='o' || ch=='u' || ch=='A' || ch=='E' || ch=='I' || ch=='O' || ch=='U')
str2=str2+ch;
else if(ch1=='a' || ch1=='e' || ch1=='i' || ch1=='o' || ch1=='u' || ch1=='A' || ch1=='E' || ch1=='I' || ch1=='O' || ch1=='U')
str2=str2+(char)((int)ch+1);
else
str2=str2+ch1;
}
System.out.println(str2);
}
}

Program 15

import java.util.*;
public class HappyWord
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a word: ");
String s=sc.next(), st="";
int sum,rem;
for(int i=0;i<s.length();i++)
{
int POSITION=0;
for(int j=65;j<=90;j++)
{
POSITION++;
if(s.charAt(i)==j)
break;
}
st=st+POSITION;
}
int num=Integer.parseInt(st);
do
{
sum=0;
while(num!=0)
{
rem=num%10;
sum=sum+rem*rem;
num=num/10;
}
num=sum;
}while(sum>9);
if(sum==1)
System.out.print("A Happy Word");
else
System.out.print("Not a Happy Word");
}
}

Program 16

import java.util.*;
public class AlphabetFrequency
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=sc.nextLine().toUpperCase();
System.out.println("Letter\tFrequency");
for(int i=65;i<=90;i++)
{
int COUNT=0;
for(int j=0;j<s.length();j++)
if(s.charAt(j)==i)
COUNT++;
if(COUNT!=0)
System.out.println((char)i+"\t"+COUNT);
}
}
}

Program 17

import java.util.*;
public class DoubleLetter
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=sc.nextLine().toUpperCase();
int COUNT=0;
for(int i=0;i<s.length()-1;i++)
if(s.charAt(i)==s.charAt(i+1))
COUNT++;
System.out.print("Number of double letter sequences: "+COUNT);
}
}

Program 18

import java.util.*;
public class PalindromeSpecial
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("Enter a word: ");
String s=sc.next().toUpperCase(),rev="";
for(int i=s.length()-1;i>=0;i--)
rev=rev+s.charAt(i);
if(s.compareTo(rev)==0)
System.out.print(s+" is palindrome as well as special word");
else if(s.compareTo(rev)!=0 && s.charAt(0)==s.charAt(s.length()-1))
System.out.print(s+" is special word but not a palindrome");
else
System.out.print(s+" is neither a palindrome nor a special word");
}
}

Program 19

import java.util.*;
public class CountConsecutiveLetters
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence: ");
String s=sc.nextLine().toUpperCase()+' ',wd="";
int COUNT=0;
for(int i=0;i<s.length();i++)
{
if(s.charAt(i)!=' ')
wd=wd+s.charAt(i);
else
{
for(int j=0;j<wd.length()-1;j++)
if(wd.charAt(j+1)-wd.charAt(j)==1)
{
COUNT++;
System.out.println(wd);
}
wd="";
}
}
System.out.println("Number of words containing consecutive letters: "+COUNT);
}
}
Program 20
(a)
import java.util.*;
public class Pattern
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("Enter a word: ");
String s=sc.next().toUpperCase();
for(int i=s.length();i>=1;i--)
System.out.println(s.substring(0,i));
}
}

(b)
import java.util.*;
public class Pattern
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("Enter a word: ");
String s=sc.next().toUpperCase();
for(int i=s.length()-1;i>=0;i--)
{
for(int j=s.length();j>i;j--)
System.out.print(s.charAt(i));
System.out.println();
}
}
}

(c)
import java.util.*;
public class Pattern
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a word: ");
String s=sc.next().toUpperCase();
for(int i=0;i<=s.length();i++)
System.out.println(s.substring(i,s.length()));
}
}
Program 21
(a)
public class Pattern21a
{
public static void main(String args[])
{
for(int i=65;i<=69;i++)
{
for(int j=i;j<=69;j++)
System.out.print((char)j);
System.out.println();
}
}
}

(b)
public class Pattern21b
{
public static void main(String args[])
{

int a=64;
for(int i=1;i<=5;i++)
{
for(int j=1;j<=i;j++)
System.out.print((char)++a);
System.out.println();
}
}
}

(c)
public class Pattern21c
{
public static void main(String args[])
{
for(int i=1;i<=5;i++)
{
for(int j=65;j<=70-i;j++)
System.out.print((char)j);
for(int k=65;k<64+i;k++)
System.out.print((char)k);
System.out.println();
}
}
}
Program 22

import java.util.*;
public class InvertedTriangle
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter '1' to display inverted triangle pattern of asterisks");
System.out.println("Enter '2' to display inverted triangle pattern of letters");
System.out.println("Enter your choice: ");
int ch=sc.nextInt();
switch(ch)
{
case 1: for(int i=1;i<=5;i++)
{
for(int k=1;k<i;k++)
System.out.print(' ');
for(int j=5;j>=i;j--)
System.out.print('*');
System.out.println();
}
break;
case 2: for(int i=1;i<=5;i++)
{
for(int j=65;j<=70-i;j++)
System.out.print((char)j);
System.out.println();
}
break;
default: System.out.println("Invalid Choice");
}
}
}
Program 23

import java.util.*;
public class InvertedTriangle
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter '1' to display right triangle pattern of a word");
System.out.println("Enter '2' to display inverted triangle pattern of a word");
System.out.println("Enter your choice: ");
int ch=sc.nextInt();
switch(ch)
{
case 1: System.out.print("Enter a word: ");
String s1=sc.next().toUpperCase();
for(int i=0;i<s1.length();i++)
{
for(int j=0;j<=i;j++)
System.out.print(s1.charAt(i));
System.out.println();
}
break;
case 2: System.out.print("Enter a word: ");
String s2=sc.next().toUpperCase();
for(int i=s2.length();i>=0;i--)
System.out.println(s2.substring(0,i));
break;
default: System.out.print("Invalid Choice");
}
}
}

Program 24

import java.util.*;
public class FloydTriangle_Pattern
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter '1' to display floyd's triangle");
System.out.println("Enter '2' to display right triangle pattern of a word");
System.out.print("Enter your choice: ");
int ch=sc.nextInt();
switch(ch)
{
case 1: for(int i=1,a=1;i<=5;i++)
{
for(int j=1;j<=i;j++)
System.out.print(a++ +" ");
System.out.println();
}
break;
case 2: System.out.print("Enter a word: ");
String s=sc.next().toUpperCase();
for(int i=1;i<=s.length();i++)
System.out.println(s.substring(0,i));
break;
default: System.out.print("Invalid Choice");
}
}
}

Program 25

import java.util.*;
public class CountryCapital
{
public static void main(String args[])
{
String co[]=new String[10],ca[]=new String[10];
Scanner sc=new Scanner(System.in);
System.out.println("Enter the name of the country along with capital: ");
for(int i=0;i<10;i++)
{
co[i]=sc.next().toUpperCase();;
ca[i]=sc.next().toUpperCase();
}
System.out.println("Country Name\t\tCapital");
for(int i=0;i<10;i++)
if(co[i].startsWith("A")||co[i].startsWith("E")||co[i].startsWith("I")||co[i].startsWith("O")||co[i].startsWith("U"))
System.out.println(co[i]+"\t\t\t"+ca[i]);
}
}

Program 26: Part 1

import java.util.*;
public class OrderedNamesContacts
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String name[]=new String[20] ,temp1;
long contact[]=new long[20],temp2;
System.out.println("Enter the name along with the contact number: ");
for(int i=0;i<20;i++)
{
name[i]=sc.next();
contact[i]=sc.nextLong();
}
System.out.println("Names in alphabetical order along with contact number: ");
for(int i=0;i<19;i++)
{
for(int j=i+1;j<20;j++)
{
if(name[i].compareTo(name[j])>0)
{
temp1=name[i];
name[i]=name[j];
name[j]=temp1;
temp2=contact[i];
contact[i]=contact[j];
contact[j]=temp2;
}
}
}
for(int i=0;i<20;i++)
System.out.println(name[i]+"\t\t"+contact[i]);
}
}

Program 26: Part 2

import java.util.*;
public class Names
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String name[]=new String[10];
int COUNT=0;
System.out.println("Enter the names: ");
for(int i=0;i<10;i++)
name[i]=sc.nextLine();
System.out.print("Enter the first letter of the name is to be searched: ");
char ch=sc.next().charAt(0);
for(int i=0;i<10;i++)
{
if(ch==name[i].charAt(0))
{
COUNT++;
System.out.println(name[i]);
}
}
if(COUNT==0)
System.out.print("No name is found");
}
}

Program 27

import java.util.*;
public class NamesBubbleSort
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String name[]=new String[20],temp;
System.out.println("Enter the names: ");
for(int i=0;i<20;i++)
name[i]=sc.next();
for(int i=0;i<19;i++)
{
for(int j=0;j<(19-i);j++)
{
if(name[j].compareTo(name[j+1])>0)
{
temp=name[j];
name[j]=name[j+1];
name[j+1]=temp;
}
}
}
System.out.println("Names in ascending order: ");
for(int i=0;i<20;i++)
System.out.println(name[i]);
}
}

Program 28

import java.util.*;
public class DisplayNames
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String name[]=new String[10];
System.out.println("Enter the names of 10 cities : ");
for(int i=0;i<10;i++)
name[i]=sc.next();
System.out.println("Names beginning with a consonant and ending with a vowel:
"); for(int i=0;i<10;i++)
{
char chb=name[i].charAt(0);
char che=name[i].charAt(name[i].length()-1);
if((chb!='A'&&chb!='E'&&chb!='I'&&chb!='O'&&chb!='U')&&
(che=='A'||che=='E'||che=='I'||che=='O'||che=='U'))
System.out.println(name[i]);
}
}
}

Program 29

import java.util.*;
public class PalindromeWords
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String name[]=new String[10],st="";
System.out.println("Enter 10 words: ");
for(int i=0;i<10;i++)
name[i]=sc.next().toUpperCase();
System.out.println("Palindrome words are: ");
for(int i=0;i<10;i++)
{
for(int j=0;j<name[i].length();j++)
st=name[i].charAt(j)+st;
if(name[i].equals(st))
System.out.println(name[i]);
st="";
}
}
}

Program 30

import java.util.*;
public class CitiesStdCode
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String city[]=new String[10],cs,ci="";
int stdcode[]=new int[10],flag=0,st=0;
System.out.println("Enter the name of 10 cities along with STD code: ");
for(int i=0;i<10;i++)
{
city[i]=sc.next();
stdcode[i]=sc.nextInt();
}
System.out.print("Enter the name of city to be searched: ");
cs=sc.next();
for(int i=0;i<10;i++)
{
if(cs.equals(city[i]))
{
flag=1;
ci=city[i];
st=stdcode[i];
break;
}
}
if(flag==1)
{
System.out.println("Search Successful!");
System.out.print(ci+" STD code is: "+st);
}
else
System.out.print("Search unsuccessful! No such city found in the list.");
}
}

You might also like