Programs

1)
public class MakeTea {

public static void main(String[] args) {

System.out.println("boiling water");

System.out.println("adding tea powder and sugar");

System.out.println("Adding milk");

System.out.println("straining and serving tea");

System.out.println("tea is ready!");
}
}

Output:

boiling water
adding tea powder and sugar
Adding milk
straining and serving tea
tea is ready!
2)
import java.util.Scanner;

public class TravelToCollege {

public static void main(String[] args) {

System.out.println("wake up");

System.out.println("get ready");

Scanner sc = new Scanner(System.in);

System.out.println("Select mode of transport (walk/bus/bike)");

String mode = sc.next();

int flag=0;
switch(mode)
{
case "walk" : System.out.println("walking to college");
flag++;
break;
case "bus" : System.out.println("taking the bus to college");
flag++;
break;
case "bike" : System.out.println("riding the bike to college");
flag++;
break;

default: System.out.println("invalid input");

break;

if(flag != 0)
{
System.out.println("Reached college");
}
}
}
Output:
wake up
get ready
Select mode of transport (walk/bus/bike)
bike
riding the bike to college
Reached college
3)
public class CheckPwdIsCorrect {

public static void main(String[] args) {

int correctpassword =123;

int enteredpassword =123;

if(enteredpassword == correctpassword)
{
System.out.println("access granted");
}
}
}

Output:
access granted

4)

public class Vote {

public static void main(String[] args) {

int age=17;

if(age >= 18)

{
System.out.println(age+" age eligible for vote");
}
else {
System.out.println(age+" age is not eligible for vote");
}
}
}

Output:
17 age is not eligible for vote
5)

public class MaximumBtwTwoNumbers {

public static void main(String[] args) {

int num1 = 2000;

int num2 = 1000;

if(num1 > num2)

{
System.out.println(num1 +" is a maximum number");
}
else {
System.out.println(num2 + " is a maximum number");
}
}
}

Output:
2000 is a maximum number

6)
public class MaximumBtw3Numbers {

public static void main(String[] args) {

int a = 10 ,b=20,c=30;

if(a>=b && a>=c)

{
System.out.println("The maximum number is "+a);
}
else if(b>=a && b>=c)
{
System.out.println("The maximum number is "+b);
}
else {
System.out.println("The maximun number is "+c);
}
}
}

Output:
The maximun number is 30
7)
public class PositiveNumOrNegativeNum {

public static void main(String[] args) {

int num=0;

if(num>0)
{
System.out.println(num+" positive number");
}
else if(num<0){
System.out.println(num +" is negative number");
}
else {
System.out.println(num);
}
}
}

Output:
18 positive number

8)

public class EvenOrOddNumber {

public static void main(String[] args) {

int num=5;

if(num%2 == 0)
{
System.out.println(num + " is an even number");
}
else
{
System.out.println(num + " is an odd number");
}
}
}

Output:
5 is an odd number
9)
public class EvenOrOddWithoutModulusOperator {

public static void main(String[] args) {

int num = 17;

if(num == (num/2)*2)
{
System.out.println(num +" is even number");
}
else {
System.out.println(num + " is an odd number");
}
}
}

Output:
17 is an odd number

10)
public class EvenNumberBtwRange {

public static void main(String[] args) {

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

{
if(i%2 == 0)
{
System.out.println(i);
}
}
}
}

Output:
2
4
6
8
10
11)
public class EvenOrOddWithoutModulusOperator {

public static void main(String[] args) {

int num = 17;

if(num == (num/2)*2)
{
System.out.println(num +" is even number");
}
else {
System.out.println(num + " is an odd number");
}
}
}

Output:
17 is an odd number
12)
public class SwapTwoValues {

public static void main(String[] args) {

int a=10,b=20,temp=0;
System.out.println("before swap, a = "+a+" , b = "+b);
temp = a;
a=b;
b=temp;

System.out.println("after swap, a = "+a+" , b = "+b);

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

int num1 = 100 , num2 = 200;

System.out.println("before swap, num1 = "+num1+" , num2 = "+num2);

num1=num1*num2;
num2= num1/num2;
num1=num1/num2;

System.out.println("after swap, num1 = "+num1+" , num2 = "+num2);

}
}

