48 CHALLENGE 3

 Create a method called displayHighScorePosition.It should a player's name as a parameter, and the 2nd parameter as a position in the high score table. You should display the player's name along with a message like "manage to get into position" and the position they got and a further message "on the high score table".
Create a 2nd method called calculatedHighScorePositon
it should send one argument only, the player score and it should return an int
the return data score should be
1 if the score is.>=1000
2 if score is >=500 and<1000
3 if the score is >=100 and<500
4 if in all other cases call both methods and display the following score of 1500, 900, 400 and 50

Soln:  package com.cnc;
public class Main {
    public static void main(String[] args) {
        int position = calculatedHighScorePosition(1500);
        displayHighScorePosition("Chinmoy",position);

        position = calculatedHighScorePosition(900);
        displayHighScorePosition("Cybeer",position);

        position = calculatedHighScorePosition(150);
        displayHighScorePosition("uno",position);

        position = calculatedHighScorePosition(50);
        displayHighScorePosition("Allien",position);
    }
public static void displayHighScorePosition(String name,int position){
        int p = position;
        String n = name;
    System.out.println(n+" managed to get the position "+p+" on the high score table");
     }
public static int calculatedHighScorePosition(int score){
       if(score>=1000){
           return 1;
       }
       else if(score>=500 && score<1000){
          return 2;
       }
       else if(score>=100 && score<500){
          return 3;
       }
       else{
           return 4;
       }
}


}


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