Index

Disarium Number​ 2
Disarium Range​ 3
String Operation​ 4
Longest Word- String Tokenizer​ 5
Decimal To Binary​ 6
Prime Pallindrome​ 7
Bank Account​ 8
Pallindrome And Word With Max Vowels​ 9
Ramjee Number​ 11
Library​ 12
Compute​ 12
Area of Circle and Cylinder​ 13
Volume of Circle and Cylinder​ 13
Mask String​ 14
Evil Number​ 15
Composite Numbers Matrix​ 16
Word With All Vowels​ 18
Decimal To Hexadecimal​ 19
ASCII Values​ 20
Matrix Sort Column Wise​ 21
Pangram Sentence​ 23
Dudeney Number​ 24
​
​
​
​
​

​Disarium Number
import java.util.*;
public class Disarium
{
int no,countdigit;
public Disarium()
{
no=0;
countdigit=0;
}

public void input()

{
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number");
no= sc.nextInt();
}

public void checkdigits()

{
int n = no;
while(n>0)
{
countdigit++;
n/=10;
}
}

public boolean isDisarium()

{
int sum=0;
int digit,n1=no;
boolean flag;
while(n1>0)
{
digit=n1%10;
sum+=(int)(Math.pow(digit,countdigit));
countdigit--;
n1/=10;
 }
if(sum==no)
flag=true;
else
flag=false;
return flag;
}

public void display()

{
if(isDisarium())
System.out.println(no+"is disarium number");
else
System.out.println(no+"is not disarium number");
}

public static void main()

{
Disarium ob = new Disarium();
ob.input();
ob.checkdigits();
ob.display();
}
}

​Disarium Range
import java.util.*;
public class DisariumRange
{

public int checkdigits(int num)

{
int count=0;
int n = num;
while(n>0)
{
count++;
n/=10;
}
return count;
}

public boolean isDisarium(int num)

{
int sum=0;
int digit,n1=num;
boolean flag;
int countdigit=checkdigits(num);
while(n1>0)
{
digit=n1%10;
 sum+=(int)(Math.pow(digit,countdigit));
countdigit--;
n1/=10;
}
return sum==num;
}

public void Range()

{
Scanner sc= new Scanner(System.in);
System.out.println("Enter limits of range");
int ll=sc.nextInt();
int ul= sc.nextInt();
System.out.println("Disarium numbers within the range:");
for(int i =ll;i<=ul;i++)
{
if(isDisarium(i))
{
System.out.println(i + " ");
}
}
System.out.println();
}

public static void main()

{
DisariumRange obj= new DisariumRange();
obj.Range();
}
}

​String Operation
import java.util.*;
public class StringOperation
{
String sentence;
public StringOperation(String sentence)
{
this.sentence=sentence;
}
public void display()
{
StringTokenizer st = new StringTokenizer(sentence," ");
int count=st.countTokens();
while(st.hasMoreTokens())
{
System.out.println(st.nextToken());
}
}
public static void main()
 {
Scanner sc = new Scanner(System.in);
System.out.println("Enter a sentence");
String sent= sc.nextLine();
StringOperation ob=new StringOperation(sent);
ob.display();
}
}

​Longest Word- String Tokenizer

import java.util.*;
public class WordLength
{
String sentence;
public WordLength(String sentence)
{
this.sentence=sentence;
}

public static int count(String word)

{
int count = word.length();
return count;
}

public void display()

{
StringTokenizer st= new StringTokenizer(sentence," ");
int maxcount=0;
String lword="";
while(st.hasMoreTokens())
{
String word = st.nextToken();
System.out.println(word + word.length());
int wordcount = count(word);
if(wordcount>maxcount)
{
maxcount = wordcount;
lword=word;
}
}
System.out.println("Longest word"+lword + "number of letters"+maxcount);
}

public static void main()

{
Scanner sc = new Scanner(System.in);
System.out.println("Enter a sentence");
 String sentence= sc.nextLine();
WordLength ob = new WordLength(sentence);
ob.display();
}
}

