NUMBER OF DAYS IN A MONTH

 Write a method called isLeapYear with a parameter of type int named year.
The parameter needs to be greater than or equal to 1 and less than and equal to 9999. If the parameter is not in that range return false. Otherwise, if it is in the valid range, calculate if the year is a leap year and return true if it is, otherwise returns false.
[A year is a leap year if it is divisible by 4 not by 100, or it is divisible by 400]

Write another method getDaysInMonth with two parameters month and years. Both of type int
If parameter month is < 1 or > 12 return -1
If parameter year is < 1 or > 9999 return -1
This method needs to return the number of days in month. be careful about leap years (29 days in Feb)
[Use switch statements]
Soln package com.cnc;

public class Main {

    public static void main(String[] args) {
        System.out.println(isLeapYear(-2000));
        System.out.println(getDaysInMonth(-2,2000));
    }
    public static boolean isLeapYear(int year){
        if(year>=1 && year<=9999){
            if(year%4==0 && !(year%100==0) || year%400==0)return true;
            else return false;
        }else return false;
    }
    public static int getDaysInMonth(int month,int year){
        int days;
        if((month<1 || month>12)||(year<1 || year>9999))return -1;
        else

            switch (month){
                case 1: case 3: case 5: case 7: case 8: case 10: case 12:
                    days =(31);
                    break;
                case 2:
                    if(year%4==0 && !(year%100==0) || year%400==0){
                        days=(29);
                    }else days=(28);
                   break;
                
                case 4: case 6: case 9: case 11:
                    days=(30);
                    break;
               
                default:
                    throw new IllegalStateException("Unexpected value: " + month);
            }return days;
    }
}

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