Scribd
Upload
12 views10 pages

Logicals

The document contains Java code snippets for various programs including programs to check prime numbers, check leap years, find factors of a number, calculate factorials using recursion and iteration, find the sum and count of digits in a number, check for palindrome numbers and strings, reverse a number, check for Armstrong numbers, check for Armstrong numbers with user input, and print the Fibonacci series up to a given range.

Uploaded by

pc651719
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
12 views10 pages

Logicals

The document contains Java code snippets for various programs including programs to check prime numbers, check leap years, find factors of a number, calculate factorials using recursion and iteration, find the sum and count of digits in a number, check for palindrome numbers and strings, reverse a number, check for Armstrong numbers, check for Armstrong numbers with user input, and print the Fibonacci series up to a given range.

Uploaded by

pc651719
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 10

***********WAP to check Prime Number : ************

import java.util.Scanner;
class PrimeNumber
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter the number to check it is prime or not : ");
int num = s.nextInt();
int count=0;
for(int i =1; i<=num;i++)
{
if(num%i==0)
{
count++;
}
}
if(count==2)
{
System.out.println(num+" is a prime number.");
}
else
System.out.println(num+" is not a prime number.");

}
}
***********************************************************************************
************************************************
*****************WAP for Leap Year***********************************
import java.util.Scanner;
class LeapYear
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter the Year : ");
int year = s.nextInt();

if(year%400==0)
{
System.out.println(year+" is a Leap Year");
}
else if(year%4==0 && year%100!=0)
{
System.out.println(year+" is a Leap year");
}
else
{
System.out.println("Not a leap year");
}
}
}
***********************************************************************************
***************************************************
***********************WAP for Factors**************************
//WAJP to read a number from the user and find the factors of that number.
import java.util.Scanner;
class Factors
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter the number to find the factorial of the
number : ");
int num = s.nextInt();
for(int i =1; i<=num;i++)
{
if(num%i==0)
{
System.out.println(i);
}
}
}
}
***********************************************************************************
*****************************************************
********************WAP for Factorial*******************************
import java.util.Scanner;
class Factorial
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter the number to find the factorial of a
number : ");
int num = s.nextInt();
int fact = 1;
for(int i = 1; i<=num ; i++)
{
fact = fact*i;
}
System.out.println("The factorial of given number is : "+fact);
}
}
***********************************************************************************
*****************************************************
**************WAP for Factorial Recursion******************************
class FactorialRecursive
{
static int Factorial(int a)
{
if(a == 1)
{
return 1;
}
else
{
return a*Factorial(a-1);
}
}
public static void main(String[] args)
{

System.out.println(Factorial(4));
}
}
***********************************************************************************
***************************************************
***************WAP Sum of Digits***************************************
import java.util.Scanner;
class SumOfDigit
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter a number : ");
int num = s.nextInt();
int sum=0;
for (int i=num;i!=0 ;i=i/10 )
{
int rem = i%10;
sum+=rem;
}
System.out.println("Sum : "+sum);
}
}
***********************************************************************************
**********************************************
******************WAP Count the digits***************************
import java.util.Scanner;
class CountOfDigit
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter the number to find the count of the number : ");
int num = s.nextInt();
int count=0;
for(int i=num; i!=0; i=i/10)
{
count++;
}
System.out.println("The count of digits in the number is : "+count);
}
}
***********************************************************************************
*********************************************
****************WAP to Palindrome Number****************************
import java.util.Scanner;
class Palindrome
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter the number : ");
int n = s.nextInt();
int rev=0;
for (int i=n;i!=0;i=i/10)
{
int rem=i%10;
rev=rev*10+rem;

}
System.out.println("Reverse Number : "+rev);
if(n==rev)
{
System.out.println("Palindrome number ");
}
else
System.out.println("Not a palindrome number ");
}
}
***********************************************************************************
*******************************************
****************WAP to Palindrome String****************************
import java.util.Scanner;
class PalindromeString1
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter a string : ");
String str = s.next();
String str2 ="";
for (int i=str.length()-1; i>=0 ;i-- )
{
str2+=str.charAt(i);
}
System.out.println(str);
System.out.println(str2);

if (str.equals(str2))
{
System.out.println("Palindrome String");
}
else
System.out.println("Not a Palindrome String");

}
}
***********************************************************************************
****************************************************
**********************WAP to reverse a Number*****************************
import java.util.Scanner;
class ReverseNumber
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter the Number : ");
int num = s.nextInt();
int rev=0;
for (int i=num;i!=0 ;i=i/10 )
{
int rem = i%10;
rev = rev*10+rem;
}
System.out.println(rev);
}
}
***********************************************************************************
****************************************************
****************WAP for Armstrong Number************************
import java.util.Scanner;
class Armstrong
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter a number : ");
int num = s.nextInt();
int cube=0;
for(int i=num;i!=0;i=i/10)
{
int rem = i%10;
cube = cube+(rem*rem*rem);
}
System.out.println("cube : "+cube);
if(cube==num)
System.out.println("Armstrong Number");
else
System.out.println("Not a Armstrong number");
}
}
***********************************************************************************
**********************************************************
******************WAP for Armstrong Number User Input**********************
import java.util.Scanner;
class ArmstrongNumber
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter a number to check whether it is armstrong or
not : ");
int num = s.nextInt();
int count =0;
int sum =0;
int power = 1;
for (int i=num;i!=0 ;i=i/10 )
{
count++;
}

