Leap year Challange

 Write a method isLeapYear with a parameter of type int named the year

the parameter needs to be greater than or equal to1and less than or equal to 9999

if the parameter is not in the 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 a leap year, otherwise return false

to determine follow these steps---

  1. if the year is divisible by 4 then go to step 2. Otherwise, go to step 5.
  2. if  year is divisible by 100 then go to step 3. Otherwise, go to step 4.
  3. if  year is divisible by 4 then go to step 2. Otherwise, go to step 5.
  4. this is a leap year. the method isLeapYear return true.
  5. this is not a leap year. the method isLeapYear return false.



Soln   

               package com.cnc;

        public class Leap_Year_Test {
              public static boolean isLeapYear(int year) {

                if (!(year >= 1 && year <= 9999)) {
                    return false;
               } else {
                      int a = year % 4;
                          if (a == 0) {
                                 int b = year % 100;
                                             if (b == 0) {
                                                     int c = year % 400;
                                                          if (c == 0) {
                                                                  return true;
                                                                       } else
                                                                             return false;
                                                           } else
                                                                             return true;
                                              } else
                                                      return false;
        }

    }
}

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