Output:
before swap, a = 10 , b = 20
after swap, a = 20 , b = 10
****************************************
before swap, num1 = 100 , num2 = 200
after swap, num1 = 200 , num2 = 100
13)
public class FactorialOfNumber {

public static void main(String[] args) {

int num=5;
int fac = 1;

for(int i = num ; i >= 1 ; i--)

{
fac = fac*i;
}

System.out.println(fac);
}
}

Output:
120

14)
public class SumOfNaturalNumber {

public static void main(String[] args) {

/*sum of first 5 natural numbers*/

int sum=0;
for(int i=1 ; i<=5 ; i++)
{
sum = sum+i;

System.out.println(sum);
}
}

Output:
15
15)
public class SumOfFstTenEvenNumBtwRange {

public static void main(String[] args) {

int sum=0;
int count = 0;

for(int i=1 ; i<=100 ; i++)

{
if(i%2 == 0)
{
sum=sum+i;
count++;

if(count == 10)
{
break;
}
}
}

System.out.println("The sum of first 10 even number is "+sum);

}
}

Output:
The sum of first 10 even number is 110
16)
public class PrintTables {

public static void main(String[] args) {

int num = 10;

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

{
System.out.println(num+" * "+i+" = "+(num*i));
}
}
}

Output:
10 * 1 = 10
10 * 2 = 20
10 * 3 = 30
10 * 4 = 40
10 * 5 = 50
10 * 6 = 60
10 * 7 = 70
10 * 8 = 80
10 * 9 = 90
10 * 10 = 100

17)
public class MaximumBtwTwoNumbers {

public static void main(String[] args) {

int num1 = 2000;

int num2 = 1000;

if(num1 > num2)

{
System.out.println(num1 +" is a maximum number");
}
else {
System.out.println(num2 + " is a maximum number");
}
}
}

Output:
2000 is a maximum number
18)

public class MaximumBtw3Numbers {

public static void main(String[] args) {

int a = 10 ,b=20,c=30;

if(a>=b && a>=c)

{
System.out.println("The maximum number is "+a);
}
else if(b>=a && b>=c)
{
System.out.println("The maximum number is "+b);
}
else {
System.out.println("The maximun number is "+c);
}
}
}

Output:
The maximun number is 30

19)
public class ExtractLastDigit {

public static void main(String[] args) {

int num=123;

int lastDigit = num%10;

System.out.println(lastDigit);
}
}

Output:
3
20)
public class RemoveLastDigit {

public static void main(String[] args) {

int num=1234;

int result = num/10;

System.out.println(result);
}
}

Output:
123

21)
public class CountNumberOfDigitsInANumber {

public static void main(String[] args) {

int num=36923456;
int count=0;

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

System.out.println(count);
}
}

Output:
8
22)
public class SumOfAllDigitsInNumber {

public static void main(String[] args) {

int num=1234;
int sum=0;

while(num != 0)
{
int lastDigit = num %10;

sum=sum+lastDigit;

num = num/10;
}

System.out.println(sum);
}
}

Output:
10

23)
public class ProductOfEachDigitInNumber {

public static void main(String[] args) {

int num=1234;
int product =1 ;

while(num!=0)
{
int rem = num%10;

product = product*rem;

num=num/10;

System.out.println(product);
}
}

Output:
24
24)
public class AvgOfDigitsInNumber {

public static void main(String[] args) {

int num=1234;
int temp =num;
int sum=0;

int count =0;

while(num!=0)
{
int lastDigit = num%10;
sum = sum+lastDigit;
num = num/10;

count++;
}

int average = sum/count;

System.out.println(average +" is the average of the num "+temp);

}
}

Output:
2 is the average of the num 1234
25)
public class SmallestDigitInNumber {

public static void main(String[] args) {

int num=97459;

int min = num%10;

num = num/10;

while(num !=0 )
{
int lastDigit = num%10;

if(lastDigit < min)

{
min = lastDigit;
}

num= num/10;
}
System.out.println(min);
}
}

Output:
4
26)
public class GreatestDigitInNumber {

public static void main(String[] args) {

int num=1934;

int max = Integer.MIN_VALUE;

// num = num/10;

while(num!=0)
{
int lastDigit = num %10;

if(lastDigit > max)

{
max = lastDigit;
}

num = num/10;
}

System.out.println(max);
}
}

