Assignment Programs
1. WAP to check the given number is positive or negative?
package com.javaproblems.assignment;
public class ArmstrongNumber {
public int ArmstrongNumber(int num) {
int originalnum = num;
int count = 0;
//this while loop is to count the digits in the number assigned
while(num!=0) {
num = num/10;
count++;
}
int num2 = 0;
int finalnum = 0;
//This while loop is to calculate the given numbe is armstrong number or not
while(originalnum!=0) {
int digit = originalnum%10;//takes first digit from the number
num2 = (int) Math.pow(digit, count);//stores the power of number
finalnum = finalnum+num2;
originalnum = originalnum/10;//removes the last digit fromt the number
}
return finalnum;
public static void main(String[] args) {
ArmstrongNumber asn = new ArmstrongNumber();
int num = 153;
int finalnum = asn.ArmstrongNumber(num);
if(finalnum == num) {
System.out.println("You have entered an armstrong number:"+num);
}
else if(finalnum != num) {
System.out.println("Not an armstrong number:"+num);
}
}
2. WAP for Palindrome
package com.javaproblems.assignment;
public class Palindrome {
static int num = 131;
static int originalnum = num;
private int reverseNumber() {
// TODO Auto-generated method stub
int reverse = 0;
while (num!=0) {
int digit = num %10;//takes the last digit from the number
reverse = reverse * 10 + digit;//
num = num/10;
}
return reverse;
}
private void palindromeCheck(int rev, int originalnum) {
// TODO Auto-generated method stub
//System.out.println(rev);
if(rev == originalnum) {
System.out.println("This number is a palindrome: "+originalnum);
}
else {
System.out.println("This number is Not a palindrome: "+originalnum);
}
}
public static void main(String[] args) {
Palindrome p = new Palindrome();
int rev = p.reverseNumber();
// System.out.println(rev);
// System.out.println(orginalnum);
p.palindromeCheck(rev, originalnum);
}
}
3. WAP For Armstrong Number
package com.javaproblems.assignment;
public class ArmstrongNumber {
public int ArmstrongNumber(int num) {
int originalnum = num;
int count = 0;
//this while loop is to count the digits in the number assigned
while(num!=0) {
num = num/10;
count++;
}
int num2 = 0;
int finalnum = 0;
//This while loop is to calculate the given numbe is armstrong number or not
while(originalnum!=0) {
int digit = originalnum%10;//takes first digit from the number
num2 = (int) Math.pow(digit, count);//stores the power of number
finalnum = finalnum+num2;
originalnum = originalnum/10;//removes the last digit fromt the number
}
return finalnum;
public static void main(String[] args) {
ArmstrongNumber asn = new ArmstrongNumber();
int num = 153;
int finalnum = asn.ArmstrongNumber(num);
if(finalnum == num) {
System.out.println("You have entered an armstrong number:"+num);
}
else if(finalnum != num) {
System.out.println("Not an armstrong number:"+num);
}
}
4. WAP to check given data is digit or not.
package com.javaproblems.assignment;
public class DigitCheck {
private void checkDigitOrNot(int num) {
// TODO Auto-generated method stub
if(num<10) {
System.out.println("This is a digit: "+num);
}
else {
System.out.println("Not a digit: "+num);
}
}
public static void main(String[] args) {
int num = 2;
DigitCheck dc = new DigitCheck();
dc.checkDigitOrNot(num);
}
}
5. WAP For Prime Number
package com.javaproblems.assignment;
public class PrimeNumberCheck {
static int count=0;
private void primeNumber(int num) {
// TODO Auto-generated method stub
for(int i = 1;i<=num;i++) {
if(num%i==0) {
count++;
}
}
if(count==2) {
System.out.println("This is a prime number: "+num);
}
else {
System.out.println("Not a prime number: "+num);
}
}
public static void main(String[] args) {
int num = 293;
PrimeNumberCheck pnc = new PrimeNumberCheck();
pnc.primeNumber(num);
}
6. WAP For Fibonacci series
package com.javaproblems.assignment;
import java.util.Scanner;
public class FibonacciSeries {
public void fibonacciSequence(int num) {
int i = 1;
int num2= 0;int num3 = 1;
while( i<=num) {
System.out.print(num2+","+num3+",");
num2 = num2+num3;
num3 = num3+num2;
i++;
if(num3>num && num2<num) {
System.out.print(num2);
break;
}
else if(num2>num && num3>num) {
break;
}
}
}
public static void main(String[] args) {
Scanner st = new Scanner(System.in);
System.out.println("Please enter your desired fibonacci sequence range\n->");
int num = st.nextInt();
FibonacciSeries fs = new FibonacciSeries();
fs.fibonacciSequence(num);
}
}
7. WAP For Swapping of 2 numbers
package com.javaproblems.assignment;
public class SwappingOfNumbers {
static int num3;
public static void main(String[] args) {
int num1 = 10;
int num2 = 20;
System.out.println("Before Swap num1 = "+num1+" Before swap num2 = "+num2);
int num3 = num2;
num2 = num1;
num1 = num3;
System.out.println("After Swap num1 = "+num1+" After swap num2 = "+num2);
8. WAP For Swapping of 2 numbers without using 3rd
variable.
package com.javaproblems.assignment;
public class SwappingOfNumbersWithoutTemporaryVar {
public static void main(String[] args) {
int num1 = 50;
int num2 = 100;
System.out.println("Before Swap num1 = "+num1+" Before swap num2 = "+num2);
num1 = num1+num2;//150
num2 = num2-num1;//50
num1 = num1+num2;//100
if(num1<0) {
num1 = num1*-1;
}
else if(num2<0) {
num2 = num2*-1;
}
System.out.println("After Swap num1 = "+num1+" After swap num2 = "+num2);
}
}
9. WAP For Multiplication Table.
package com.javaproblems.assignment;
public class MulitplicationTable {
public static void main(String[] args) {
// TODO Auto-generated method stub
int num = 2;
for(int i = 1;i<=10;i++) {
System.out.println(num+" "+"x"+" "+i+" "+"="+" "+num*i);
}
}
}
10. WAP to check biggest or smallest number
package com.javaproblems.assignment;
public class BiggestOrSmallestNumChk {
private void bigOrSmallNumberChk(int num1,int num2) {
if(num1>num2) {
System.out.println("Number 1 is Biggest: "+num1+"\n"+"Number 2 is Smallest:
"+num2);
}
else if(num2>num1) {
System.out.println("Number 2 is Biggest: "+num2+"\n"+"Number 1 is Smallest:
"+num1);
}
else if(num1==num2) {
System.out.println("Both numbers are equal: "+num1+", "+num2);
}
}
public static void main(String[] args) {
int num1 = 100;
int num2 = 100;
System.out.println("The Num1 is: "+num1+" and "+"Num2 is: "+num2);
BiggestOrSmallestNumChk bg = new BiggestOrSmallestNumChk();
bg.bigOrSmallNumberChk(num1,num2);
