List of 25 logical Programs



1) Reverse number-

public class PallindromeDemo1

{

public static void main(String[] args)

{

int rev=0, Remainder, number=121;

while (number!=0)

{

Remainder = number%10;

number = number/10;

rev = (rev*10)+Remainder;

}

System.out.println("Reverse number is="+rev);

}

}

Output----

Reverse number is=121

----------------------------

----------------------------

2)Check the number is palindrome or not. take value form users.

public class PalindromeDemo2

{

public static void main(String[] args)

{

int reverse=0, remainder, number;

Scanner sc = new Scanner(System.in);

System.out.println("type the any number");

number = sc.nextInt();

int temp = number;

while(number!=0)

{

remainder = number%10;

number = number/10;

reverse = (reverse*10)+remainder;

}

if(reverse == temp)

{

System.out.println("This is a Palindrome number");

}

else

{

System.out.println("This is not palindrome number ");

}

}

}

Output----

type the any number

454

This is a Palindrome number

----------------------------

----------------------------

3)print the palindrome numbers between 0-200

public class PalindromeDemo3

{

public static void main(String[] args)

{

int remainder, reverse=0, number=1;

//int temp = number;

ArrayList palindrome = new ArrayList();

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

{

number = i;

while(number!=0)

{

remainder = number%10;

number = number/10;

reverse = (reverse*10)+remainder;

}

if(i==reverse)

{

palindrome.add(i);

}

reverse=0;

}

System.out.println(palindrome);

}

}

Output----

[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191]

----------------------------

----------------------------

4)write aprogram to find palindrome numbers in a range given by users.

public class PalindromeDemo4

{

public static void main(String[] args)

{

Scanner sc = new Scanner(System.in);

ArrayList palindrome = new ArrayList();

int startNumber, endNumber, reverse=0, remainder, number;

System.out.println("Enter start Number=");

startNumber = sc.nextInt();

System.out.println("Enter end Numer=");

endNumber = sc.nextInt();

for(int i=startNumber; i<=endNumber; i++)

{

number=i;

while(number!=0)

{

remainder = number%10;

number = number/10;

reverse = (reverse*10)+remainder;

}

if(i==reverse)

{

palindrome.add(i);

}

reverse = 0;

}

System.out.println(palindrome);

}

}

Output----

Enter start Number=

23

Enter end Numer=

455

[33, 44, 55, 66, 77, 88, 99, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, 222, 232, 242, 252, 262, 272, 282, 292, 303, 313, 323, 333, 343, 353, 363, 373, 383, 393, 404, 414, 424, 434, 444, 454]

----------------------------

----------------------------

5) reverse the line in given string.

public class ReverseString

{

public static void main(String[] args)

{

StringBuilder a = new StringBuilder("Don't take revenge. let Karma do all the work");

System.out.println(a);

System.out.println(a.reverse());

System.out.println(a);

}

}

Output----

Don't take revenge. let Karma do all the work

krow eht lla od amraK tel .egnever ekat t'noD

krow eht lla od amraK tel .egnever ekat t'noD

----------------------------

----------------------------

6) reverse the word in given string

public class reverseString2

{

public static void main(String[] args)

{

String blogName = "let's karma do the work";

StringBuilder reverseString = new StringBuilder();

String[] words = blogName.split(" ");

for (String word : words)

{

String reverseWord = new StringBuilder(word).reverse().toString();

reverseString.append(reverseWord + " ");

}

System.out.println( reverseString.toString().trim() );

}

}

Output----

s'tel amrak od eht krow

----------------------------

----------------------------

7) Print even numbers between 0-25

public class evenNumbers

{

public static void main(String[] args)

{

ArrayList al =new ArrayList();

for (int i=0; i<25; i++)

{

if(i%2==0)

{

al.add(i);

}

}

System.out.println("even number is=" + al);

}

}

Output----

even number is=[0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24]

----------------------------

----------------------------

8)Print odd numbers between 0-25