Output:
9
27)
public class FstDigitEvenOrOdd {

public static void main(String[] args) {

int num = 9234;

while(num > 9)
{
num = num/10;
}

if(num%2 == 0)
{
System.out.println("number starts with even");
}
else
{
System.out.println("number starts with odd");
}
}
}

Output:
number starts with odd
28)
public class AverageOfEvenDigitsInNumber {

public static void main(String[] args) {

int num=934345;

int sum=0,count=0;

while(num!=0)
{
int lastDigit = num%10;

if(lastDigit%2 == 0)
{
sum=sum+lastDigit;
count++;
}
num=num/10;
}

int avg = sum/count;

System.out.println(avg);
}
}

Output:
4
29)
public class AverageOfOddDigitInNumber {

public static void main(String[] args) {

int num=1234;

int sum=0,count=0;

while(num!=0)
{
int lastDigit = num%10;

if(lastDigit%2 != 0)
{
sum=sum+lastDigit;
count++;
}
num=num/10;
}

int avg = sum/count;

System.out.println(avg);
}
}

Output:
2
30)
public class FindFactorsOfNumber {

public static void main(String[] args) {

int num=10;

for(int i=1 ; i<=num ; i++)

{
if(num%i==0)
{
System.out.println(i);
}
}

}
}

Output:
1
2
5
10
31)
public class SumOfFactorsOfNumber {

public static void main(String[] args) {

int num=65;
int sum=0;
System.out.println("factors of the given num "+num);

for(int i=1 ; i<=num ; i++)

{
if(num%i==0)
{
// System.out.println(i);

sum=sum+i;
}
}

System.out.println(sum);
}
}

Output:
factors of the given num 65
84
32)

public class ProductOfFactorsOfNumber {

public static void main(String[] args) {

int num=6 , product=1;

for(int i=1 ; i<=num ; i++)

{

if(num%i==0)
{
product = product*i;
}
}

System.out.println(product);
}
}

Output:
36
33)
public class SumOfFactorialOfDigitsInNumber {

public static void main(String[] args) {

int num=123;
int sum=0;

while(num!=0)
{
int lastdigit = num%10;
int fact =1;

for(int i=1 ; i<=lastdigit ; i++)

{
fact=fact*i;
}

System.out.println(lastdigit +" factorial is "+fact);

sum=sum+fact;

num=num/10;

System.out.println("sum of all digits factorial is "+sum);

}
}

Output:
3 factorial is 6
2 factorial is 2
1 factorial is 1
sum of all digits factorial is 9
34)
public class CheckPrimeNumberOrNot {

public static void main(String[] args) {

int num1=9;

int count1=0;

for(int i=1 ; i<=num1 ; i++)

{
if(num1%i==0)
{
count1++;
}
}

if(count1==2)
{
System.out.println(num1+" is prime number");
}
else {
System.out.println(num1 + " is not a prime number");
}

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

int num2=7;

int count2=0;

for(int i=2 ; i<num2 ; i++)

{
if(num2%i==0)
{
count2++;
}
}

if(count2==0)
{
System.out.println(num2+" is prime number");
}
else {
System.out.println(num2 + " is not a prime number");
}
}
}
Output:
9 is not a prime number
================OR===============
7 is prime number

35)
public class PrimeNumberBetweenRange {

public static void main(String[] args) {

for(int i=1 ; i<=100 ; i++)

{
int count=0;

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

{
int rem = i%j;

if(rem==0)
{
count++;
}
}

if(count==2)
{
System.out.println(i + " is a prime number");
}
}

}
}

Output:
2 is a prime number
3 is a prime number
5 is a prime number
7 is a prime number
11 is a prime number
13 is a prime number
17 is a prime number
19 is a prime number
23 is a prime number
29 is a prime number
31 is a prime number
37 is a prime number
41 is a prime number
43 is a prime number
47 is a prime number
53 is a prime number
59 is a prime number
61 is a prime number
67 is a prime number
71 is a prime number
73 is a prime number
79 is a prime number
83 is a prime number
89 is a prime number
97 is a prime number

36)
public class PrintHcfofNumbers {

public static void main(String[] args) {

int n1=36 , n2=60, gcd=1;

for(int i=1 ; i<=n1 && i<=n2 ; i++)

{
if(n1%i == 0 && n2%i==0)
{
gcd=i;
}
}

System.out.println("GCD is "+gcd);
}
}