​Decimal To Binary
import java.util.*;
public class DecimalToBinary
{
int n;
String bin;
public DecimalToBinary(int n)
{
this.n=n;
bin="";
}

public String Convert ()

{
int n1=n;
while(n1>0)
{
bin=(n1%2)+bin;
n1/=2;
}
return bin;
}

public void display()

{
System.out.println("The decimal number is:"+ n);
System.out.println("The binary equivalent is:" +bin);
}

public static void main()

{
Scanner sc= new Scanner(System.in);
System.out.println("Enter a decimal number");
int n=sc.nextInt();
DecimalToBinary obj= new DecimalToBinary(n);
obj.Convert();
obj.display();
}
}

​Prime Pallindrome
import java.util.*;
public class PrimePallindrome
{
int m,n;

public PrimePallindrome(int m,int n)

{
this.m=m;
this.n=n;
}

public boolean isPalin(int x)

{
int no=x,rev=0;
while(x>0)
{
int dig=x%10;
rev=rev*10+dig;
x/=10;
}
if(rev==no)
{
return true;
}
else
return false;
}

public boolean isPrime(int x)

{
if(x<2)
return false;
for(int i=2;i<x/2;i++)
{
if(x%i==0)
{
return false;
}
}
return true;
}

public void display()

{
int count=0;
System.out.println("Prime pallindromes between" + m + "and" + n + ":");
 boolean flag=false;
for(int i=m;i<=n;i++)
{
if(isPalin(i) && isPrime(i))
{
count++;
System.out.println(i + "");
flag=true;
}
}
System.out.println("Frequency of prime pallindromes:"+ count);
if(!flag)
{
System.out.println("No prime pallindromes found in the range");
}
else{
System.out.println();
}
}

public static void main()

{
Scanner sc= new Scanner(System.in);
System.out.println("Enter limits of range");
int m=sc.nextInt();
int n=sc.nextInt();
PrimePallindrome obj= new PrimePallindrome(m,n);
obj.display();
}
}

​Bank Account
import java.util.*;
public class BankAccount
{
String accounttype,name;
double balance,roi,accountid;
public BankAccount(String accounttype,String name,int accountid,int balance)
{
this. accounttype= accounttype;
this.name=name;
this.accountid=accountid;
this.balance=balance;
if(accounttype.equalsIgnoreCase("Savings"))
{
roi=6.0;
}
else
roi= 8.0;
}
 public double CalcInterest()
{
double interest= (balance*roi*3)/100;
return interest;
}

public void display()

{
System.out.println("Account holder's name" + name);
System.out.println("Account type" + accounttype);
System.out.println("Account id" + accountid);
System.out.println("balance" + balance);
System.out.println("Interest rate" + CalcInterest());
}

public static void main()

{
Scanner sc = new Scanner(System.in);
System.out.println("Enter your name");
String name = sc.nextLine();
System.out.println("Enter type of account");
String accounttype = sc.nextLine();
System.out.println("Enter account id");
int accountid= sc.nextInt();
System.out.println("Enter balance");
int balance = sc.nextInt();
BankAccount obj= new BankAccount(accounttype,name,accountid,balance);
obj.display();
}
}

​Pallindrome And Word With Max Vowels

import java.util.*;
public class MaxVoweltokenizer
{
String sentence;
public MaxVoweltokenizer(String sentence)
{
this.sentence= sentence;
}

public static boolean isPalindrome(String word)

{
int l=0,r=word.length()-1;
while(l<r)
{
if(word.charAt(l)!=word.charAt(r))
{
return false;
 }
l++;
r--;
}
return true;
}

public static int countvow(String word)

{
int count=0;
word=word.toLowerCase();
for(int i=0; i<word.length();i++)
{
char ch= word.charAt(i);
if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')
{
count++;
}
}
return count;
}

public void display()

{
StringTokenizer st= new StringTokenizer(sentence," ");
String maxvowelword="";
int maxvowcount=0;
System.out.println("Palindrome words are:");
while(st.hasMoreTokens())
{
String word= st.nextToken();
if(isPalindrome(word))
{
System.out.println(word);
}
int vowcount= countvow(word);
if(vowcount>maxvowcount)
{
maxvowcount=vowcount;
maxvowelword=word;
}
}
System.out.println("Word with max vowels"+maxvowelword+"vowels"+maxvowcount);
}

public static void main()

{
Scanner sc = new Scanner(System.in);
System.out.println("Enter a sentence");
String sentence = sc.nextLine();
MaxVoweltokenizer obj= new MaxVoweltokenizer(sentence);
obj.display();
 }
}

