Practical 9

/**Write a Java Program 

1.Check for Positive or Negative Number.
2.Check for Odd or Even Number.
3.Check for Prime Number.
4.Check for Palindrome Number.
5.Check for Armstrong Number.
6.Check for Number whether a member of Fibonacci Series.
7.Exit
*/

/*Create abstract methods for every check into abstract proto1 class and define into defi1 class and call from menu1 class.*/

import java.io.*;
abstract class proto1
{
abstract void posneg(int a);
abstract void odev(int b);
abstract void pri(int c);
abstract void pal(int d);
abstract void arm(int e);
abstract void fib(int x);
}
class defi1 extends proto1
{
void posneg(int a)
{
if(a>0)
System.out.println(a+" Positive Number.");
else
System.out.println(a+" Negative Number.");
}
void pri(int c)
{
int i, flag = 0;
for(i=2; i<=c/2; ++i)
{
     
if(c%i==0)
{
flag=1;
break;
}
}

if (flag==0)
        System.out.println(c+" is a prime number.");
else
        System.out.println(c+" is not a prime number.");
}
void arm(int e)
{
int n,rt,r=0;
n = e;

while (n!= 0)
{
        rt = n%10;
        r += rt*rt*rt;
        n /= 10;
}

if(r == e)
        System.out.println(e+" is an Armstrong number.");
else
        System.out.println(e+" is not an Armstrong number.");
}
void fib(int x)
{
int firstTerm = 0;
int secondTerm = 1;
int thirdTerm = 0;
while (thirdTerm < x)
{
thirdTerm = firstTerm + secondTerm;
firstTerm = secondTerm;
secondTerm = thirdTerm;
}
if(thirdTerm == x)
{
System.out.println("Number belongs to Fibonacci series");
}
else
{
System.out.println("Number doesn't belongs to Fibonacci series");
}
}
void pal(int d)
{
int r,temp,sum=0;
temp=d; 
while(d>0)
{ 
r=d%10;
sum=(sum*10)+r; 
d=d/10; 
} 
if(temp==sum) 
System.out.println("palindrome number "); 
else 
System.out.println("not palindrome"); 
}
void odev(int b)
{
if(b%2==0)
System.out.println(b+" is Even Number.");
else
System.out.println(b+" Is Odd Number.");
}
}
public class menu1
{
public static void main(String args[]) throws IOException
{
defi1 df=new defi1();
DataInputStream in=new DataInputStream(System.in);
int i,n,flag=1;
System.out.print("Enter Any Positive Number: ");
n=Integer.parseInt(in.readLine());
while(flag==1)
{
System.out.println("1.Check for Positive or Negative Number.\n2.Check for Odd or Even Number.\n3.Check for Prime Number.\n4.Check for Palindrome Number.\n5.Check for Armstrong Number.\n6.Check for Number whether a member of Fibonacci Series.\n7.Exit");
System.out.print("\nEnter Your Choice: ");
i=Integer.parseInt(in.readLine());
switch(i)
{
case 1:df.posneg(n);
break;
case 2:df.odev(n);
break;
case 3:df.pri(n);
break;
case 4:df.pal(n);
break;
case 5:df.arm(n);
break;
case 6:df.fib(n);
break;
case 7:flag=0;
break;
default:System.out.println("Thank You.!");
break;
}
}
}
}