Output:
GCD is 12
37)
public class PrintLcmOfNumbers {

public static void main(String[] args) {

int n1=2 , n2=3,lcm=0;

for(int i=1 ; i<=n1*n2 ; i++)

{
if(i%n1 == 0 && i%n2==0)
{
lcm=i;

break;
}
}

System.out.println(lcm);
}
}

Output:
6
38)

public class CheckXylemNumOrPholemNum {

public static void main(String[] args) {

int num=12345;

int originalNum = num;

int extremeSum=0, middleSum=0;

int lastdigit = num%10;

extremeSum = extremeSum+lastdigit;

num=num/10;

while(num>9)
{
int midele = num%10;

middleSum = middleSum+midele;

num = num/10;

extremeSum = extremeSum+num;

if(extremeSum == middleSum)
{
System.out.println(originalNum +" is a xylem number");
}
else {
System.out.println(originalNum +" is a pholem number");
}

Output:
12345 is a pholem number
39)
public class CheckHappyNumOrSadNumber {

public static void main(String[] args) {

int n=20;

while(true)
{

int sum = 0;

while(n!=0)
{
int rem=n%10;
int square = rem*rem;
sum = sum+square;
n=n/10;
}

if(sum==1)
{
System.out.println("Happy number");
break;
}
else if (sum==4){
System.out.println("sad number");
break;
}
n=sum;
}
}
}

Output:
sad number
40)
public class PrintFibonacciSeriesForNNoOfterms {

public static void main(String[] args) {

int n1=0,n2=1,sum=0;

System.out.print(n1 + " "+n2);

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

{
sum=n1+n2;

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

n1=n2;
n2=sum;
}

}
}

Output:
0 1 1 2 3 5 8 13 21 34
41)
public class FibonacciSeriesBtwTheRange {

public static void main(String[] args) {

int n1=0,n2=1,n3=0,start=5 ,end=50;

for(int i=start ; i<=end ; i++)

{
if(n1>=start && n1<=end)
{
System.out.println(n1);
}

n3 = n1+n2;
n1=n2;
n2=n3;

}
}
}

Output:
5
8
13
21
34

42)
public class NthFibonacciNumber {

public static void main(String[] args) {

int n1=0,n2=1,n3=0;

int target = 6;

for(int i=1 ; i<target ; i++)

{
n3 = n1+n2;
n1=n2;
n2=n3;
}

System.out.println(n1);
}
}

Output:
5
43)
public class CheckSunnyNumberOrNot {

public static void main(String[] args) {

int n=6;

int n1 = n+1;

boolean flag=false;

for(int i=1 ; i<=n1/2 ; i++)

{

if(n1 == i*i)
{
flag = true;
break;
}
}

if(flag == true)
{
System.out.println(n+" sunny number");
}
else{
System.out.println(n+" not a sunny number");
}

Output:
6 not a sunny number
44)
public class CheckNeonNumberOrNot {

public static void main(String[] args) {

int num=9;

int square = num*num;

int sum=0;

while(square !=0 )
{
int lastdigit = square%10;

sum = sum+lastdigit;

square = square/10;
}

if(sum == num)
{
System.out.println(num + " is a neon number");
}
else {
System.out.println(num + " is not a neon number");
}
}
}

Output:
9 is a neon number
45)
public class CheckCompositeNumberOrNot {

public static void main(String[] args) {

int num=3,count=0;

for(int i=1 ; i<=num ; i++)

{
if(num%i == 0)
{
count++;
}
}

if(count > 2)
{
System.out.println("given number is composite number");
}
else {

System.out.println("given number is not composite

number");

}
}
}

Output:
given number is not composite number
50)
public class PrintCompositeNumberBtwRange {

public static void main(String[] args) {

for(int i=1 ; i<=100 ; i++)

{
int count=0;

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

{
if(i%j == 0)
{
count++;
}
}

if(count > 2)
{
System.out.println(i);
}
}
}
}