​Ramjee Number
import java.util.*;
public class Ramjee
{
int N;
public Ramjee(int n1)
{
N=n1;
}

public int power (int n)

{
int sq=n*n;
return sq;
}

public int sum_of_square(int x)

{
int dig=0,sum=0;
while(x>0)
{
dig=x%10;
x/=10;
sum+= power(dig);
}
return sum;
}

public boolean isRamjee()

{
int s= N;
while(s>9)
{
s=sum_of_square(s);
}
return (s==1);
}

public static void main()

{
Scanner sc= new Scanner(System.in);
System.out.println("Enter a number");
int no=sc.nextInt();
Ramjee obj= new Ramjee(no);
if(obj.isRamjee())
{
System.out.println(no + "is a Ramjee number");
 }
else
System.out.println(no + "is not a Ramjee number");
}
}

​Library
public class Library
{
protected String name;
protected String author;
protected double p;
public Library( String name,String author,double p)
{
this.name=name;
this.author=author;
this.p=p;
}
public void show()
{
System.out.println("Book name:" + name);
System.out.println("Author's name:" + author);
System.out.println("Book's price:" + p);
}
}

​Compute
import java.util.*;
public class Compute extends Library
{
int d;
double f;
public Compute(String name,String author,double p,int d)
{
super(name,author,p);
this.d=d;
this.f=0.0;

}
public void fine()
{
int exd= d-7;
if(exd>=1&&exd<=5)
f=exd*2;
else if(exd>=6&&exd<=10)
f=exd*3;
else
f=exd*5;
 }
public void show()
{
super.show();
fine();
double rent = (p*0.02)*d;
double amount= rent + f;
System.out.println("Number of days taken:"+d);
System.out.println("Fine Rs:"+f);
System.out.println("Rental charge: "+rent);
System.out.println("Total amount to be paid:"+amount);
}
public static void main()
{
Scanner sc= new Scanner(System.in);
System.out.println("Enter name of book ");
String bookname = sc.nextLine();
System.out.println("Enter name of author ");
String author = sc.nextLine();
System.out.println("Enter price ");
double price = sc.nextDouble();
System.out.println("Enter number of days taken");
int daystaken= sc.nextInt();
Compute obj= new Compute(bookname,author,price,daystaken);
obj.show();
}
}

​Area of Circle and Cylinder

import java.util.*;
public class Circle_Ar
{
protected double radius,area;
Circle_Ar(double radius)
{
this.radius=radius;

}
public void calcArea()
{
area=3.14*radius*radius;
}
void display()
{
System.out.println("Area of the circle="+area);
}
public static void main()
{
Scanner in=new Scanner(System.in);
System.out.println("Enter radius of circle");
 double radius=in.nextDouble();

}
}

​Volume of Circle and Cylinder

import java.util.*;
public class Volume extends Circle
{
double height,volume;
public Volume(double radius,double height)
{
super(radius);
this.height=height;
}

public double Calculate()

{
volume=area*height;
return volume;
}

public void display()

{
super.display();
System.out.println("Volume of cylinder="+ Calculate());
}

public static void main()

{
Scanner in=new Scanner(System.in);
System.out.println("Enter radius of circle");
double radius=in.nextDouble();
System.out.println("Enter height of cylinder");
double height=in.nextDouble();
Volume ob=new Volume(radius,height);
ob.calcArea();
ob.display();

}
}