public class OddNumbers

{

public static void main(String[] args)

{

ArrayList al = new ArrayList();

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

{

if(i%2==1)

{

al.add(i);

}

}

System.out.println("Odd number is="+al);

}

}

Output----

Odd number is=[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25]

----------------------------

----------------------------

9)Check the given number is odd or even.

public class CheckOddEvenNumbers

{

public static void main(String[] args)

{

int number;

Scanner sc = new Scanner(System.in);

System.out.println("enter the number");

number = sc.nextInt();

if(number%2==0)

{

System.out.println("This number is even");

}

else

{

System.out.println("This number is odd");

}

}

}

Output----

enter the number

24

This number is even

----------------------------

----------------------------

10)print the eprime numbers between 1-50

public class PrimeNumber

{

public static void main(String[] args)

{

int i, j;

String primeNumbers ="";

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

{

int counter = 0;

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

{

if(i%j==0)

{

counter = counter + 1;

}

}

if(counter == 2)

{

primeNumbers = primeNumbers + i+" ";

}

}

System.out.println("Prime number is="+primeNumbers);

}

}

Output----

Prime number is=2 3 5 7 11 13 17 19 23 29 31 37 41 43 47

----------------------------

----------------------------

11) write a factorial Program using loop.

public class FactorialNumber

{

public static void main(String[] args)

{

int i, Factorial=1, number;

Scanner sc = new Scanner(System.in);

System.out.println("Enter the number=");

number = sc.nextInt();

for (i=number; i>=1; i--)

{

Factorial= Factorial * i;

}

System.out.println("Factorial number is="+Factorial);

}

}

Output----

Enter the number=

7

Factorial number is=5040

----------------------------

----------------------------

12)print 1 to 10 factorial numbers.

public class factorialNumber2

{

public static void main(String[] args)

{

int fact=1, j=1;

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

{

while(j<=i)

{

fact = fact * j;

j++;

}

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

}

}

}

Output----

factorial 1 is = 1

factorial 2 is = 2

factorial 3 is = 6

factorial 4 is = 24

factorial 5 is = 120

factorial 6 is = 720

factorial 7 is = 5040

factorial 8 is = 40320

factorial 9 is = 362880

factorial 10 is = 3628800

----------------------------

----------------------------

13) check the given number is palindrome or not.

public class ArmstrongNumber

{

public static void main(String[] args)

{

int a, c=0, temp, number=153;

temp=number;

while(number>0)

{

a = number%10;

number = number/10;

c=c+(a*a*a);

}

if(temp==c)

{

System.out.println("This is a armstrong number");

}

else

{

System.out.println("This is not armstrong number");

}

}

}

Output----

This is a armstrong number

----------------------------

----------------------------

14)print the armstrong number between 1-500.

public class AramstrongNumber2

{

public static void main(String[] args)

{

int remainder, number, sum=0;

System.out.println("Armstrong number is = ");

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

{

number = i;

while (number > 0)

{

remainder= number%10;

number = number/10;

sum = sum + (remainder*remainder*remainder);

}

if(i==sum)

{

System.out.println(i);

}

sum = 0;

}

}

}

Output----

Armstrong number is =

1

153

370

371

407

----------------------------

----------------------------

15)remove the duplicates from string

public class RemoveDuplicateChar

{

public static void main(String[] args)

{

String stringWithDuplicates = "afsjeadrffafvgdefeverhfgberAAad";

char[] characters = stringWithDuplicates.toCharArray();

Set set=new HashSet();

StringBuilder sb = new StringBuilder();

System.out.println("String with duplicates : " + stringWithDuplicates);

for (char c : characters)

{

if (!set.contains(c))

{

set.add(c);

sb.append(c);

}

}

System.out.println("String after duplicates removed : " + sb.toString());

}

}

Output----

String with duplicates : afsjeadrffafvgdefeverhfgberAAad

String after duplicates removed : afsjedrvghbA

----------------------------

----------------------------










For More Information follow us