Output:
4
6
8
9
10
12
14
15
16
18
20
21
22
24
25
26
27
28
30
32
33
34
35
36
38
39
40
42
44
45
46
48
49
50
51
52
54
55
56
57
58
60
62
63
64
65
66
68
69
70
72
74
75
76
77
78
80
81
82
84
85
86
87
88
90
91
92
93
94
95
96
98
99
100
51)
public class FingPrimeDigitsInNumber {

public static void main(String[] args) {

int num = 239574;

while(num!=0)
{
int rem = num%10;

int count=0;

for(int i=1 ; i<=rem ; i++)

{
if(rem%i == 0)
{
count++;
}
}

if(count==2)
{
System.out.println(rem);
}

num=num/10;
}
}
}

Output:
7
5
3
2
52)
public class CheckSpyNumberOrNot {

public static void main(String[] args) {

int num=357, sum=0 , product=1, temp =num;

while(num!=0)
{
int lastDigit = num%10;

sum = sum+lastDigit;

product = product*lastDigit;

num=num/10;//num/=10

if(sum==product)
{
System.out.println(temp + " spy number");
}
else {
System.out.println(temp + " is not a spy number");
}
}
}

Output:
357 is not a spy number
53)
public class ReverseTheNumber {

public static void main(String[] args) {

int num=9763;

int rev=0;

while(num!=0)
{
int lastdigit = num%10;

rev = rev*10+lastdigit;

num=num/10;
}

System.out.println(rev);
}
}

Output:
3679
54)
public class PalindromeNumberOrNot {

public static void main(String[] args) {

int num=123321, temp = num , rev=0;

while(num!=0)
{
int lastdigit = num%10;
rev= rev*10+lastdigit;
num=num/10;
}

if(rev==temp)
{
System.out.println(temp + " is a palindrome");
}
else {
System.out.println(temp + " is not a palindrome");
}

}
}

Output:
123321 is a palindrome
55)

public class CheckPerfectNumberOrNot {

public static void main(String[] args) {

int num=28 , sum=0;

for(int i=1 ; i<num ; i++)

{
int rem=num%i;

if(rem==0)
{
sum=sum+i;
}
}

if(sum==num)
{
System.out.println(num+" perfect number");
}
else {
System.out.println(num+" not a perfect number");
}
}
}

Output:
28 perfect number
56)
public class CheckArmStrongNumberOrNot {

public static void main(String[] args) {

int num=1634, n1=num, n2=num;

int count=0;

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

int sum=0;

while(n1!=0)
{
int lastdigit=n1%10;
int pow=1;

for(int i=1 ; i<=count ; i++)

{
pow = pow *lastdigit;
}

sum=sum+pow;

n1=n1/10;
}

System.out.println(sum);

if(sum == n2)
{
System.out.println("Arm strong number");
}
else {
System.out.println("not Arm strong number");
}
}
}

Output:
1634
Arm strong number
57)
public class CheckPerfectSqaureOrNot {

public static void main(String[] args) {

int num=13;
int flag=0;
for(int i=1 ; i*i<=num ;i++)
{
int square= i*i;

if(square == num)
{
flag++;
System.out.println(num + " is a perfect square");
}

if(flag ==0)
{

System.out.println(num + " not is a perfect square");

}
}
}

Output:
13 not is a perfect square
58)
public class CheckBuzzNumberOrNot {

public static void main(String[] args) {

int num = 47;

if(num%7==0 || num%10==7)
{
System.out.println("Buzz Number");
}
else {
System.out.println("not a Buzz Number");
}
}
}

Output:
Buzz Number
59)
public class CheckAutomorphicNumberOrNot {

public static void main(String[] args) {

int num=6;

int square = num*num;

while(num!=0)
{
int rem1 = num%10;
int rem2 = square%10;

if(rem1 == rem2)
{
num = num/10;
square = square/10;
}
else {
break;
}
}

if(num==0)
{
System.out.println("automorphic number");
}
else
{
System.out.println(" not automorphic number");
}
}
}

Output:
automorphic number
60)
public class CheckTechNumberOrNot
{
public static void main(String[] args) {

int n=3025,n1=n,c=0;
while(n!=0) {
n=n/10;
c++;
}
if(c%2==0) {
int d=1;
for(int i=1;i<=c/2;i++) {
d=d*10;
}
int last=n1%d;
int first=n1/d;
int sum=first+last;
int sq=sum*sum;
if(sq==n1) {
System.out.println("Tech Number");
}
else {
System.out.println("Not a Tech Number");
}
}
else {
System.out.println("Not a Tech Number");
}
}
}

Output:
Tech Number