​Mask String
import java.util.*;
public class StringOp
{
String str,msk,nstr;
public StringOp()
{
 str="";
msk="";
nstr="";
}

public void accept()

{
Scanner sc = new Scanner(System.in);
System.out.println("Enter a string");
str= sc.next();
System.out.println("Enter a mask string");
msk= sc.next();
str=str.toLowerCase();
msk=msk.toLowerCase();
}

public void form()

{
boolean flag;
for(int i =0;i<str.length();i++)
{
flag= false;
for(int j=0;j<msk.length();j++)
{
if(str.charAt(i)==msk.charAt(j))
{
flag=true;
break;
}

}
if(!flag)
{
nstr+=str.charAt(i);
}
}
}
public void display()
{
System.out.println("Original string"+ str);
System.out.println("New string"+nstr);
}
public static void main()
{
StringOp obj = new StringOp();
obj.accept();
obj.form();
obj.display();
}
}
​Evil Number
import java.util.*;
public class Evil
{
int num;
String bin;
public void accept()
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter a decimal number");
num= sc.nextInt();

public void rec_bin()

{
int n1=num;
while(n1>0)
{
bin= (n1%2)+bin;
n1/=2;
}
}

public void check()

{
int i;
int count=0;
for(i=0;i<bin.length();i++)
{
if(bin.charAt(i)=='1')
{
count++;
}
}
if(count%2==0)

System.out.println(num+ "is an evil number");

else

System.out.println(num + "is not an evil number");

}

public static void main()

{
Evil obj= new Evil();
obj.accept();
obj.rec_bin();
obj.check();
}
}
​Composite Numbers Matrix
import java.util.*;

public class Composite

{
int arr[][],m,n;
public Composite(int mm,int nn)
{
m=mm;
n=nn;
arr= new int[m][n];
if(m>20||n>20)
{
System.out.println("Invalid input");
}
}

public int isComposite(int p)

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

public void fill()

{
int num=2;
for(int j=0;j<n;j++)
{
for(int i=0;i<m;i++)
{
while(isComposite(num)==0)
{
num++;
}
arr[i][j]=num;
num++;
}
}
}
 public void display()
{
System.out.println("Composite numbers in matrix form:");
for(int i =0; i<m;i++)
{
for(int j=0;j<n;j++)
{
System.out.print(arr[i][j]+ " ");
}
System.out.println();
}
}

public static void main()

{
Scanner sc = new Scanner(System.in);
System.out.println("Enter dimensions of array");
int m1= sc.nextInt();
int n1 = sc.nextInt();
Composite obj= new Composite(m1,n1);
obj.fill();
obj.display();
}
}

​Word With All Vowels

import java.util.*;

public class All_Vowels

{
String sentence;
public All_Vowels(String sentence)
{
this.sentence=sentence;
}

public boolean checkAllVowels(String word)

{
String lword=word.toLowerCase();
boolean isa=false,ise=false,isi=false,iso=false,isu=false;
for(int i =0;i<word.length();i++)
{
char ch= word.charAt(i);
if(ch=='a')
isa=true;
else if(ch=='e')
ise= true;
else if(ch=='i')
isi=true;
else if(ch=='o')
iso=true;
else if(ch=='u')
 isu=true;
}
return (isa && ise && isi && iso && isu);
}

public void display()

{
StringTokenizer st = new StringTokenizer(sentence," ");
System.out.println("Words containing all the vowels:");
while(st.hasMoreTokens())
{
String word= st.nextToken();
if(checkAllVowels(word))
{
System.out.println(word);
}
}
}

public static void main()

{
Scanner sc = new Scanner(System.in);
System.out.println("Enter a sentence");
String sent = sc.nextLine();
All_Vowels obj = new All_Vowels(sent);
obj.display();
}
}

​Decimal To Hexadecimal
import java.util.*;

public class DeciHex

{
String hexa;
int num;
public DeciHex()
{
num=0;
hexa="";
}

public void getNum()

{
Scanner sc= new Scanner(System.in);
System.out.println("Enter a number");
num=sc.nextInt();
}

public void Convert()

{
int n=num;
while(n>0)
{

if(n%16>=10)
{
if(n%16==10)
{
hexa+="A";
}
if(n%16==11)
{
hexa+="B";
}
if(n%16==12)
{
hexa+="C";
}
if(n%16==13)
{
hexa+="D";
}
if(n%16==14)
{
hexa+="E";
}
if(n%16==15)
{
hexa+="F";
}
}
else
{
hexa=(n%16)+hexa;
}
n/=16;
}
}

public void display()

{
System.out.println("hexadecimal equivalent"+ hexa);
}

public static void main()

{
DeciHex obj= new DeciHex();
obj.getNum();
obj.Convert();
obj.display();
}
}