for (int j=num; j!=0 ;j=j/10 )


{
int rem = j%10;
sum += (Math.pow(rem,count));
}
System.out.println(power);
System.out.println("Sum of power : "+sum);
if (num==sum)
{
System.out.println("Armstrong Number ");
}
else
System.out.println("Not a Armstrong Number");

}
}
***********************************************************************************
**********************************************************
*********************WAP for Fibonacci Series*******************************
import java.util.Scanner;
class FibonacciSeries
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter the range : ");
int range = s.nextInt();

int num1=0;
int num2=1;
int num3;
System.out.print(num1+" ");
System.out.print(num2+" ");

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


{
num3 = num1+num2;
System.out.print(num3+" ");
num1=num2;
num2=num3;
}

}
}
***********************************************************************************
************************************************************
****************************WAP Smallest of 3
number*********************************
class SmallestNumber
{
public static void main(String[] args)
{
int n1=10;
int n2=5;
int n3=3;

System.out.println(n1<n2?n1<n3?n1:n3:n2<n3?n2:n3);
}
}
***********************************************************************************
************************************************************

****************************WAP Largest of 3
number*********************************
class LargestNumber
{
public static void main(String[] args)
{
int n1=10;
int n2=50;
int n3=300;

System.out.println(n1>n2?n1>n3?n1:n3:n2>n3?n2:n3);
}
}
***********************************************************************************
****************************************************************
****************************WAP Smallest of 3 number using if
*********************************
import java.util.Scanner;
class SmallestOfThreeDigit
{
public static void main(String[] args)
{
Scanner s =new Scanner(System.in);
System.out.println("Enter the number :");
int a =s.nextInt();
int b =s.nextInt();
1int c =s.nextInt();
if(a<b && a<c)
{
System.out.println(a+" is smallest number.");
}
else if(b<a && b<c)
{
System.out.println(b+" is smallest number.");
}
else if(c<b && c<a)
{
System.out.println(c+" is smallest number.");
}
}
}
***********************************************************************************
***********************************************************
********************************Power of a number*************************
import java.util.Scanner;
class Power
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter a number : ");
int num = s.nextInt();
System.out.println("Enter a power : ");
int p = s.nextInt();
int power=1;
for (int i=1;i<=p ;i++ )
{
power = power*num;
}
System.out.println(power);
}
}
***********************************************************************************
********************************************************
****************************Neon Number****************************************
//Neon Number : 9 ==>> square ==>> 81 ==>>8+1==>>9

import java.util.Scanner;
class NeonNumber
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter the number : ");
int num = s.nextInt();

int square = num*num;


int sum=0;
for (int i=square ; i!=0 ; i=i/10 )
{
int rem = i%10;
sum+=rem;
}
System.out.println("Square : "+square);
System.out.println("Sum : "+sum);

if (sum==num)
{
System.out.println("Neon Number");
}
else
System.out.println("Not a Neon Number");
}
}
***********************************************************************************
*********************************************************
***********************Spy Number*****************************
//Spy Number : 123 ==>> 1+2+3 & 1*2*3 ===>>6
import java.util.Scanner;
class SpyNumber
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter a number : ");
int num=s.nextInt();

int sum=0;
int prod=1;
for (int i=num;i!=0 ;i=i/10 )
{
int rem = i%10;
sum+=rem;
prod*=rem;
}
System.out.println("Sum of Digit : "+sum);
System.out.println("Product of Digit : "+prod);

if (sum==prod)
{
System.out.println("Spy Number");
}
else
System.out.println("Not a Spy Number");

}
}
***********************************************************************************
****************************************************
***********************Strong Number*******************************
//Strong Number : 145 ==>> 1! + 4! + 5! ===>>145

import java.util.Scanner;
class StrongNumber
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter a number : ");
int num = s.nextInt();
int sum=0;

for (int i=num;i!=0 ;i=i/10 )


{
int rem = i%10;
int fact=1;
for (int j=1;j<=rem ;j++ )
{
fact*=j;
}
sum+=fact;
}
if (num==sum)
{
System.out.println("Strong Number");
}
else
System.out.println("Not a Strong Number");

}
}
***********************************************************************************
****************************************************
***********************************Perfect Number**********************************
//Perfect Number : 6 ==>>factors except 6 ===>>> 1+2+3 //28>>perfectNo

import java.util.Scanner;
class PerfectNumber
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
System.out.println("Enter a Number : ");
int num = s.nextInt();
int sum=0;

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


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

if (sum==num)
{
System.out.println("Perfect Number");
}
else
System.out.println("Not a Perfect Number");

}
}
***********************************************************************************
***************************************************

You might also like