CALCULATE FEET AND INCHES TO CENTIMETRES

 Create a method called calcFeetAndInchesToCentimeters.It needs to have two parameters feet and inches.You should validate the first parameter feet is >=0 and inches is >=0 and <=12 which return -1 from the method if either of the above is not true. If parameters are valid, then how many centimeters comprises the feet and inches passed to this method and return that value.Create a 2nd method of the same name but with only one parameter inches. validate that it is >=0, return -1 if false. But if its valid, then  calculate how many feets are in inches and here is the tricky part call the other overloaded method passing the correct feet and inches calculated so that it can calculate correctly.
HINTS: Use 1inch = 2.54 cm and 1ft = 12inches.

Soln:
 package com.cnc;

public class Main {

    public static void main(String[] args) {
       calcFeetAndInchesToCentimeters(3,1 );
       calcFeetAndInchesToCentimeters(-1,3);
       calcFeetAndInchesToCentimeters(100);
    }
    public static double calcFeetAndInchesToCentimeters(double feet,double inches){
        if((feet<0) || (inches<0) && (inches>12)){
            System.out.println("INVALID");
            return -1;
        }else{
           double a = 30.48*feet;
           a += 2.54*inches;
          System.out.println(feet+" feet, = "+a + inches +" inches = "+a+" cm");
           return a;

        }
    }

    public static double calcFeetAndInchesToCentimeters(double inches){
       if(inches<0){
           return -1;
       }
       double feet = (int) inches/12;
       double reaminingInches= (int) inches % 12;
        System.out.println(inches +" inches is equal to "+ feet+" feet and "
                +reaminingInches);
        return calcFeetAndInchesToCentimeters(feet,inches);
    }

}

Popular posts from this blog

NUMBER PALINDROME CHALLENGE

  package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( isPalindrome ( 101 )); } public static boolean isPalindrome ( int number) { int reverse = 0 ; int temporaryNumber =number; while (number!= 0 ){ reverse = reverse* 10 + number% 10 ; number = number/ 10 ; } if (reverse== temporaryNumber ) return true ; else return false ; } }
Read more

ENCAPSULATION CHALLENGE

package com.cnc ; public class Main { public static void main ( String [] args) { Printer printer = new Printer( 50 , true ); System . out .println( "Initial Page count is " + printer .getNumberOfPages()); int pagesPrinted = printer .getNumberOfPages( 4 ); } } package com.cnc ; public class Printer { private int tonerLevel = 100 ; private int numberOfPages ; private boolean isDuplex ; public Printer ( int tonerLevel, boolean isDuplex) { if (tonerLevel>=- 1 && tonerLevel<= 100 ) { this . tonerLevel = tonerLevel; } else { this . tonerLevel =- 1 ; } this . isDuplex = isDuplex; this . numberOfPages = 0 ; } public int addToner ( int tonerAmount){ if (tonerAmount> 0 && tonerAmount<= 100 ){ if ( this . tonerLevel +tonerAmount > 100 ){ return - 1 ; } this . tonerLevel += tonerAmount
Read more

LARGEST PRIME FACTOR OF A NUMBER

package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( getLargestPrime ( 20 )); System . out .println( getLargestPrime ( 7 )); } public static int getLargestPrime ( int number){ int i,stored=number; if (number<= 0 ) return - 1 ; else if ( isPrime (number)){ number=stored; } else { for ( i = 2 ; i < number; i++){ if (number%i== 0 ){ stored=i; } } } return stored; } public static boolean isPrime ( int n){ for ( int j = 2 ; j <n; j ++){ if (n% j == 0 ) return false ; else return true ; } return false ; } } ☑ Here i created a new method isTrue. if the number is prime then the number will return the same as output. but if it is not a prime then it will return the largest number excluding itself.
Read more