​ASCII Values
import java.util.*;
public class Coding
{
String word;
int len;
public Coding()
{
word="";
len=0;
}

public void accept()

{
Scanner sc= new Scanner(System.in);
System.out.println("Enter a word");
word=sc.next();
len=word.length();
}

public void find()

{
int max=0,min=0;
System.out.println("ASCII of each value:");
for(int i = 0; i<len;i++)
{
char ch = word.charAt(i);
int ascii= (int)ch;
System.out.println(ch+ "->" +ascii);
if(ascii>max)
{
max=ascii;
}
if(ascii<min)
{
min=ascii;
}
}
System.out.println("Max ascii value" + max);
System.out.println("Min ascii value" + min);
}

public static void main()

{
Coding obj= new Coding();
obj.accept();
obj.find();
}
}

​Matrix Sort Column Wise

import java.util.*;
public class Matrix_Sort
{
int M,N,A[][];
public Matrix_Sort()
{
M=0;
N=0;
}

public void accept()

{
Scanner sc = new Scanner(System.in);
System.out.println("Enter number of rows and columns");
M=sc.nextInt();
N=sc.nextInt();

A= new int[M][N];

System.out.println("Enter elements of matrix");

for(int i= 0;i<M;i++)
{
for(int j = 0;j<N;j++)
{
A[i][j]= sc.nextInt();
}
}
}

public void sort()

{
for(int j=0;j<N;j++)
{

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

public void display()

{
System.out.println("Sorted matrix:");
for(int i=0;i<M;i++)
{
for(int j=0;j<N;j++)
{
System.out.print(A[i][j] + " ");
}
System.out.println();
}
}

public static void main()

{
Matrix_Sort obj= new Matrix_Sort();
obj.accept();
obj.sort();
obj.display();
}
}

​Pangram Sentence

import java.util.*;
public class Pangram
{
String sent;
public Pangram()
{
sent="";
}

public void accept()

{
Scanner sc= new Scanner(System.in);
System.out.println("Enter a sentence");
sent=sc.nextLine();
}

public boolean isPangram()

{
int count=0;
for(char ch='a';ch<='z';ch++)
{
boolean flag=false;
for(int i =0;i<sent.length();i++)
{
 if(ch>='a' && ch<='z')
{
if(sent.charAt(i)==ch)
{
flag =true;
break;
}
}
}
if(flag)
{
count++;
}
}
return count==26;
}

public void display()

{
StringTokenizer st= new StringTokenizer(sent, " ");
String longest="",shortest=st.nextToken();
if(isPangram())
{
System.out.println(sent + "Is a pangram sentence");
}
else{
System.out.println(sent + "Is not a pangram sentence");
}

while(st.hasMoreTokens())
{
String word=st.nextToken();
if(word.length()>longest.length())
{
longest=word;
}
if(word.length()<shortest.length())
{
shortest=word;
}
}
System.out.println("Longest word" + longest);
System.out.println("Shortest word" + shortest);
}

public static void main()

{
Pangram obj= new Pangram();
obj.accept();
obj.display();
}
}
​Dudeney Number

import java.util.*;
public class Num_Dude
{

int n;
public Num_Dude()
{
n=0;
}

public void input ()

{
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number");
n=sc.nextInt();
}

public int SumDigits()

{
int sum=0,n1=n,dig=0;
while(n1>0)
{
dig=n1%10;
n1/=10;
sum+=dig;
}
return sum;
}

public void isDude()

{
int no=SumDigits();
int cube=no*no*no;
if(cube==n)
{
System.out.println(n+ "Is a dudeney number");
}
else

System.out.println(n+ "Is not a dudeney number");

}

public static void main()

{
Num_Dude obj= new Num_Dude();
obj.input();
obj.isDude();
 }
}